Watch the algorithm run line by line — in Python or C++ — with the board updating at every step.
Every valid arrangement drawn as a board. Move the slider to explore how the count grows.
Each node is a call to solve(row). Green = success path, Red = backtracked branch.