Question 4
The diagram shows a $ 6 \times 8 $ chessboard with squares painted in black and white in an unusual pattern. Starting from the top left corner, a marker must move between squares which have opposite colours and share a common border. What is the minimum number of black squares it must visit in order to arrive at the top right corner, counting it as one of the black squares visited?
