Title :
Notice of Retraction
On the complexity of n-player Cherries
Author_Institution :
Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan
Abstract :
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
Why are n-player games much more complex than two-player games? Is it much more difficult to cooperate or to compete? n-player Cherries is the n-player version of Cherries, a two-player combinatorial game. Because of queer games, i.e., games where no player has a winning strategy, cooperation is a key-factor in n-player games and, as a consequence, n-player Cherries played on a set of rows is PSPACE-complete.
Keywords :
combinatorial mathematics; computational complexity; game theory; -player Cherries; PSPACE-complete; combinatorial game; n-player games; queer game; winning strategy; Computers; Educational institutions; combinatorial games; computational complexity;
Conference_Titel :
Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-5537-9
DOI :
10.1109/ICCSIT.2010.5565058
