Computer recognition of aesthetics in a zero-sum perfect information game
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
Advanced computer recognition of aesthetics in the game of chess
WSEAS Transactions on Computers
Increasing efficiency and quality in the automatic composition of three-move mate problems
ICEC'11 Proceedings of the 10th international conference on Entertainment Computing
| Hi-index | 0.00 |
A zero-sum perfect information game is one where every player knows all the moves. Chess is a good example where the object is to checkmate or capture the enemy king. One important feature of checkmates, especially in chess problem composition, is economy. This paper proposes a computational function to evaluate the economy of checkmate configurations on the chessboard. Several experiments were performed comparing chess compositions and regular games to validate the function. The results suggest that the proposed evaluation function is able to correctly discern economical differences in checkmate positions to a high degree of statistical significance and correlates positively with the perception of human chess players. This evaluation function can therefore be useful in increasing the versatility of chess database search engines, as a component in aesthetic models of chess and aiding judges in chess composition tournaments.