The Chooser-Picker 7-in-a-row-game
Andr\'as Csernenszky
TL;DR
This paper proves that in the 7-in-a-row game, the Picker player has a winning strategy in the Chooser-Picker variant, supporting Beck's conjecture relating to k-in-a-row games.
Contribution
It provides a proof that the Picker player wins the 7-in-a-row game in the Chooser-Picker setting, confirming part of Beck's conjecture.
Findings
Picker wins the 7-in-a-row game in the Chooser-Picker version.
Supports Beck's conjecture for k-in-a-row games.
Shows the 8-in-a-row game is a Breaker win.
Abstract
One of the main objective of this paper is to relate Beck's conjecture for k-in-a-row games. The conjecture states that playing on the same board Picker is better off in a Chooser-Picker game than the second player in the Maker-Breaker version. It was shown that the 8-in-a-row game is a blocking draw that is a Breaker win. To give the outcome of 7-, or 6-in-a-row-games is hopeless, but these games are widely believed to be Breaker's win. If both conjectures hold, Picker must win the Chooser-Picker version of the 7-in-a-row game, and that is what we prove.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Computability, Logic, AI Algorithms · Digital Games and Media