Minimum Hops on Custom Chessboard
Filed under Infoedge
The question
Given a chessboard with arbitrary placement of black and white blocks, find the path with the minimum number of hops from a source to a destination block, where consecutive blocks of the same color count as a single hop.
No write-up yet. Related questions below have one.
Related Infoedge questions
Collected from public candidate posts and coding forums. Updated Nov 2026.