The materials I used were a chess set and chessboard, various positions from The Art of Planning in Chess and other chess books, Fritz 11 and ChessDiagrammer chess software, and a pencil or pen. In order to create my first algorithmic component, I analyzed various chess positions where tactical motifs, or types of tactics, were present and investigated the interactions and relationships between the pieces involved in the tactics. Geometrically defining these relationships enabled me to create a series of step-by-step methods a player can use to determine whether he can execute any tactics. For my second component, the Positional Evaluator, I studied annotated chess games and classified plans that were employed in those games under certain categories based on their purposes and goals. By examining these plans I was able to extract certain relationships between the pieces involved in the plan and other points and lines on the board. I again used these relationships to create various tests chess players can use to determine whether he should implement a certain type of plan. I tested my algorithm on many different instances from master games and in each instance a strong move was found.
I successfully created an algorithm for finding the best move in any chess position that does not require the user to have any theoretical chess background or to implement his intuition.
I concluded that there are certain spatial and functional relationships between the pieces on the chessboard that determine the positional and tactical features present in a given position. I fulfilled my goal by creating an algorithm for finding a strong move in a chess position that avoids the use of intuition.
This Mathematical project creates an understandable algorithm for finding the best move in a chess position that does not require the user to implement his intuition.
Science Fair Project done By Prem M. Talwai