How computers play chess
Kasparov versus deep blue: computer chess comes of age
Kasparov versus deep blue: computer chess comes of age
VIDA: (Visual Information Density Adjuster)
CHI '99 Extended Abstracts on Human Factors in Computing Systems
The principal continuation and the killer heuristic
ACM '77 Proceedings of the 1977 annual conference
Tuning evaluation functions by maximizing concordance
Theoretical Computer Science - Advances in computer games
Evaluation of Economy in a Zero-sum Perfect Information Game
The Computer Journal
Studying aesthetics in photographic images using a computational approach
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
IEEE Spectrum
| Hi-index | 0.00 |
Zero-sum perfect information games are those where all the moves are known to every player. Examples include chess, go and noughts and crosses. This research intended to see if aesthetics within such a domain could be formalized for machine recognition since it is often appreciated and sought after by human players. For this purpose, Western or International chess was the most suitable because there is a strong body of literature on the subject, including its aesthetic aspect. Eight principles of aesthetics were identified and formalizations derived for each to form a cumulative model of aesthetics. A computer program that incorporated the model was developed for testing purposes. Two novel experiments were then performed comparing thousands of chess compositions (where aesthetics is generally more prominent) against regular games (where it is not) and the results suggest that computers can recognize beauty in the game. Possible applications of this research include more versatile chess database search engines, better automatic chess problem composers and computational aid to judges of composition and brilliancy tournaments. In addition, the methodology applied here can be used to gauge aesthetics in similarly complex games such as go and generally to develop better game heuristics.