DocumentCode
3541865
Title
Switch-side chain-chess
Author
Iqbal, Azlan
Author_Institution
Coll. of Inf. Technol., Univ. Tenaga Nasional, Kajang, Malaysia
fYear
2013
fDate
July 30 2013-Aug. 1 2013
Firstpage
182
Lastpage
187
Abstract
We explain the details and implications of a new chess variant that is more challenging for humans than the standard version of the game. A new rule states that either player has the right to switch sides if a `chain´ or link of pieces is created on the board. This appears to increase significantly the complexity of chess, as perceived by the players, but not the actual size of its game tree. `Search´ therefore is less of an issue in computational approaches to playing it. The advantage of this variant is that it allows research into board games to focus on the `higher level´ aspects of intelligence by building upon the approaches used in existing, `mature´ chess engines. We argue that this new variant can therefore more easily contribute to gaming intelligence than other games of high complexity such as Go and Arimaa.
Keywords
computational complexity; computer games; trees (mathematics); Arimaa; Go; board games; chess complexity; chess variant; computational approaches; game tree; mature chess engines; switch-side chain-chess; Artificial intelligence; Complexity theory; Computers; Engines; Games; Standards; Switches;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Games: AI, Animation, Mobile, Interactive Multimedia, Educational & Serious Games (CGAMES), 2013 18th International Conference on
Conference_Location
Louisville, KY
Print_ISBN
978-1-4799-0818-9
Type
conf
DOI
10.1109/CGames.2013.6632630
Filename
6632630
Link To Document