Conflict Resolution of Chinese Chess Endgame Knowledge Base

نویسندگان

  • Bo-Nian Chen
  • Pangfeng Liu
  • Shun-chin Hsu
  • Tsan-sheng Hsu
چکیده

Endgame heuristics are often incorperated as part of the evaluation function used in Chinese chess programs. In our program, Contemplation, we have proposed an automatic strategy to construct a large set of endgame heuristics. In this paper, we propose a conflict resolution strategy to eliminate the conflicts among the constructed heuristic database, which is called endgame knowledge base. In our experiment, the correctness of the obtained constructed endgame knowledge base is high enough for practical usage.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

UMRAO: A Chess Endgame Tutor

Most research in computer chess has focussed on creating an excellent chess player, with relatively little concern given to modelling how humans play chess. The research reported in this paper is aimed at investigating knowledge-based chess in the context of building a prototype chess tutor, UMRAO, which helps students learn how to play bishop-pawn endgames. In tutoring it is essential to take ...

متن کامل

Chinese Dark Chess

Chinese dark chess is a popular and easy-to-learn game in Asia. The characteristic of possible revealing of unknown pieces makes it different from Chinese chess or Western chess. Players with luck may win a game by chance. Thus, there is a probabilistic behavior that a player has to consider. Computer Chinese dark chess problems can be divided into three phases: 1) the opening game, 2) the midd...

متن کامل

From Chinese Room to Human Window

The debate in philosophy and cognitive science about the Chinese Room Argument has focused on whether it shows that machines can have minds. We present a quantitative argument which shows that Searle’s thought experiment is not relevant to Turing’s Test for intelligence. Instead, we consider a narrower form of Turing’s Test, one that is restricted to the playing of a chess endgame, in which the...

متن کامل

Deriving Concepts and Strategies from Chess Tablebases

Complete tablebases, indicating best moves for every position, exist for chess endgames. There is no doubt that tablebases contain a wealth of knowledge, however, mining for this knowledge, manually or automatically, proved as extremely difficult. Recently, we developed an approach that combines specialized minimax search with argumentbased machine learning (ABML) paradigm. In this paper, we pu...

متن کامل

Material Symmetry to Partition Endgame Tables

Many games display some kind of material symmetry. That is, some sets of game elements can be exchanged for another set of game elements, so that the resulting position will be equivalent to the original one, no matter how the elements were arranged on the board. Material symmetry is routinely used in card game engines when they normalize their internal representation of the cards. Other games ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009