Become a Readings Member to make your shopping experience even easier. Sign in or sign up for free!

Become a Readings Member. Sign in or sign up for free!

Hello Readings Member! Go to the member centre to view your orders, change your details, or view your lists, or sign out.

Hello Readings Member! Go to the member centre or sign out.

Beautiful Mates: Applying Principles of Beauty to Computer Chess Heuristics
Paperback

Beautiful Mates: Applying Principles of Beauty to Computer Chess Heuristics

$46.99
Sign in or become a Readings Member to add this title to your wishlist.

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

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.

Read More
In Shop
Out of stock
Shipping & Delivery

$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout

MORE INFO
Format
Paperback
Publisher
Dissertation.Com. - Do Not Use
Date
1 December 1997
Pages
120
ISBN
9781581120097

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

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.

Read More
Format
Paperback
Publisher
Dissertation.Com. - Do Not Use
Date
1 December 1997
Pages
120
ISBN
9781581120097