It is sometimes very useful to take a step back and but the computers to one side and think about teaching computing unplugged (and there are some great resources out there).
One of my favourite activities at the moment is from TEACHING LONDON COMPUTING which has a Tour Guide Activity where students need to plan a trip around a city, starting and finishing at one location and visiting every other location once! This is an example of creating an algorithm that is a simple sequence of instructions to do in order and also allows students to check an algorithm and see it definitely works by following it step by step on paper. This activity leads on to the Knight’s Tour Activity which looks much more difficult, where a Knight on a small and modified chessboard, has to start and stop on the same square and also visit every other square on the board. The solution to this puzzle amazed my students and taught them a valuable lesson about computational thinking.
For an overview on how this type of puzzle can really enhance students thinking, take a look at A Brief Tour of Computational Thinking: The Knight’s Tour and Other Puzzles by Paul Curzon from Queen Mary University of London.