Your first opponent comes from your own neighborhood of history. Later rounds range further.
Playing as Dimitri Bertsekas
b. 1942 · optimization — Dynamic programming and optimal control; neuro-dynamic programming; the optimization texts
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