Indexed metadata
PArcK trees can get as hot as you want
Svenja Huntemann, Neil A. McKay, Craig Tennenhouse
Source abstract
We consider the combinatorial game Partizan Arc Kayles as a generalization of Domineering. An extensive technical search using genetic algorithms found hot positions of temperature exceeding 2. We discuss this search and construct a family of positions with high temperature that includes these graphs and prove that Partizan Arc Kayles has unbounded temperature. We identify an infinite family of second-player win positions as part of our main construction.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.