Minimum steps to reach target by a Knight & the Probability of Knight to remain in the chessboard using Dynamic programming
-
Notifications
You must be signed in to change notification settings - Fork 0
karthik1124/Knight_problem_using_dynamic_programming
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Minimum steps to reach target by a Knight & the Probability of Knight to remain in the chessboard using Dynamic programming
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published