Proof Writing & Problem Solving · Easy problem

A $5 \times 5$ grid of rooms is coloured like a chessboard with dark corner rooms. A mouse starts in a light room and walks, each step into an edge-adjacent room, never entering a room twice. What is the largest number of rooms it can visit, counting the starting room?