In this puzzle all Black pawns are stationary, so Black doesn't play.
What is the minimum number of moves White has to make in order to capture all Black pawns?
Credit : This puzzle is one of the levels of a minigame in the video game 'Watch Dogs'.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
It could be useful to draw a graph where each vertex is a pawn while each edge is a possible move the queen can do from the i t h position, i ∈ { 1 , . . . , 1 0 } , against the next pawn. To solve the puzzle you have to find the shortest path starting from S which pass through each vertex once. Numbers on each vertex indicate the sequence of captures, so the path itself.