Chess Endgame Knowledge Advances
نویسنده
چکیده
It is advisable to refer to the publisher's version if you intend to cite from the work. All outputs in CentAUR are protected by Intellectual Property Rights law, including copyright law. Copyright and IPR is retained by the creators or other copyright holders. Terms and conditions for use of this material are defined in the End User Agreement .
منابع مشابه
Conflict Resolution of Chinese Chess Endgame Knowledge Base
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 o...
متن کامل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 ...
متن کامل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...
متن کاملBuilding Chess Endgame Databases for Positions with many Pieces using A-priori Information
This note describes a possible solution to some endgames in chess with many pieces, when a complete retrograde database construction will fail because of the size of the problem and the time needed to build it up. The note shows how human knowledge, position-specific limitations and existing databases can be combined to prove a position to be won, drawn or lost, and providing the game theoretic...
متن کاملLearning Patterns for Playing Strategies
A rst order system, PAL, that can learn Chess patterns in the form of Horn clauses from simple example descriptions and general purpose knowledge about Chess is described. This is the rst time that Chess patterns which can be used for over-the-board play have been learned. To test if the patterns learned by PAL can be used to play, a simple playing strategy for the King and Rook against King (K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ICGA Journal
دوره 33 شماره
صفحات -
تاریخ انتشار 2010