R2-D2 can move on an 8 by 8 grid only to a neighbouring cell sharing a side. Can it start in the bottom-left corner, finish in the top-right corner, and visit every cell exactly once?
Can such a path be built on this grid?
Sign in or create an account to reveal answers, view the solution, and save your progress. Create a free account to unlock practice and keep track of your work.
One puzzle per day. Cryptarithm, Magic Square, Summit. No sign-up required to play.
Play daily puzzle →Interactive problems and curated lessons—water pouring, magic squares, knight's tour, and more.
Browse library →See how you rank. Top solvers by problems solved correctly. Sign in to climb the ranks.
View leaderboard →