Some Notes on Chess Endgames Guy Haworth Reading, Berkshire, UK.

Slides:



Advertisements
Similar presentations
METAGAMER: An Agent for Learning and Planning in General Games Barney Pell NASA Ames Research Center.
Advertisements

Pos. Crit., Position Criticality in Chess Endgames Guy Haworth and Árpád Rusz
Data Mining Classification: Alternative Techniques
Martin Boyd Christopher Hirunthanakorn
Automated Regression Modeling Descriptive vs. Predictive Regression Models Four common automated modeling procedures Forward Modeling Backward Modeling.
Analysis of Algorithms
Copyright © Allyn & Bacon (2010) Research is a Process of Inquiry Graziano and Raulin Research Methods: Chapter 2 This multimedia product and its contents.
ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2008.
A Memory Efficient Retrograde Algorithm and Its Application To Chinese Chess Endgames  Reference : MSRI Publications Volume 42, 2002  Writer : Ren Wu.
Hoe schaakt een computer? Arnold Meijster. Why study games? Fun Historically major subject in AI Interesting subject of study because they are hard Games.
Games CPSC 386 Artificial Intelligence Ellen Walker Hiram College.
Algorithms & Computer Chess A presentation by Zachary Fiskin Christopher Cruzen.
Chess AI’s, How do they work? Math Club 10/03/2011.
Objectives AND logic OR logic Evaluating compound conditions with multiple logical operators Precedence when combining AND and OR operators Efficiency.
Department of Mathematical Sciences The University of Texas at El Paso 1 Program Assessment Presentation May 15, 2009 Joe Guthrie Helmut Knaust.
Mahgul Gulzai Moomal Umer Rabail Hafeez
Mining Association Rules. Association rules Association rules… –… can predict any attribute and combinations of attributes … are not intended to be used.
1 Maximal Independent Set. 2 Independent Set (IS): In a graph, any set of nodes that are not adjacent.
Domineering Solving Large Combinatorial Search Spaces.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Shallow Blue Project 2 Due date: April 5 th. Introduction Second in series of three projects This project focuses on getting AI opponent Subsequent project.
MAE 552 – Heuristic Optimization Lecture 28 April 5, 2002 Topic:Chess Programs Utilizing Tree Searches.
How computers play games with you CS161, Spring ‘03 Nathan Sturtevant.
ICS-271:Notes 6: 1 Notes 6: Game-Playing ICS 271 Fall 2006.
Complexity of Mechanism Design Vincent Conitzer and Tuomas Sandholm Carnegie Mellon University Computer Science Department.
1 Solving Ponnuki-Go on Small Board Paper: Solving Ponnuki-Go on small board Authors: Erik van der Werf, Jos Uiterwijk, Jaap van den Herik Presented by:
Adversarial Search: Game Playing Reading: Chess paper.
Strategic Behavior in Multi-Winner Elections A follow-up on previous work by Ariel Procaccia, Aviv Zohar and Jeffrey S. Rosenschein Reshef Meir The School.
Near-Duplicate Detection by Instance-level Constrained Clustering Hui Yang, Jamie Callan Language Technologies Institute School of Computer Science Carnegie.
Factors Affecting Diminishing Returns for Searching Deeper Matej Guid and Ivan Bratko CGW 2007.
1 Software Testing Techniques CIS 375 Bruce R. Maxim UM-Dearborn.
Games, Hats, and Codes Mira Bernstein Wellesley College SUMS 2005.
Game Playing State-of-the-Art  Checkers: Chinook ended 40-year-reign of human world champion Marion Tinsley in Used an endgame database defining.
AdaBoost Robert E. Schapire (Princeton University) Yoav Freund (University of California at San Diego) Presented by Zhi-Hua Zhou (Nanjing University)
Hex Combinatorial Search in Game Strategy by Brandon Risberg May 2006Menlo School.
Game Trees: MiniMax strategy, Tree Evaluation, Pruning, Utility evaluation Adapted from slides of Yoonsuck Choe.
Game Trees and Heuristics : Fundamental Data Structures and Algorithms Margaret Reid-Miller 7 April 2005.
Lecture 5 Note: Some slides and/or pictures are adapted from Lecture slides / Books of Dr Zafar Alvi. Text Book - Aritificial Intelligence Illuminated.
Programming Logic and Design Fourth Edition, Introductory
Programming Logic and Design Sixth Edition
#2. UIL Chess Puzzle Practice Material This year’s UIL Chess Puzzle Test includes “solve the mate” positions similar to last year’s, but it also tests.
Avoiding Segmentation in Multi-digit Numeral String Recognition by Combining Single and Two-digit Classifiers Trained without Negative Examples Dan Ciresan.
Mark Dunlop, Computer and Information Sciences, Strathclyde University 1 Algorithms & Complexity 5 Games Mark D Dunlop.
Interactive Health Indicators Tool (i-hit): Building on the Proof of Concept Knowledge & Intelligence Team (North West)
Games. Adversaries Consider the process of reasoning when an adversary is trying to defeat our efforts In game playing situations one searches down the.
W 2 L 1 sh 1 C lessons LessonSubjectBook Week 1 lesson 1Objects, names Week 1 lesson 2Statements, layout Week 2 lesson 1Functions, decomposition Week 2.
Exploiting Context Analysis for Combining Multiple Entity Resolution Systems -Ramu Bandaru Zhaoqi Chen Dmitri V.kalashnikov Sharad Mehrotra.
Bab 5 Classification: Alternative Techniques Part 1 Rule-Based Classifer.
Stefan Mutter, Mark Hall, Eibe Frank University of Freiburg, Germany University of Waikato, New Zealand The 17th Australian Joint Conference on Artificial.
Amazons Experiments in Computer Amazons, Martin Mueller and Theodore Tegos, 2002 Exhaustive Search in the Game Amazons Raymond Georg Snatzke, 2002 Presented.
GAME PLAYING 1. There were two reasons that games appeared to be a good domain in which to explore machine intelligence: 1.They provide a structured task.
Solving Kriegspiel endings with brute force: the case of KR vs. K Paolo Ciancarini Gian Piero Favini University of Bologna.
Game Playing Revision Mini-Max search Alpha-Beta pruning General concerns on games.
Today’s Topics Playing Deterministic (no Dice, etc) Games –Mini-max –  -  pruning –ML and games? 1997: Computer Chess Player (IBM’s Deep Blue) Beat Human.
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
Artificial Intelligence
Text Information Management ChengXiang Zhai, Tao Tao, Xuehua Shen, Hui Fang, Azadeh Shakery, Jing Jiang.
Progression in Calculations. Understanding and Using Calculations For all calculations, children need to: Understand the = sign as is the same as, as.
Luca Weibel Honors Track: Competitive Programming & Problem Solving Partisan game theory.
Understanding AI of 2 Player Games. Motivation Not much experience in AI (first AI project) and no specific interests/passion that I wanted to explore.
The Game of Hex A Domain Specific Search Technique For A Beautiful Game Stefan Kiefer.
Programming Logic and Design Fifth Edition, Comprehensive Chapter 4 Making Decisions.
DATA MINING: ASSOCIATION ANALYSIS (2) Instructor: Dr. Chun Yu School of Statistics Jiangxi University of Finance and Economics Fall 2015.
7 TECHNIQUES OF INTEGRATION. As we have seen, integration is more challenging than differentiation. –In finding the derivative of a function, it is obvious.
Conflict Resolution of Chinese Chess Endgame Knowledge Base Bo-Nian Chen, Pangfang Liu, Shun-Chin Hsu, Tsan-sheng Hsu.
CHESS “The Ultimate GAME of Challenge and Strategy”
Greedy algorithms: CSC317
Influence of Search Depth on Position Evaluation
CS Fall 2016 (Shavlik©), Lecture 11, Week 6
Data Science Algorithms: The Basic Methods
Presentation transcript:

Some Notes on Chess Endgames Guy Haworth Reading, Berkshire, UK

Chess Endgames, 2001 Current Situation Endgame Table Statistics –%-results, maximals, and mutual zugzwangs “Discarding Like Pieces” –an ‘established’ principle –statistical evidence not convincing so far Depth by the Rule –correction to previously defined algorithm –better news about the computability of DTR EGTs

The Current Situation All 3-to-5-Man DTC and DTM EGTs – EGT service c/o John Tamplin and Thomas Lincke of ETH(Zûrich) –ftp://ftp.cis.uab.edu/pub/hyatt/TB/... EGTs c/o Rob Hyatt – CDs from ChessBase Some 6-Man DTC EGTs – Some 6-Man DTM EGTs – … EGT service c/o John Tamplin –ftp://ftp.cis.uab.edu/pub/hyatt/TB/... EGTs c/o Rob Hyatt

EGT Statistics Useful for … –highlighting rare phenomena maximals, mzugs, under-promotion, draws by minority force –comparing one EGT with another ad hoc removal of unreachable positions is not in fact helpful Nalimov, Wirth, and Karrer work –reported at this workshop on their behalf –% of wins, draws and losses, wtm and btm –maxDTC and maxDTM results, wtm and btm overlap of maxDTC and maxDTM positions not computed some ‘fringe’ oddities thrown up by the DTC metric –mutual zugzwangs: ww, bw, fpz twin-sourced results on distinct positions in full agreement

“Discarding Like Pieces” guideline: 6 + -man positions can usually be evaluated by ignoring like pieces? Does this mean: –look at the statistics, or –remove the like pieces from the board and evaluate the position? full stats information exists on the 2-4 and 3-5 comparison –but theory is covering these endgames already some data available on 4-6 comparisons –statistics do not seem to support the guideline Wirth provides DTC data for 3-5-man endgames –enabling shallow wins to be discounted –what about the uncomputed ‘shallow draws’?

Depth by The Rule Depth by the Rule (DTR) = dr = the least k such that best play avoids a k-move draw claim “Constrained Optimisation….”, ICGA J v23.1 –proposed revival of DTZ EGTs –proposed use of DTC, DTM and DTZ EGTs in combination –defined the DTR metric above –defined the incorrect DTR algorithm AL1 using dz !! The ‘standard’ retrograde analysis algorithm –works for computing DTR EGTs –requires the use of the ‘phase count’ instead of dz

Endgame Challenges create more efficient codes for generating DTM EGTs –c.f. Wu/Beal, Info. Sciences, Vol. 135 (June 2001), pp create EGTs –to the DTZ and DTR metrics and/or with correct depths in plies –identifying ‘finite-depth’ draws forced by one side or the other –derived from basic EGTs, e.g., bitmap win/no_win EGTs mine EGTs for unique moves, studies, problems –various definitions of ‘unique move’ –is Walter’s KBNK “Mate in 31” wKh2Ba3Nb1/bKd4+w beatable? annotate studies (a subset of the “annotation challenge”) classify studies by theme define more sophisticated strategies based on EGTs cite instances of deep endings won over the board progress Awari, Chess (Chinese, Western, Losing, Mini), other … add value to, rather than displace, human experience