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.
-
Notifications
You must be signed in to change notification settings - Fork 0
PROJECT/GAME on chess's Knight to reach final from initial position in minimum steps USING BFS/DFS ,BACKTRACKING,GREEDY ALGORITHM
Priyansh-15/Knight-s-travel
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
PROJECT/GAME on chess's Knight to reach final from initial position in minimum steps USING BFS/DFS ,BACKTRACKING,GREEDY ALGORITHM
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published