Begin with a row of cups and end with all of the cups in a single stack.
1. Count the number of cups in a stack. That stack must jump that number of
spaces. For example, 1 cup can only move 1 space; 2 cups have to move 2
spaces; 3 cups have to move 3 spaces…
2. A cup or stack of cups cannot move into an empty space. They have to land
on another cup or stack of cups.
If you start with some beans on a seesaw and you’re given certain additional beans to place on the seesaw, can you do it so the seesaw balances?
In this activity, students start by trying to solve various challenges involving different arrangements of beans on the seesaw and then design their own challenges. Next, they try to predict which arrangements will make the seesaw balance and which ones won’t (and why!).
Escape Rooms and “Bomb Disposal” activities are growing in popularity as a form of team building and entertainment. This session blends the two ideas to create a cooperative math activity where the challenge is to solve math problems whose solutions generate combinations to open a locked box. The math problems can be selected to fit any audience, and the activity appeals to problem solvers of all ages.
A group of people, some that just met, have a dilemma. Some people owe money and some have money. Problem is that only people that know each other, connected by nodes, can give or lend a dollar. But they must give each person they know a dollar, even if that puts themselves in debt!! Find ways to give money in such a way so that everyone in the group has money or owes 0 dollars.
The rules are simple: you want to place the sheep on the board so that the wolves can’t eat them. A wolf can eat a sheep if it has a direct path to it – or is in same row, column, or diagonal as that sheep. Can you place all your wolves and sheep on an nxn grid so all the sheep are safe?
Students will explore a game between two players moving a chess Queen from place to place on a square grid. The Queen may move any number of spaces to the left, any number of spaces downward, and any number of spaces on the downward-left pointing diagonal. Each player takes turns using these moves. Whoever gets the Queen to the bottom-left square first wins!
Place our numbers into the cauldrons in ascending order – you can choose which cauldron each one goes in. However, if two numbers in one cauldron add up to a third number in that same cauldron, they bubble up and cause an explosion! This means that all the numbers, leave the cauldrons, and you must start all over again.
Our goal is to find the largest number we can place in our cauldrons without them exploding… do you think you’re up for this daunting task?
A prize is hidden behind one of three doors. You choose the door where you think the prize is hidden. But before the door is opened, one of the other 2 remaining doors is opened to reveal no prize. You can choose to keep the door you chose earlier or switch to the other remaining door. What should you do?
A town faces an epidemic of zombies! Luckily, the virus has just started to spread and the infected are able to stave off their hunger for human brains… for now. In fact, they’re willing to work alongside the remaining humans to help them get across a river to safety. Can you get all the humans and zombies across safely?