AI History Battle

Playing as Thomas Cover

1938–2012 · information — Information theory; nearest-neighbor bounds; universal portfolios

Round 1 of 10 0W – 0L

Your first opponent comes from your own neighborhood of history. Later rounds range further.

A run is 10 battles, no repeat opponents, saved in this browser. Pick a different figure · Restart this run