Abstract
Clobber is an abstract, two-player, strategy game invented in 2001 by the combinatorial game theorists Michael H. Albert, J. P. Grossman and Richard Nowakowski. In 2005 and 2006 it was one of the events in the Computer Olympiad. Despite a very simple rule set, not only is Clobber a hard game from the perspective of the theory of combinatorial games, but also in its computer implementation. This article provides a detailed exposition of four heuristic algorithms for playing the game. These algorithms were used in programs which took four leading places in a computer Clobber tournament at Silesian University.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
