{"id":6097,"date":"2017-01-27T18:22:17","date_gmt":"2017-01-27T18:22:17","guid":{"rendered":"https:\/\/blog.lib.uiowa.edu\/eng\/?p=5152"},"modified":"2017-01-27T18:22:17","modified_gmt":"2017-01-27T18:22:17","slug":"january-29th-is-national-puzzle-day-2","status":"publish","type":"post","link":"https:\/\/blog.lib.uiowa.edu\/combo\/2017\/01\/27\/january-29th-is-national-puzzle-day-2\/","title":{"rendered":"January 29th is National Puzzle Day!!"},"content":{"rendered":"<p><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube_square-150x150.jpg\" class=\"attachment-thumbnail size-thumbnail wp-post-image\" alt=\"\" srcset=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube_square-150x150.jpg 150w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube_square-36x36.jpg 36w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube_square-115x115.jpg 115w\" sizes=\"(max-width: 150px) 100vw, 150px\" \/><\/p>\n<p style=\"text-align: center\">Are you addicted to Sudoku? Rubik&#8217;s Cube<sup>\u00a9<\/sup> ? Logic puzzles?<\/p>\n<p style=\"text-align: center\">Well, you are in luck, because &#8212;<\/p>\n<h3 style=\"text-align: center\">Sunday, January 29th, 2017 is National Puzzle Day!!<\/h3>\n<p>&nbsp;<\/p>\n<blockquote>\n<ul>\n<li>\n<div>Nothing is a difficult as it seems<\/div>\n<\/li>\n<li>\n<div>Nothing is as easy as it looks<\/div>\n<\/li>\n<li>\n<div>Puzzles always have\u00a0<strong>one<\/strong>, <strong>several<\/strong>, or\u00a0<strong>no<\/strong> solutions<\/div>\n<\/li>\n<\/ul>\n<div style=\"text-align: left\"><sup>(Gianni A. Sarcone in the introduction to<a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21332496330002771\" >\u00a0<em>Impossible Folding Puzzles and Other Mathematical Paradoxes<\/em><\/a>)<\/sup><\/div>\n<\/blockquote>\n<p>SO many puzzles! Where does one even begin!?<\/p>\n<p>How about Tic-Tac-Toe!\u00a0<a href=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/TicTacToe.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignright wp-image-5171\" src=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/TicTacToe.png\" alt=\"\" width=\"139\" height=\"139\" srcset=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/TicTacToe.png 512w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/TicTacToe-150x150.png 150w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/TicTacToe-300x300.png 300w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/TicTacToe-36x36.png 36w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/TicTacToe-115x115.png 115w\" sizes=\"(max-width: 139px) 100vw, 139px\" \/><\/a><\/p>\n<p>How much time did you spend playing tick-tac-toe when you were a kid? \u00a0Did you realize the person who had the first go was at a disadvantage? The first player\u00a0actually has to draw one connecting line longer than the opponent. \u00a0So, if you are the first to go and still win, that&#8217;s impressive! If you add more squares &#8211; say 18 &#8211; there are 153 connecting lines. Which means there are 3<sup>153<\/sup> game situations &#8211; roughly equivalent to the number of particles in the universe. Searching for a winning strategy is quite impossible and sometimes referred to as &#8220;computational chaos.&#8221; I had trouble winning with just 9 squares&#8230;.<\/p>\n<p>Another popular grid puzzle is Sudoku. The most common version of the puzzle consists of 9 squares by 9 squares &#8211; a grid of 81 squares. The grid is divided into 9 blocks, each containing 9 squares. The rules: each of the 9 blocks must contain all the numbers 1 &#8211; 9 within the squares. Each number can only appear once in a row, column or box. The tricky part is that each vertical 9-square column or horizontal 9-square line &#8211; within the larger square &#8211; must also contain each of the numbers 1 &#8211; 9, with no repeats&#8230; Each puzzle has only one solution&#8230;<\/p>\n<p><a href=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Circular_Sudoku.jpg\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-5194\" src=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Circular_Sudoku.jpg\" alt=\"\" width=\"133\" height=\"131\" srcset=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Circular_Sudoku.jpg 450w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Circular_Sudoku-300x296.jpg 300w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Circular_Sudoku-36x36.jpg 36w\" sizes=\"(max-width: 133px) 100vw, 133px\" \/><\/a>If that isn&#8217;t challenging enough, there are also\u00a0circular Sudoku puzzles!<\/p>\n<p>Each of the 4 rings and 8 quarter circles have the numbers 1 through 8 (unlike the square version which has 9). Of course, you can always have 3-ring puzzles, or 5 and 6 ring puzzles.\u00a0Variants and puzzles can be found in\u00a0<em><a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21457503580002771\" >Nets, Puzzles, and Postmen<\/a>.<\/em><\/p>\n<p>How many of us have tried to solve the Rubik&#8217;s Cube<sup>\u00a9<\/sup> ?<\/p>\n<p><a href=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube.jpg\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-5168 alignright\" src=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube.jpg\" alt=\"\" width=\"141\" height=\"91\" srcset=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube.jpg 1240w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube-300x194.jpg 300w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube-1024x661.jpg 1024w\" sizes=\"(max-width: 141px) 100vw, 141px\" \/><\/a><\/p>\n<p>The classic Rubik&#8217;s Cube<sup>\u00a9<\/sup> consists<span style=\"font-size: 13.3333px\">\u00a0 <\/span>of 26 cubelets on 3 levels. Each level of cubelets can be twisted by 90 or 180 degrees. If you twist the layers independently the cube can be brought into approximately 43 million, trillion possible states of the cube (yes, really 43 million trillion!) &#8230; The goal? Make each side of nine cubelets the same color. Tomas Rokicki, a Stanford trained mathematician, ran a program on the supercomputer at Sony Pictures Imageworks. The computing time required the equivalent of 50 years of computing &#8211; and with solving more than 25 million billion configurations none were recorded that required fewer than 22 moves. Are you able to do it in 22 moves? Are you able to do it in <em>fewer<\/em> than 22 moves?<\/p>\n<p>Are you able to solve it in a minute and a half? This robot made with Legos<sup>\u00a9<\/sup> and Raspberry Pi (we have the Raspberry Pi 2 in our <a href=\"http:\/\/www.lib.uiowa.edu\/eng\/tool-library\/\" >Tool Library<\/a>!) can!<\/p>\n<p style=\"text-align: center\">\n<!-- Code Embed v2.2.1 --><br \/>\n<iframe loading=\"lazy\" width=\"320\" height=\"215\" src=\"https:\/\/www.youtube.com\/embed\/jcDqRDYIceQ\" frameborder=\"0\" allowfullscreen><\/iframe><br \/>\n<!-- End of Code Embed code -->\n<\/p>\n<p><a href=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Baby-donut-stacker.jpg\"><img loading=\"lazy\" decoding=\"async\" class=\"wp-image-5187 alignleft\" src=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Baby-donut-stacker.jpg\" alt=\"\" width=\"52\" height=\"52\" srcset=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Baby-donut-stacker.jpg 316w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Baby-donut-stacker-150x150.jpg 150w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Baby-donut-stacker-300x300.jpg 300w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Baby-donut-stacker-36x36.jpg 36w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Baby-donut-stacker-115x115.jpg 115w\" sizes=\"(max-width: 52px) 100vw, 52px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>Ready for the grown-up version of the baby donut stacker?<\/p>\n<p>The Tower of Hanoi is a much more complicated\u00a0form of the donut stacker. It was invented by the French mathematician, Edouard Lucas, and was first sold as a toy in 1883. The goal is to transfer the tower of 8 disks to one of the 2 vacant pegs in the fewest moves possible&#8230;without putting a larger disk on a smaller one&#8230;. For 8 disks that will take 255 moves&#8230; If you haven&#8217;t figured it out for yourself, the complete mathematical formulas are on pages 196-200 in\u00a0<em><a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA51575059230002771\" >Famous Puzzles of Great Mathematicians<\/a>.<\/em><\/p>\n<p>&nbsp;<\/p>\n<p><a href=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Tower-of-Hanoi.jpg\"><img loading=\"lazy\" decoding=\"async\" class=\"aligncenter wp-image-5166\" src=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Tower-of-Hanoi.jpg\" alt=\"\" width=\"277\" height=\"122\" srcset=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Tower-of-Hanoi.jpg 677w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Tower-of-Hanoi-300x132.jpg 300w\" sizes=\"(max-width: 277px) 100vw, 277px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>Logic puzzles more your style? Try to solve these &#8211; good luck!!<\/p>\n<ul>\n<li>Wine &amp; Water:\n<ul>\n<li>A dishonest servant takes 3 pints of wine from a barrel and replaces those pints with the same amount of water. He repeats his theft twice, removing a total of 9 pints, replacing those pints with water. As a result, the diluted wine remaining in the barrel lost half of its former strength. How much wine did the barrel originally hold?<\/li>\n<\/ul>\n<\/li>\n<li>Animals in a field:\n<ul>\n<li>A cow, a goat, and a goose graze on grass in a field. The cow eats the same quantity of grass as the goat and the goose together. the cow and the goat eat all of the grass in the field in 45 days, the cow and the goose in 60 days, and the goat and the goose in 90 days. How many days will it take the cow, the goat, and the goose together to eat all of the grass, assuming that the grass grows at the same daily rate?<\/li>\n<\/ul>\n<\/li>\n<li>Compose plane figures\/Fibonacci&#8217;s numbers:\n<ul>\n<li>Make a rectangle without any gaps by using small squares whoe sides are the Fibonacci numbers 1, 1, 2, 3, 5, 8, 13, and 21.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p><sup>(answers to these puzzles can be found in <em><a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA51575059230002771\" >Famous Puzzles of Great Mathematicians<\/a><\/em>.<em>)<\/em><\/sup><\/p>\n<p>Want more logic puzzles? <em><a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21451767940002771\" >Origami, Eleusis, and the Soma Cube<\/a><\/em>, by Martin Gardner presents (among others) a puzzle called The Monkey and the Coconuts&#8230;<\/p>\n<p>Ever heard of the &#8220;pea and the sun paradox?&#8221; A solid of any size (a small pea for example), can be partitioned into a finite number of pieces and then reassembled to form another solid of any specified shape and volume, (the sun, for example). Is that even possible? Author Leonard Wapner explores this (and many more) puzzles in\u00a0<a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21478011790002771\" ><em>The Pea &amp; the Sun : A Mathematical Paradox.<\/em><\/a><\/p>\n<p>Or perhaps you would rather eat the puzzle? Try the chocolate puzzle with real chocolate bars and enjoy them once you have solved the puzzle!<\/p>\n<p><a href=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Chocolate_Puzzle_crop2.jpg\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-5201\" src=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Chocolate_Puzzle_crop2.jpg\" alt=\"\" width=\"268\" height=\"366\" srcset=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Chocolate_Puzzle_crop2.jpg 1499w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Chocolate_Puzzle_crop2-220x300.jpg 220w, https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Chocolate_Puzzle_crop2-750x1024.jpg 750w\" sizes=\"(max-width: 268px) 100vw, 268px\" \/><\/a><\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>The solution may found on page 67 of\u00a0<em><a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21332496330002771\" >Impossible Folding Puzzles and Other Mathematical Paradoxes<\/a>.<\/em><\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n<p><strong>Resources:<\/strong><\/p>\n<p>Smullyan, Raymond M. 2009.\u00a0<em>Satan, Cantor and infinity : mind-boggling puzzles.\u00a0<\/em>Mineola, NY : Dover Publications. <a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21348589630002771\" >Engineering Library QA 95 .S5 2009\u00a0<\/a><\/p>\n<p>Szpior, George. 2010.\u00a0<em>A mathematical\u00a0medley : fifty easy pieces on mathematics.<\/em>\u00a0Providence, R.I. : American Mathematical Society.\u00a0<a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA51574598650002771\" >Engineering Library QA93 .S973 2010<\/a><\/p>\n<p>Gardner, Martin.\u00a0<em>Hexaflexagons, probability paradoxes, and the tower of Hanoi.<\/em>\u00a02008. Cambridge ; New York : Cambridge University Press.\u00a0<a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21454494240002771\" >Engineering Library QA95 .G247 2008<\/a><\/p>\n<p>Higgins, Peter M.\u00a0<em>Nets, puzzles, and postmen.<\/em>\u00a02007. Oxford ; New York : Oxford University Press.\u00a0<a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21457503580002771\" >Engineering Library QA95 .H54 2007<\/a><\/p>\n<p>Clarke, Barry R. 2013.\u00a0<em>Mathematical puzzles &amp; curiosities.<\/em>\u00a0Mineola, N.Y. : Dover Publications.\u00a0<a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21482314360002771\" >Engineering Library QA95 .C53 2013<\/a><\/p>\n<p>Petkovic, Miodrag S.\u00a0<em>Famous puzzles of great mathematicians.<\/em>Providence, R.I. : American Mathematical Society.\u00a0<a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA51575059230002771\" >Engineering Library QA95 .P4358 2009 2009<\/a><\/p>\n<p>Sarcone, Gianni A. 2013. \u00a0<em>Impossible folding puzzles and other mathematical paradoxes.<\/em>\u00a0Mineola, New York : Dover Publications. <a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21332496330002771\" >Engineering Library QA95 .S315 2013<\/a><\/p>\n<p>Gardner, Martin. 2008.\u00a0<em>Origami, Eleusis, and the Soma cube: Martin Garnder&#8217;s mathematical diversions.\u00a0<\/em>Cambridge ; New York : Cambridge University Press.\u00a0<a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21451767940002771\" >Engineering Library AQ95 .G2975 2008<\/a><\/p>\n<p>Wapner, Leonard M. 2005.\u00a0<em>The pea &amp; the sun : a mathematical paradox.\u00a0<\/em>\u00a0Wellesley, MA : A.K. Peters.\u00a0<a href=\"http:\/\/search.lib.uiowa.edu\/01IOWA:default_scope:01IOWA_ALMA21478011790002771\" >Engineering Library QA248 .W29 2005<\/a><\/p>\n<p><em>Count on Sudoku.<\/em>\u00a02005.\u00a0<a href=\"http:\/\/www.counton.org\/sudoku\/rules-of-sudoku.php\" ><em>c<\/em>ounton.org<\/a><\/p>\n<p><em>Lego Rubik&#8217;s Cube Solver.<\/em><a href=\"https:\/\/www.youtube.com\/watch?v=jcDqRDYIceQ\" >youtube<\/a> .\u00a0Date accessed January 31, 2017<\/p>\n<p><em>Raspberry Pi-powered Lego robot can solve a Rubik&#8217;s cube.<\/em><a href=\"https:\/\/thenextweb.com\/shareables\/2017\/01\/30\/rubiks-cube-solver-lego-raspberry-pi\/\" >The Next Web B.V.<\/a> January 31, 2017. TNW.<\/p>\n","protected":false},"excerpt":{"rendered":"<p><img loading=\"lazy\" decoding=\"async\" width=\"150\" height=\"150\" src=\"https:\/\/blog.lib.uiowa.edu\/eng\/files\/2017\/01\/Rubik-Cube_square-150x150.jpg\" alt=\"\">Are you addicted to Sudoku? Rubik&rsquo;s Cube&copy; ? Logic puzzles? Well, you are in luck, because &mdash; Sunday, January 29th, 2017 is National Puzzle Day!! &nbsp; Nothing is a difficult [&hellip;]<\/p>\n","protected":false},"author":163,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"_links":{"self":[{"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/posts\/6097"}],"collection":[{"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/users\/163"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/comments?post=6097"}],"version-history":[{"count":1,"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/posts\/6097\/revisions"}],"predecessor-version":[{"id":6100,"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/posts\/6097\/revisions\/6100"}],"wp:attachment":[{"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/media?parent=6097"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/categories?post=6097"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.lib.uiowa.edu\/combo\/wp-json\/wp\/v2\/tags?post=6097"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}