[Ans] Two of these three puzzles are impossible to solve. Which is the only solvable one?

[1-29-2022] Microsoft Rewards Bing Homepage Quiz Question: Two of these three puzzles are impossible to solve. Which is the only solvable one?

The given options are:

  • Three-cups problem
  • Seven Bridges of Königsberg
  • Tower of Hanoi

Correct Answer: Tower of Hanoi

Information: Unlike the Seven Bridges problem proved impossible by Leonhard Euler, or the unwinnable ‘three-cups challenge’ that’s made its way into many a magic act, the Tower of Hanoi is solvable. But depending on how many disks are included in the puzzle, it can take an impossibly long time. A version of the game with three disks can be solved easily in seven moves—but with 64 disks, it would take more than 500 billion years at a rate of one move per second.


All three questions from today’s Bing Quiz are below. You can find their answers by visiting those pages.

  1. What are we seeing in this puzzling image?
  2. ‘👁 ♥ 🧩 🗓’ is an example of what type of puzzle?
  3. Two of these three puzzles are impossible to solve. Which is the only solvable one?

Similar Posts

Leave a Reply

Your email address will not be published.

This site uses Akismet to reduce spam. Learn how your comment data is processed.