https://sunmaximus.github.io//chess_knight_bfs_movement/
This is an implementation of finding knight shortest route from point A to point B using Breadth First Search (BFS).
The backend is in Python3 using Flask to communicate through REST to activate BFS algorithm. Follow the instructions down below and make sure Flask server run first.
Python3 only
$ pip3 install -r requirements.txt
$ export FLASK_APP=server.py
$ export FLASK_ENV=development
$ flask runThe Client App is written in ReactJS library.
$ npm i
$ npm run start
