Your first opponent comes from your own neighborhood of history. Later rounds range further.
Playing as George Dantzig
1914–2005 · optimization — Linear programming and the simplex method
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