A variant involving a Blue Prince, a Red Prince, and a Bishop, as well as 3 new connections exists in which students are required to determine where to place the 3 new links.
A variant involving a Blue Prince, a Red Prince, and a Bishop, as well as 3 new connections exists in which students are required to determine where to place the 3 new links.* The original was proven impossible by Euler in 1736, when he determined that no node could have an odd number of links if a complete circuit of the desired form were to occur and that either no nodes or 2 nodes could have an odd number of links if the origin does not need to coincide with the terminus. FTP, what is this common math problem based on the geography of an 18th Century German city?
A variant involving a Blue Prince, a Red Prince, and a Bishop, as well as 3 new connections exists in which students are required to determine where to place the 3 new links.
Seven Bridges of Königsberg