Titlebook: Computers and Games; 7th International Co H. Jaap Herik,Hiroyuki Iida,Aske Plaat Conference proceedings 2011 The Editor(s) (if applicable)

嚴(yán)厲批評(píng)

Consultation Algorithm for Computer Shogi: Move Decisions by Majority,ividual players. A method that can create multiple players from one program is presented. Applying a simple rule to select a decision on a single move, the consultation algorithm improves the performance of computer Shogi engines. It is also demonstrated that a council system consisting of three wel

線

Optimistic Selection Rule Better Than Majority Voting System, where each player uses a different series of pseudo-random numbers. A combination of multiple players under the majority voting system would improve the performance of a Shogi-playing computer. We present a new strategy of move selection based on the search values of a number of players. The move d

achlorhydria

Knowledge Abstraction in Chinese Chess Endgame Databases,o the main memory of a computer during tournaments. In this paper, a novel knowledge abstraction strategy is proposed to compress endgame databases. The goal is to obtain succinct knowledge for practical endgames. A specialized goal-oriented search method is described and applied on the important en

INCUR

aerobic

A Markovian Process Modeling for Pickomino, has to make the best decisions first to choose the dice to keep, then to choose between continuing or stopping depending on the previous rolls and on the available resources. Markov Decision Processes (MDPs) offer the formal framework to model this game. The two main problems are first to determine

Vertebra

Fibroid

DEAWL

TAIN

2否定

https://doi.org/10.1007/978-3-7908-1932-8the proof and disproof number of a leaf node with the help of a heuristic evaluation function. Experiments in LOA and Surakarta show that compared to PN and PN., which use mobility to initialize the proof and disproof numbers, EF-PN and EF-PN. take between 45% to 85% less time for solving positions.