Title :
Research on connect 6 programming based on MTD(F) and Deeper-Always Transposition Table
Author :
Ruimei Zhang ; Changcheng Liu ; Chuandui Wang
Author_Institution :
Sch. of Elecronic & Inf. Eng., Anhui Univ. Of Archit., Hefei, China
fDate :
Oct. 30 2012-Nov. 1 2012
Abstract :
Chess computer game has always been the hot research topic in the field of artificial intelligence. Connect 6 as an emerging types of chess, has some characteristics such as simple rules, complex changes and fair play. Search engine is the core part on computer game programming. This paper introduces some of the traditional search algorithm in chess computer game, and introduced emphatically a search algorithm based on the MTD(F) and Deeper-Always Transposition Table. Then take Connect 6 as an example, experiments prove its efficiency is higher than alpha-beta pruning algorithm.
Keywords :
computer games; programming; search engines; search problems; MTD(F); alpha-beta pruning algorithm; artificial intelligence; chess computer game; computer game programming; connect 6 programming; deeper-always transposition table; search algorithm; search engine; Algorithm design and analysis; Computers; Games; Programming; Real-time systems; Search engines; Search problems; Computer game; Connect 6; MTD(F) deeper-always transposition table; Search engine;
Conference_Titel :
Cloud Computing and Intelligent Systems (CCIS), 2012 IEEE 2nd International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4673-1855-6
DOI :
10.1109/CCIS.2012.6664397
