The Game Of Col On Complete K-Ary Trees
Alessandro Cincotti, Timothée Bossart · Zenodo (CERN European Organization for Nuclear Research) · 2008
Col is a classic combinatorial game played on graphs and to solve a general instance is a PSPACE-complete problem. However, winning strategies can be found for some specific graph instances. In this paper, the solution of Col on complete k-ary trees is presented.