2 papers
cs.GT2020
At Most 43 Moves, At Least 29: Optimal Strategies and Bounds for Ultimate Tic-Tac-Toe
Guillaume Bertholon, Rémi Géraud-Stewart, Axel Kugelmann +2
Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts and crosses) board game. Two players compete to win three aligned "fields", each of them being a tic-tac-to…
cs.DS2020
Approaching Optimal Duplicate Detection in a Sliding Window
Rémi Géraud-Stewart, Marius Lombard-Platet, David Naccache
Duplicate detection is the problem of identifying whether a given item has previously appeared in a (possibly infinite) stream of data, when only a limited amount of memory is avai…