Proof Writing & Problem Solving · Superchallenge problem

A token is placed on one cell of a $5 \times 5$ board, and that cell counts as visited. Two players take turns, the first player moving first: a move slides the token to an edge-adjacent cell that has not been visited yet (it then becomes visited). A player who cannot move loses. For how many of the $25$ starting cells can the SECOND player force a win?