Beautiful Mates : Applying Principles of Beauty to Computer Chess Heuristics

by
Format: Paperback
Pub. Date: 1997-12-01
Publisher(s): Lightning Source Inc
  • Free Shipping Icon

    Free Shipping on all Orders Over $35!*

    *excludes Marketplace items.

List Price: $26.60

Buy New

Usually Ships in 2-3 Business Days
$26.47

Rent Textbook

Select for Price
There was a problem. Please try again later.

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

This item is being sold by an Individual Seller and will not ship from the Online Bookstore's warehouse. The Seller must confirm the order within two business days. If the Seller refuses to sell or fails to confirm within this time frame, then the order is cancelled.

Please be sure to read the Description offered by the Seller.

Table of Contents

Introductionp. 5
Why Games and Why Chess?p. 7
Game Characteristicsp. 7
The Suitability of Chessp. 7
Checkersp. 8
Gop. 8
Chosen Gamep. 9
A Brief History of Computer Chessp. 10
Machackp. 10
Chess 3.0p. 11
Cray Blitzp. 12
Bellep. 12
Hitechp. 13
The 'Deep' Rangep. 13
How Computers Play Chessp. 15
Machine Representation of the Chess Boardp. 15
The Move Generatorp. 15
Evaluationp. 16
Piece Ratio Exchangep. 17
Searchp. 17
Pruning the Searchp. 18
Horizon effectp. 18
Techniques for Improving searchp. 18
Opening Booksp. 19
Endgame databasep. 19
Killer Movesp. 19
Transposition Tablesp. 20
Human Chess Playing Methodsp. 21
Perceptionp. 21
Chunksp. 22
Contrasting Human and Computer Methodsp. 23
Principles of Beautyp. 25
Successfully Violate Heuristicsp. 25
Use the Weakest Possible Piecep. 26
Use All of the Piece's Powerp. 26
Give More Aesthetic Weight to the Critical Piecesp. 27
Use One Giant Piece in Place of Several Minor Piecesp. 28
Employ Themesp. 28
Avoid Bland Stereotopyp. 29
Neither Strangeness nor difficulty produce beautyp. 30
A Discussion of Margulies' Paperp. 31
Applying Margulies Principles to Chess Puzzlesp. 32
Accepted Principlesp. 32
Rejected Principlesp. 33
All Piecesp. 34
Implementing Heuristics in Chessp. 35
Standard Heuristicsp. 35
Beauty Heuristicsp. 36
The Programp. 37
Object Orientated Designp. 37
Output datap. 38
Favoured Moves and the '[lambda]' Parameterp. 39
Improved Results from 'Favoured Moves'p. 40
Testingp. 40
Complexity in Mating Problemsp. 41
Source of Test Datap. 41
Method of Testingp. 42
Standard Deviationp. 43
Resultsp. 44
Results for twenty two puzzliesp. 45
Chosen Problemsp. 47
Mate in 2 problemsp. 48
Mate in 3 problemsp. 49
Two extra Mate in 4 and 5 problemsp. 50
Results for Twenty two problems (with 'Favoured Moves')p. 52
Chosen Problems (with 'Favoured Moves')p. 54
Mate in 2 problems (with 'Favoured Moves')p. 55
Mate in 3 problems (with 'Favoured Moves')p. 56
Two extra Mate in 4 and 5 problems (with 'Favoured Moves')p. 57
Factors Arrising From the Resultsp. 58
Complexityp. 58
Performance of Individual Heuristicsp. 60
Aggressionp. 61
Conclusionp. 62
Bibliographyp. 64
The Chess Boardp. 69
Computer Representationp. 71
Heuristicsp. 73
Sample Text Outputp. 76
Summary Tablesp. 80
All the Puzzles in Detailp. 83
Tables of Resultsp. 108
Table of Contents provided by Syndetics. All Rights Reserved.

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.