
    
        
        
        
            
{"version":"https:\/\/jsonfeed.org\/version\/1","title":"mathspp.com feed","home_page_url":"https:\/\/mathspp.com\/blog\/tags\/topology","feed_url":"https:\/\/mathspp.com\/blog\/tags\/topology.json","description":"Stay up-to-date with the articles on mathematics and programming that get published to mathspp.com.","author":{"name":"Rodrigo Gir\u00e3o Serr\u00e3o"},"items":[{"title":"Problem #038 \u2013 bridges of K\u00f6nigsberg","date_published":"2021-06-13T00:00:00+02:00","id":"https:\/\/mathspp.com\/blog\/problems\/bridges-of-konigsberg","url":"https:\/\/mathspp.com\/blog\/problems\/bridges-of-konigsberg","content_html":"<p>You are on vacation and must find the most efficient way to\ncross all bridges.\nHow will you do that?<\/p>\n\n<figure class=\"image-caption\"><img title=\"Satellite view of Kaliningrad, Russia.\" alt=\"\" src=\"\/user\/pages\/02.blog\/03.problems\/p038-bridges-of-konigsberg\/thumbnail.webp\"><figcaption class=\"\">Satellite view of Kaliningrad, Russia.<\/figcaption><\/figure><h2 id=\"problem-statement\">Problem statement<a href=\"#problem-statement\" class=\"toc-anchor after\" data-anchor-icon=\"#\" aria-label=\"Anchor\"><\/a><\/h2>\n<p>If you like solving riddles and puzzles, it is likely that you have\nalready encountered this puzzle.\nBut even if you have, it is always good to go back\nand think about the classics.\nOn top of that, I will formulate the problem in a slightly different\nway, so that you can be entertained for a bit even if you already\nknow the more classic version.<\/p>\n<p>Take a look at this satellite view from Kaliningrad, Russia,\nwhere I have highlighted seven bridges:<\/p>\n<figure class=\"image-caption\"><img title=\"Seven highlighted bridges in Kaliningrad, Russia.\" alt=\"\" src=\"\/user\/pages\/02.blog\/03.problems\/p038-bridges-of-konigsberg\/_bridges.webp\"><figcaption class=\"\">Seven highlighted bridges in Kaliningrad, Russia.<\/figcaption><\/figure><p>Your task is to figure out what route to take if what you want to do\nis cross all of the highlighted bridges at least once but,\nat the same time, keep the total number of crossed bridges as low\nas possible.<\/p>\n<p>Having said that, what is the best route you can come up with?<\/p>\n<p>(Just to be clear, I don't care about the length of the route &ndash;\nthe number of miles\/kilometres you would walk\/drive &ndash; I only\ncare about the number of bridges you cross.)<\/p>\n<div class=\"notices blue\">\n<p>Give it some thought!<\/p>\n<\/div>\n<p>If you need any clarification whatsoever, feel free to ask in the comment section below.<\/p>\n<p>In case you are wondering, the classic version of this puzzle is\ndubbed &ldquo;the seven bridges of K&ouml;nigsberg&rdquo; because that\nis what this place was called when a famous mathematician first\ndwelled on this problem.<\/p>\n<h2 id=\"solvers\">Solvers<a href=\"#solvers\" class=\"toc-anchor after\" data-anchor-icon=\"#\" aria-label=\"Anchor\"><\/a><\/h2>\n<p>Congratulations to the ones that solved this problem correctly and, in particular, to the ones\nwho sent me their correct solutions:<\/p>\n<ul><li>Attila K., (Hungary)<\/li>\n<\/ul><h2 id=\"solution\">Solution<a href=\"#solution\" class=\"toc-anchor after\" data-anchor-icon=\"#\" aria-label=\"Anchor\"><\/a><\/h2>\n<p>There are seven distinct bridges that we want to traverse,\nso we know the shortest path has to go over seven bridges, minimum.\nWhat we will show is that, actually, we need to go over eight bridges\nin total in order to visit all seven bridges.<\/p>\n<p>In order to show that is the case, consider the following figure:<\/p>\n<figure class=\"image-caption\"><img title=\"Numbered pieces of land connected to the bridges.\" alt=\"\" src=\"\/user\/pages\/02.blog\/03.problems\/p038-bridges-of-konigsberg\/_bridges_lands.webp\"><figcaption class=\"\">Numbered pieces of land connected to the bridges.<\/figcaption><\/figure><p>In the figure above we can see that I numbered the four pieces\nof land to which the bridges are connected.<\/p>\n<p>How many bridges does each piece of land connect to?<\/p>\n<ol><li>connects to 3 bridges;<\/li>\n<li>connects to 3 bridges (as well);<\/li>\n<li>connects to 3 bridges (as well); and<\/li>\n<li>connects to 5 bridges.<\/li>\n<\/ol><p>Now we will use this information to show that it is impossible to create\na path that visits all bridges exactly once.<\/p>\n<p>Let us think about a hypothetical path we would do,\nin order to traverse all the bridges exactly once.\nMore specifically, let us think about what happens\nin the middle of our walk.\nIf we are in the middle of our path,\nwhen we enter some piece of land through a bridge,\nwe have to leave that piece of land through another bridge.\nIn other words, for each time we <em>arrive<\/em> at a piece of land,\nwe also...<\/p>","summary":"Can you solve this classical puzzle where you just have to cross some bridges?","date_modified":"2025-11-22T09:33:35+01:00","tags":["graphs","mathematics","topology"],"image":"\/user\/pages\/02.blog\/03.problems\/p038-bridges-of-konigsberg\/thumbnail.webp"}]}
