Python code that gives the fastest path from point a to point b of a chess horse
CARLOS MAGALLANES-ARANDA’S PERSONAL PROJECTS
kchess.py is the code. its input is the start and the end. EXMPLE –
a1
d5
its output is an array with the steps to follow separated with an “ó”.
EXAMPLE – [‘a1’, ‘c2’, ‘b4’, ‘o’, ‘r’, ‘a1’, ‘c2’, ‘e3’]
and
the number of the steps
EXAMPLE – 3
GitHub