Conversation

Notices

1. Embed this notice
   vic (vic@seal.cafe)'s status on Tuesday, 09-Apr-2024 04:32:25 JST vic

   in reply to

   • 𝕥ℝ𝕠𝕃𝕃𝕚ℕ 𝕜𝕀𝕥𝕥𝔼𝕙
   • Daddy-Only fan
   @fuknukl @mrman easy
   • Fediverse Contractor likes this.
   • Embed this notice
     𝕥ℝ𝕠𝕃𝕃𝕚ℕ 𝕜𝕀𝕥𝕥𝔼𝕙 (fuknukl@noauthority.social)'s status on Tuesday, 09-Apr-2024 04:32:26 JST 𝕥ℝ𝕠𝕃𝕃𝕚ℕ 𝕜𝕀𝕥𝕥𝔼𝕙

     • Daddy-Only fan

     @mrman
     The puzzle you’ve presented is known as the Seven Bridges of Königsberg.

     The bad news is, this puzzle is actually unsolvable. Proven by mathematician Leonhard Euler in 1736 that no such walk exists.

     Unsolvable, because the land masses (or ‘nodes’ in graph theory) have an odd number of bridges (or ‘edges’). For a path to exist that crosses each bridge once, all but two of the nodes must have an even number of edges. In this case, every node has an odd number, which makes it impossible.

     Fediverse Contractor likes this.