Consider a sequence of n trees { T0, T1, T2, T3, ..., Tn }. From T0, a monkey can swing to the next adjacent tree (T1).It can also swing to other succeeding trees (T2 or T3 or ...) provided that the trees in the middle are shorter than both T0 and the target tree.
-
Notifications
You must be signed in to change notification settings - Fork 0
etnk125/Swinging-Monkey-Puzzle
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Solving swinging monkey puzzle with Java
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published