Advertisement
authorblues

Optimal Mario's Time Machine Route?

Dec 17th, 2017
237
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
Python 0.93 KB | None | 0 0
  1. # solution doesn't take into account moving the cursor from one
  2. # selection to another, nor does it account for where the cursor
  3. # is left after making changes in the previous move. also ignores
  4. # the walking time between the items and from the last item to
  5. # the door to the next floor.
  6.  
  7. # --- FLOOR 1
  8. music @ position 4 (Vienna, 1824 AD)
  9. declaration @ position 5 (Philadelphia, 1776 AD)
  10. apple @ position 1 (Cambridge, 1687 AD)
  11. papers @ position 3 (Florence, 1505 AD)
  12. shield @ position 2 (Orleans, 1429 AD)
  13. # --- FLOOR 2
  14. crown @ position 4 (London, 1595 AD)
  15. block @ position 2 (Gobi Desert, 1292 AD)
  16. book @ position 3 (Athens, 0369 BC)
  17. filament @ position 1 (Menlo Park, 1879 AD)
  18. flag @ position 5 (Calcutta, 1947 AD)
  19. # --- FLOOR 3
  20. staff @ position 5 (Alexandria, 0047 BC)
  21. printer @ position 1 (Mainz, 1455 AD)
  22. globe @ position 2 (The Pacific, 1521 AD)
  23. chisel @ position 3 (Florence, 1503 AD)
  24. skull @ position 4 (Stratford, 1601 AD)
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement