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影響因子(影響力)學(xué)科排名




書目名稱Computers and Games網(wǎng)絡(luò)公開度




書目名稱Computers and Games網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computers and Games被引頻次




書目名稱Computers and Games被引頻次學(xué)科排名




書目名稱Computers and Games年度引用




書目名稱Computers and Games年度引用學(xué)科排名




書目名稱Computers and Games讀者反饋




書目名稱Computers and Games讀者反饋學(xué)科排名

開花期女

Sad570

創(chuàng)作

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.

沉積物

認(rèn)為

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.

認(rèn)為

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