Your first opponent comes from your own neighborhood of history. Later rounds range further.
Playing as Edsger Dijkstra
1930–2002 · theory — Shortest paths; structured programming; semaphores
Round 1 of 10
0W – 0L
A run is 10 battles, no repeat opponents, saved in this browser. Pick a different figure · Restart this run