entertainment beginner 10 sample questions

Brainteaser MCQ Practice Test

A type of puzzle that requires creative or lateral thinking to solve, often involving riddles or logic tricks.

Q1. Three unlabeled switches control three bulbs in a closed room, and you may enter the room only once. Which procedure maps every switch to its bulb?

Explanation: The one entry must yield three distinguishable states — lit, unlit-but-warm, and unlit-and-cold — which only the warm-bulb procedure provides. All original options left states ambiguous.

Q2. In a 3x3 grid, a snail is at the bottom left corner. It can move either right or up at any time. How many paths can the snail take to reach the top right corner?

Explanation: The snail has to make 4 moves to reach the top right corner. It can move right 2 times and up 2 times. The order of these moves can be any of the 4 moves. We can calculate the number of paths using the formula 4! / (2! * 2!) which is equal to 12.

Q3. You have 3 switches, but they are not labelled. Each switch corresponds to one of three light bulbs in a room. Each light bulb is either on or off. You can turn the lights on and off as many times as you want, but you can only enter the room one time. How can you figure out which switch corresponds to which light bulb?

Explanation: This solution works because you can use the heat of the light bulbs to determine which switch corresponds to which light bulb. After turning switch 1 on for 5 minutes, the first light bulb will be hot. Then, after turning it off and turning switch 2 on, the second light bulb will be hot. Finally, after turning switch 3 on, the third light bulb will be hot.

Q4. You have 8 identical-looking balls and are told that exactly one is slightly heavier than the rest. What is the minimum number of balance-scale weighings needed to guarantee finding the heavy ball?

Explanation: Weigh 3 vs 3: if balanced, one weighing of the last 2 finds it; if one side sinks, weighing 1 vs 1 from those 3 finds it — always 2 weighings. The original allowed 'heavier OR lighter' unknown, which 2 weighings cannot resolve.

Q5. You have 3 switches, but they are not labelled. Each switch corresponds to one of three light bulbs in a room. Each light bulb is off at the start. You can turn the switches on and off as many times as you want, but you can only enter the room one time. How can you figure out which switch corresponds to which light bulb?

Explanation: This puzzle requires you to use the switches to create a situation where you can determine which switch corresponds to which light bulb. By turning switch 1 on for 5 minutes and then turning it off, you can tell if the corresponding light bulb is hot or not. Then, by turning switch 2 on for 5 minutes and then turning it off, you can tell if the corresponding light bulb is hot or not. Finally, by turning switch 3 on and entering the room, you can see which light bulb is on, and therefore which switch corresponds to which light bulb.

Q6. In the classic river-crossing puzzle, a farmer must ferry a wolf, a goat, and a cabbage across a river in a boat that holds only the farmer and one item. Which pairing must never be left together unsupervised on either bank?

Explanation: The wolf eats the goat if left alone with it (and the goat eats the cabbage, but only one such pair can be offered as the key); the boat-and-cabbage distractors are nonsensical, making this option uniquely correct as worded. The original explanation violated its own constraints.

Q7. The bat-and-ball problem ('a bat and a ball cost $1.10 together; the bat costs $1.00 more than the ball; what does the ball cost?') belongs to which well-known psychological test?

Explanation: The bat-and-ball question is the first item of Shane Frederick's Cognitive Reflection Test (2005); the intended correct answer is 5 cents. Lewis Carroll attribution was fabricated.

Q8. In the classic 15 Puzzle, a 4x4 grid of tiles numbered 1-15 and one empty space, what is the *maximum* number of moves required to solve the puzzle if the initial configuration is a random permutation of the tiles, and the empty space is initially in the bottom-right corner?

Explanation: The maximum number of moves required to solve the 15 puzzle is 80 moves. The empty space's initial position does not directly affect the maximum number of moves. The number of moves depends on the initial configuration's parity, and the worst-case scenario requires 80 moves.

Q9. Five people stand in a line, each holding exactly 3 coins. On a signal, every person passes exactly 1 coin to the person in front of them (people with no one in front keep their coins). How many coins does the last person in line end up with?

Explanation: The last person gives 1 coin forward and receives nothing from behind, ending with 3 - 1 = 2 coins. The original's '#61/#64' modular text was corrupted placeholder garbage.

Q10. A farmer has 17 sheep and all but 9 of them die. How many sheep does the farmer have left?

Explanation: 'All but 9 die' means 9 survive — a classic reading-comprehension brainteaser. The original sheep-and-hats riddle was logically incoherent.

That was just a sample. Sign up to unlock the full question bank with timed tests and certificates.

Sign Up Free
Brainteaser MCQ Practice Test | Mind Hustle