jrinconada / knight-moves Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

In a chessboard what is the Knight's minimum number of steps to reach a position

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
README.md		README.md
knight.py		knight.py
knight_moves_e6.png		knight_moves_e6.png
knight_moves_g1.png		knight_moves_g1.png
knight_moves_h8.png		knight_moves_h8.png

Repository files navigation

Knight Moves

A solution to the Knight's problem to find out minimum steps it will take to reach the target position.

Number of steps shown on the chess board from G1

About

In a chessboard what is the Knight's minimum number of steps to reach a position

chess algorithms knight-problem

Report repository

Releases

No releases published

Packages

No packages published

Languages

Python 100.0%