Check out the past discussion problems below. Make sure to scroll right to see the entire collection.
(You need to view this on a laptop)
Join our discord server to join the discussion of these problems.
Our puzzles are based on public resources provided by JRMF.org.

Tower of Hanoi

In class, we talked about how the Tower of Hanoi is based on recursive relations. We also found the recursive relation for the Tower of Hanoi with three pegs. We then explored the Tower of Hanoi with two rings of each color, four pegs, and five pegs. We ended by exploring the Tower of Hanoi with colored pegs. In particular, we explored the case where A and B are pegs of one color, while C is another color. You can only move rings between pegs of different colors. Can you find the number of moves with four rings and five rings for the Tower of Hanoi with colored pegs?

River Crossings

In class, we started with the classic river crossing problem of a wolf, a goat, and a cabbage. We then moved on to a variation in which we need to carry humans and zombies instead. Remember, if there are more zombies than humans on any side of the river, all of the humans on that side will die. How would you solve the case with 4 humans and 4 zombies, along with a boat with two slots? Is it impossible? If so, what is your reasoning?

Check out the past discussion problems below. Make sure to scroll right to see the entire collection. (You need to view this on a laptop) Join our discord server to join the discussion of these problems. Our puzzles are based on public resources provided by JRMF.org.

Check out the past discussion problems below. Make sure to scroll right to see the entire collection.
(You need to view this on a laptop)
Join our discord server to join the discussion of these problems.
Our puzzles are based on public resources provided by JRMF.org.