Beautiful Mates: Applying Principles of Beauty to Computer Chess Heuristics

Ben P. Walls

Universal-Publishers, 1997 - Computers - 118 pages

A synopsis of eminent computer chess programs reveal that they are designed around a 'brute force' approach. An argument is made that by continuing the 'brute force' search approach, computer chess development is moving away from human evaluation methods. Research is done into studies of evaluation methods, and a discovery is made that humans use a form of intuition, called their 'sense of beauty', to choose the best chess move. A paper by Margulies is cited which formulates principles of beauty which apply to chess. Three versions of a chess program are developed, using no heuristics, standard chess heuristics, and beauty heuristics formulated from Margulies principles. The performance of the three versions of the program are compared using chess puzzles, and rated for how quickly they find the solution, and how few nodes they evaluate. Graphs are produced from the results of these tests, showing that beauty heuristics are, on average, 15% faster at finding the solution, and evaluate 10% fewer nodes.

An improvement is implemented in all versions of the program which biases the search towards better moves, resulting in the beauty heuristics success rising to an average of 25% faster to the solution, and evaluating 33% fewer nodes, than the other heuristics. It is concluded that the beauty heuristics are closer to the way that humans evaluate chess positions.

Contents

• INTRODUCTION: 5
• HOW COMPUTERS PLAY CHESS: 15
• HUMAN CHESS PLAYING METHODS: 21
• A DISCUSSION OF MARGULIES PAPER: 31
• APPLYING MARGULIES PRINCIPLES TO CHESS PUZZLES: 32
• RESULTS: 44
• FACTORS ARRISING FROM THE RESULTS: 58
• BIBLIOGRAPHY: 64
• APPENDIX B COMPUTER REPRESENTATION: 71
• APPENDIX E SUMMARY TABLES: 80
• APPENDIX G TABLES OF RESULTS: 108

Popular passages

Page 11 - That within ten years a digital computer will be the world's chess champion, unless the rules bar it from competition. 2) That within ten years a digital computer will discover and prove an important new mathematical theorem. 3...

Page 8 - ... (4) There should be a background of knowledge concerning the activity against which the learning progress can be tested. (5) The activity should be one that is familiar to a substantial body of people so that the behavior of the program can be made understandable to them. The...

Page 8 - In checkers the goal is to deprive the opponent of the possibility of moving, and the dominant criterion is the number of pieces of each color on the board. The importance of having a known criterion will be discussed later. (3) The rules of the activity must be definite and they should be known. Games satisfy this requirement. Unfortunately, many problems of economic importance do not. While in principle the determination of the rules can be a part of the learning process, this is a complication...

Bibliographic information

• Title: Beautiful Mates: Applying Principles of Beauty to Computer Chess Heuristics
• Author: Ben P. Walls
• Publisher: Universal-Publishers, 1997
• ISBN: 1581120095, 9781581120097
• Length: 118 pages
• Subjects: Computers / Artificial Intelligence / General; Games & Activities / Chess; Philosophy / Aesthetics