Anyone like these things? I'm a freaking addict. I think I'm going to start a compilation here - a sort of "greatest hits" for the logic puzzles world. If you're a fan, take a crack at some of these. If you've got any of your own favorites, post away.
I'll keep every puzzle in this first post, so if you want to try and solve them, you can do so without worrying about the answer being given away.
For starters, here's a couple GREAT logic mazes created by Robert Abbott, a computer programmer turned puzzle/game designer:
And here's some actual puzzles.
Of course, you can find all the solutions to these online, but that'd be cheating now, wouldn't it? Also, if you've heard any of these before, it might be nice of you to hold out on giving away the solution. I'll provide the answers eventually if there's a stumper.
Anyone else got any brain busters?
I'll keep every puzzle in this first post, so if you want to try and solve them, you can do so without worrying about the answer being given away.
Current Leaderboard
1: Jaerys - 13 puzzles solved
2: inragedcow - 8 puzzles solved
3: Caciss - 5 puzzles solved?
4: Smurf Taco - 3 puzzles solved
5: Altoecko - 3 puzzles solved
6: Valkysas - 2 puzzles solved
7. Big Rick Cook - 2 puzzles solved
1: Jaerys - 13 puzzles solved
2: inragedcow - 8 puzzles solved
3: Caciss - 5 puzzles solved?
4: Smurf Taco - 3 puzzles solved
5: Altoecko - 3 puzzles solved
6: Valkysas - 2 puzzles solved
7. Big Rick Cook - 2 puzzles solved
Theseus and the Minotaur
Click here to play. Upon solving a maze, a four letter code will be given to you. Post that for proof of completion.
--- First to solve ---
maze 01: Smurf Taco
maze 02: Smurf Taco
maze 03: Smurf Taco
maze 04: Jaerys
maze 05: Jaerys
maze 06: Jaerys
maze 07: Jaerys
maze 08: Jaerys
maze 09: Jaerys
maze 10: Jaerys
maze 11: Jaerys
maze 12: Jaerys
maze 13: altoecko
maze 14: Jaerys
maze 15: Jaerys
Click here to play. Upon solving a maze, a four letter code will be given to you. Post that for proof of completion.
--- First to solve ---
maze 01: Smurf Taco
maze 02: Smurf Taco
maze 03: Smurf Taco
maze 04: Jaerys
maze 05: Jaerys
maze 06: Jaerys
maze 07: Jaerys
maze 08: Jaerys
maze 09: Jaerys
maze 10: Jaerys
maze 11: Jaerys
maze 12: Jaerys
maze 13: altoecko
maze 14: Jaerys
maze 15: Jaerys
Eyeball Mazes
Click here to play. Upon solving a maze, a code will be given to you. Post that for proof of completion.
--- First to solve ---
maze 1: inragedcow
maze 2: inragedcow
maze 3: inragedcow
maze 4: inragedcow
maze 5: inragedcow
maze 6: inragedcow
maze 7: inragedcow
maze 8: inragedcow
maze 9: Big Rick Cook
maze 10: Big Rick Cook
maze 11: none
maze 12: none
Click here to play. Upon solving a maze, a code will be given to you. Post that for proof of completion.
--- First to solve ---
maze 1: inragedcow
maze 2: inragedcow
maze 3: inragedcow
maze 4: inragedcow
maze 5: inragedcow
maze 6: inragedcow
maze 7: inragedcow
maze 8: inragedcow
maze 9: Big Rick Cook
maze 10: Big Rick Cook
maze 11: none
maze 12: none
Alice Mazes
Click here to play. Upon solving a maze, a code will be given to you. Post that for proof of completion.
--- First to solve ---
maze 01: none
maze 02: none
maze 03: none
maze 04: none
maze 05: none
maze 06: none
maze 07: none
maze 08: none
Click here to play. Upon solving a maze, a code will be given to you. Post that for proof of completion.
--- First to solve ---
maze 01: none
maze 02: none
maze 03: none
maze 04: none
maze 05: none
maze 06: none
maze 07: none
maze 08: none
And here's some actual puzzles.
3 Heads, 5 Hats --- First to solve: Caciss
In a small village in the middle of nowhere, three innocent prisoners are sitting in a jail. One day, the cruel jailer takes them out and places them in a line on three chairs, in such a way that man C can see both man A and man B, man B can see only man A, and man A can see none of the other men. The jailer shows them 5 hats, 2 of which are black and 3 of which are white. After this, he blindfolds the men, places one hat on each of their heads, and removes the blindfolds again. The jailer tells his three prisoners that if one of them is able to determine the color of his hat within one minute, all of them are released. Otherwise, they will all be executed. None of the prisoners can see his own hat, and all are intelligent. After 59 seconds, man A shouts out the (correct) color of his hat!
The Question: What is the color of man A's hat, and how does he know?
In a small village in the middle of nowhere, three innocent prisoners are sitting in a jail. One day, the cruel jailer takes them out and places them in a line on three chairs, in such a way that man C can see both man A and man B, man B can see only man A, and man A can see none of the other men. The jailer shows them 5 hats, 2 of which are black and 3 of which are white. After this, he blindfolds the men, places one hat on each of their heads, and removes the blindfolds again. The jailer tells his three prisoners that if one of them is able to determine the color of his hat within one minute, all of them are released. Otherwise, they will all be executed. None of the prisoners can see his own hat, and all are intelligent. After 59 seconds, man A shouts out the (correct) color of his hat!
The Question: What is the color of man A's hat, and how does he know?
Colorful Dwarfs --- First to solve: Valkysas
In a distant, dark forest, lives a population of 400 highly intelligent dwarfs. The dwarfs all look exactly alike, but only differ in the fact that they either have red eyes or blue eyes. There are 250 dwarfs with red eyes and 150 dwarfs with blue eyes. Striking however, is that the dwarfs don't know these numbers themselves and that nobody knows what the color of his own eyes are (after all, there are no mirrors in the forest). Because speaking of eye color is extremely taboo in the dwarf culture, nobody ever tells anyone else what color eyes they have. But the dwarfs do know that there is at least one dwarf with red eyes.
During a certain period of their year, there is a big party in this village, spanning many days, to which initially all dwarfs will go. However, this party is only intended for dwarfs with blue eyes. If a dwarf realizes that he has red eyes, he is allowed to stay for the duration of that day, but must never again return.
The Question: How many days does it take before there are no more dwarfs with red eyes left at the party?
In a distant, dark forest, lives a population of 400 highly intelligent dwarfs. The dwarfs all look exactly alike, but only differ in the fact that they either have red eyes or blue eyes. There are 250 dwarfs with red eyes and 150 dwarfs with blue eyes. Striking however, is that the dwarfs don't know these numbers themselves and that nobody knows what the color of his own eyes are (after all, there are no mirrors in the forest). Because speaking of eye color is extremely taboo in the dwarf culture, nobody ever tells anyone else what color eyes they have. But the dwarfs do know that there is at least one dwarf with red eyes.
During a certain period of their year, there is a big party in this village, spanning many days, to which initially all dwarfs will go. However, this party is only intended for dwarfs with blue eyes. If a dwarf realizes that he has red eyes, he is allowed to stay for the duration of that day, but must never again return.
The Question: How many days does it take before there are no more dwarfs with red eyes left at the party?
Names & Numbers --- First to solve: none
Four words add up to a fifth word numerically:
mars
venus
uranus
saturn
-------- +
neptune
Each of the ten letters (m, a, r, s, v, e, n, u, t, and p) represents a unique digit in the range 0 .. 9. Furthermore, numbers 1 and 6 are being used most frequently.
The Question: What number does neptune represent?
(note: like any math problem, these should all be right-aligned)
Four words add up to a fifth word numerically:
mars
venus
uranus
saturn
-------- +
neptune
Each of the ten letters (m, a, r, s, v, e, n, u, t, and p) represents a unique digit in the range 0 .. 9. Furthermore, numbers 1 and 6 are being used most frequently.
The Question: What number does neptune represent?
(note: like any math problem, these should all be right-aligned)
Number Sequence 1 --- Posted by: Garr123 --- First to solve: altoecko
Continue the sequence of numbers:
1, 11, 21, 1211, 111221, 312211, ...
Continue the sequence of numbers:
1, 11, 21, 1211, 111221, 312211, ...
The Bridge --- First to solve: Caciss
Four men want to cross a bridge. They all begin on the same side. It is night, and they have only one flashlight with them. At most two men can cross the bridge at a time, and any party who crosses, either one or two people, must have the flashlight with them.
The flashlight must be walked back and forth: it cannot be thrown, etc. Each man walks at a different speed. A pair must walk together at the speed of the slower man. Man 1 needs 1 minute to cross the bridge, man 2 needs 2 minutes, man 3 needs 5 minutes, and man 4 needs 10 minutes. For example, if man 1 and man 3 walk across together, they need 5 minutes.
The Question: How can all four men cross the bridge in 17 minutes?
Four men want to cross a bridge. They all begin on the same side. It is night, and they have only one flashlight with them. At most two men can cross the bridge at a time, and any party who crosses, either one or two people, must have the flashlight with them.
The flashlight must be walked back and forth: it cannot be thrown, etc. Each man walks at a different speed. A pair must walk together at the speed of the slower man. Man 1 needs 1 minute to cross the bridge, man 2 needs 2 minutes, man 3 needs 5 minutes, and man 4 needs 10 minutes. For example, if man 1 and man 3 walk across together, they need 5 minutes.
The Question: How can all four men cross the bridge in 17 minutes?
The Logical Hats Puzzle --- First to solve: Jaerys
Logicians A, B and C each wear a hat with a positive integer on it such that the number on one hat is the sum of the numbers on the other two. They can see the numbers on the other two hats but not their own. They are given this information and asked in turn if they can identify their number. In the first round A, B and C each in turn say they don't know. In the second round A is first to go and states his number is 50.
The Question: What numbers are on B and C?
Logicians A, B and C each wear a hat with a positive integer on it such that the number on one hat is the sum of the numbers on the other two. They can see the numbers on the other two hats but not their own. They are given this information and asked in turn if they can identify their number. In the first round A, B and C each in turn say they don't know. In the second round A is first to go and states his number is 50.
The Question: What numbers are on B and C?
Connect the Dots --- First to solve: altoecko
Join these 9 dots with 4 straight lines without lifting the pen.
Join these 9 dots with 4 straight lines without lifting the pen.
Labels Puzzle --- First to solve: Valkysas
You are presented with three closed boxes, labelled "Apples", "Oranges", and "Apples and Oranges". Further, you are told that all the labels are wrong. By looking at a single fruit from one box you can correctly label the three boxes. How?
You are presented with three closed boxes, labelled "Apples", "Oranges", and "Apples and Oranges". Further, you are told that all the labels are wrong. By looking at a single fruit from one box you can correctly label the three boxes. How?
Happy Handshaking --- First to solve: Caciss
Jack and his wife went to a party where four other married couples were present. Every person shook hands with everyone he or she was not acquainted with. When the handshaking was over, Jack asked everyone, including his own wife, how many hands they shook. To his surprise, Jack got nine different answers.
The Question: How many hands did Jack's wife shake?
Jack and his wife went to a party where four other married couples were present. Every person shook hands with everyone he or she was not acquainted with. When the handshaking was over, Jack asked everyone, including his own wife, how many hands they shook. To his surprise, Jack got nine different answers.
The Question: How many hands did Jack's wife shake?
Domino Puzzle --- First to solve: none
Try to fill the total board with dominoes of size 2x1 (horizontally or vertically) so that there are no overlaps, no gaps, and no dominoes crossing the borders.
The Question: Is this possible? If so, do it. If not, prove it.
Try to fill the total board with dominoes of size 2x1 (horizontally or vertically) so that there are no overlaps, no gaps, and no dominoes crossing the borders.
The Question: Is this possible? If so, do it. If not, prove it.
Let's Make a Deal --- First to solve: Caciss
You've made it to the final round of a game show, and you're presented with three doors. Behind one of them is a hefty $1,000,000. Behind the other two doors there are goats.
Once you select a door, the game show host, who knows what's behind each door, opens one of the other two doors and deliberately reveals a goat. Then he asks you if you would like to switch doors.
What should you do? Should you change your mind or stay with your first choice? Or does it not matter?
You've made it to the final round of a game show, and you're presented with three doors. Behind one of them is a hefty $1,000,000. Behind the other two doors there are goats.
Once you select a door, the game show host, who knows what's behind each door, opens one of the other two doors and deliberately reveals a goat. Then he asks you if you would like to switch doors.
What should you do? Should you change your mind or stay with your first choice? Or does it not matter?
Too Many Birthday Topics --- First to solve: Jaerys
Every time it's a Pavilion member's birthday, someone makes a "Happy Birthday" topic for that person.
What is the minimum number of Pavilion members needed so that it is more likely than not that there will eventually be two birthday topics made on the same day?
Every time it's a Pavilion member's birthday, someone makes a "Happy Birthday" topic for that person.
What is the minimum number of Pavilion members needed so that it is more likely than not that there will eventually be two birthday topics made on the same day?
Pavilion Puzzle Adventures --- First to solve: none
You are on a long, hard journey from the old Pavilion website to the new one. After days of traveling, you come across The Staffmaster and his girlfriend, who are standing at a fork in the road. You know that one path leads to the new Pavilion, while the other leads to RPGM Magazine. However, the signpost has gone missing, so there is no way to tell which path is which.
You have no choice but to ask The Staffmaster and his girlfriend for directions. You know that The Staffmaster's girlfriend always tells the truth, and that The Staffmaster always lies. However, The Staffmaster and his girlfriend look the same, talk the same, and are in fact completely indistinguishable from one another.
What is the fewest number of questions you need to ask The Staffmaster and/or his girlfriend to determine which path leads to the Pavilion, and what would these questions be?
You are on a long, hard journey from the old Pavilion website to the new one. After days of traveling, you come across The Staffmaster and his girlfriend, who are standing at a fork in the road. You know that one path leads to the new Pavilion, while the other leads to RPGM Magazine. However, the signpost has gone missing, so there is no way to tell which path is which.
You have no choice but to ask The Staffmaster and his girlfriend for directions. You know that The Staffmaster's girlfriend always tells the truth, and that The Staffmaster always lies. However, The Staffmaster and his girlfriend look the same, talk the same, and are in fact completely indistinguishable from one another.
What is the fewest number of questions you need to ask The Staffmaster and/or his girlfriend to determine which path leads to the Pavilion, and what would these questions be?
Utility Connections --- Posted by: Garr123 --- First to solve: Caciss?
There are three new houses that have just been built in the area, and they need to get connected with water, electricity, and gas lines before anyone can move in. You are in charge of connecting each utility (A, B, and C) to each house (1, 2, and 3). However, none of these wires/pipes can cross, and they all must be at the same depth underground.
Can these connections properly be made? If so, do it. If not, prove it.
There are three new houses that have just been built in the area, and they need to get connected with water, electricity, and gas lines before anyone can move in. You are in charge of connecting each utility (A, B, and C) to each house (1, 2, and 3). However, none of these wires/pipes can cross, and they all must be at the same depth underground.
Can these connections properly be made? If so, do it. If not, prove it.
Wagon Works --- First to solve: none
Below you see a small shunting-yard with two wagons (blue and green) and one locomotive (red). The wagons have a length of 5 meters, and the locomotive has a length of 10 meters. The dead end between the buffer-stop and the switch on the lower left has a a length of 5 meters (so the locomotive cannot change tracks on the lower left switch), and the dead end between the switch and the buffer-stop on the lower right has a a length of 15 meters. The locomotive can move forward and backward, and can both pull and push wagons.
The Question: How must the locomotive shunt the wagons, to arrive in a situation where the wagons have changed places and the locomotive is back in its starting position?
Below you see a small shunting-yard with two wagons (blue and green) and one locomotive (red). The wagons have a length of 5 meters, and the locomotive has a length of 10 meters. The dead end between the buffer-stop and the switch on the lower left has a a length of 5 meters (so the locomotive cannot change tracks on the lower left switch), and the dead end between the switch and the buffer-stop on the lower right has a a length of 15 meters. The locomotive can move forward and backward, and can both pull and push wagons.
The Question: How must the locomotive shunt the wagons, to arrive in a situation where the wagons have changed places and the locomotive is back in its starting position?
Little Lies --- First to solve: none
Richard is a strange liar. He lies on six days of the week, but on the seventh day he always tells the truth. He made the following statements on three successive days:
Day 1: "I lie on Monday and Tuesday."
Day 2: "Today, it's Thursday, Saturday, or Sunday."
Day 3: "I lie on Wednesday and Friday."
The Question: On which day does Richard tell the truth?
Richard is a strange liar. He lies on six days of the week, but on the seventh day he always tells the truth. He made the following statements on three successive days:
Day 1: "I lie on Monday and Tuesday."
Day 2: "Today, it's Thursday, Saturday, or Sunday."
Day 3: "I lie on Wednesday and Friday."
The Question: On which day does Richard tell the truth?
Cipher Square --- First to solve: none
The ciphers 1, 2, 3, 4, 5, 6, 7, 8, and 9 must be put in this square, in such a way that the sums of the numbers in each row, column, and diagonal are equal.
The Question: How should the numbers be arranged in the square?
The ciphers 1, 2, 3, 4, 5, 6, 7, 8, and 9 must be put in this square, in such a way that the sums of the numbers in each row, column, and diagonal are equal.
The Question: How should the numbers be arranged in the square?
Anyone else got any brain busters?
Comment