Skip to content

Latest commit

 

History

History
22 lines (16 loc) · 743 Bytes

README.md

File metadata and controls

22 lines (16 loc) · 743 Bytes

icfpc-ouroboros-2012

Grand Strategy

Simulate the future using several simple local strategies and return the best global move.

Local Strategies

  1. Greedy: try to move towards a spot that's nearest to all lambdas
  2. Quitter: always abort
  3. Lazy: always wait
  4. Swimmer: if in the water, get out; if not, just wait

Bots we didn't have time to implement:

  1. Driven: heads for the nearest lambda, then the lambda nearest to that lambda, etc.
  2. TrampLover (heh): heads straight for the trampoline that teleports you to the largest cluster of lambdas
  3. Beeline: heads straight for the exit
  4. NonDeterministic: moves pseudo-randomly