Search Results

In this game, learners experience how computers divide a big problem into many smaller ones and how they use binary "yes"/"no" questions.

In this computer science activity about finite-state automaton (on page 45 of the PDF), learners use a map and choose various pathways to find Treasure Island.

In this activity (on page 2), one person "programs" the other like a robot to move through a space, trying to get them to avoid obstacles and reach a goal.

In this activity, learners discover that training a robot can be hard work! Learners investigate how robots complete a task by following a list of sequential instructions.

In this activity, learners make their own encrypted code to pass along secret messages using a printable cipher wheel.

Even fast computers are limited to how quickly they can solve problems. One way to speed things up is to use several computers at once.