Papers › SOS
SOS
Jasper Caravan, Michael Han, Andrew Kalashnikov, Tanya Khovanova, Ella Li, Alexander Meng, Vaibhav Rastogi, Gordon Redwine, Lev Strougov, Angela Zhao
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
SOS is a game similar to tic-tac-toe. We study a variety of variations of it played on a 1-by-n rectangle. On our journey we change the target string to SOO, then study all target strings containing SSS, then go back to finite strings and study SOSO. Then we create a variation with two target strings SSSS-OOOO. We continue with mis\`{e}re games. After that we look at different changes of the board: we wrap the board around, add dimension, and allow it to expand. We end with a variation that came from the ultimate tic-tac-toe.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections