8.1.6 Complete Chessboard

But we have 30 black and 32 white available → because we would need to cover 31 black squares but only 30 exist.

The term "8.1.6 Complete Chessboard" typically refers to in several advanced coding curricula (notably from textbooks on recursion and backtracking) where the objective is to traverse or cover every square of a standard 8x8 chessboard exactly once using a specific piece—most commonly the knight. 8.1.6 Complete Chessboard

When printing partial tours, ensure you are not modifying the global board mid-debug without backtracking. But we have 30 black and 32 white