Chess Knight Problem: A Quick & Dirty JS Solution

A walkthrough of solving the chess knight minimum-moves problem in JavaScript using a BFS-like approach. Starting from a given square, the algorithm labels reachable squares by move count, expanding outward until the destination is filled. The implementation uses a 2D array board, helper functions to add valid moves, and a do-while loop that iterates until the target square is reached. Full code and a CodePen demo are included.