This project deals with designing algorithms that can be employed to calculate possible sequences of dice rolls for three cases. case 1 : shortest number of steps to reach the last cell. case 2 : reaching the last cell, by avoiding all Chutes. case 3 : reachong the last cell, by avoiding all Chutes and Ladders.
-
Notifications
You must be signed in to change notification settings - Fork 0
TarunRaoK98/Chutes-And-Ladders
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published