A knight finding its way on a chessboard
On an $n \times n$ chessboard, the player sets up obstacles, a starting spot, and an end point. Then, the knight begins at the starting spot and has to figure out how to reach the end while maneuvering around the obstacles.