Can you find a path from a number at the top of this network to the bottom which goes through each number from 1 to 9 once and once only?
Find your way through the grid starting at 2 and following these operations. What number do you end on?
Your challenge is to find the longest way through the network following this rule. You can start and finish anywhere, and with any shape, as long as you follow the correct order.
Alice and Brian are snails who live on a wall and can only travel along the cracks. Alice wants to go to see Brian. How far is the shortest route along the cracks? Is there more than one way to go?
Starting with the number 180, take away 9 again and again, joining up the dots as you go. Watch out - don't join all the dots!
Can you fit the tangram pieces into the outline of this brazier for roasting chestnuts?
Is it possible to draw a 5-pointed star without taking your pencil off the paper? Is it possible to draw a 6-pointed star in the same way without taking your pen off?
Alice's mum needs to go to each child's house just once and then back home again. How many different routes are there? Use the information to find out how long each road is on the route she took.
A toy has a regular tetrahedron, a cube and a base with triangular and square hollows. If you fit a shape into the correct hollow a bell rings. How many times does the bell ring in a complete game?
I like to walk along the cracks of the paving stones, but not the outside edge of the path itself. How many different routes can you find for me to take?
What is the date in February 2002 where the 8 digits are palindromic if the date is written in the British way?
This LOGO challenge starts by looking at 10-sided polygons then generalises the findings to any polygon, putting particular emphasis on external angles