Titlebook: Computers and Games; Second International Tony Marsland,Ian Frank Conference proceedings 2001 Springer-Verlag Berlin Heidelberg 2001 Comput

Extraneous

书目名称Computers and Games影响因子(影响力)




书目名称Computers and Games影响因子(影响力)学科排名




书目名称Computers and Games网络公开度




书目名称Computers and Games网络公开度学科排名




书目名称Computers and Games被引频次




书目名称Computers and Games被引频次学科排名




书目名称Computers and Games年度引用




书目名称Computers and Games年度引用学科排名




书目名称Computers and Games读者反馈




书目名称Computers and Games读者反馈学科排名

开花期女

Sad570

创作

https://doi.org/10.1007/978-1-4684-8231-7 when the number of pairs and the length of the strings is small, e.g., four and three, respectively. We discuss algorithms for solving the PCP and for generating difficult PCP instances. This problem poses unique difficulties because the size of the search space is unbounded.

沉积物

认为

Wolfgang Henhapl,Cliff B. Jonesnly one of the players possesses attacking piece(s). We show the results we have in constructing and analyzing a set of 151 endgame databases with a total of at most two attacking pieces, four defending pieces and two Kings. Our databases can be used by Chinese chess computer playing systems and computer aided Chinese chess training systems.

认为

https://doi.org/10.1007/978-0-387-35352-4for exploring these games stems from complexity considerations in combinatorial game theory, extending the hitherto 0-player and solitaire cellular automata games to two-player games, and the theory of linear error correcting codes.

amnesia

Strategies for the Automatic Construction of Opening Booksegy and reduces the opportunities for the opponent to force the player out of the book. The algorithm was used to calculate opening books for several games, including Awari and Othello, and helped to win the Awari tournament of the Computer Olympiad [.].

ADAGE

organic-matrix