Skip to content

Latest commit

 

History

History
3 lines (3 loc) · 475 Bytes

README.md

File metadata and controls

3 lines (3 loc) · 475 Bytes

Knight-s-travel

A project to create a game based on chess where on multiple level you want to reach final positions from the initial position with each step of your knight with a particular point and aim is to reach the destination in minimum steps this project use Backtracking,Greedy algorithm ,BFS AND DFS and give you a menu driven game to select your dificulty level and take your each steps to reach final position from initial position and keep track of your score.