1. Chess and AI Group Members Abhishek Sugandhi 04305016 Sanjeet Khaitan 04305018 Gautam Solanki 04305027

2. What We Need Some way to represent a chess board in memory. A technique to choose the move to make amongst all legal possibilities. A way to compare moves and positions, so that it makes intelligent choices.

3. Board Representation: Memory was at much more of a premium several decades ago than it is today. So early chess programs laid a strong foundation for efficient and compact data structures. The most obvious board representation is a 64 byte array, with one byte representing one of the 64 squares on the board.

4. Bit Boards: An enhancement to board representation that is still prevalent today is the bit board. This is a 64 bit word that holds a binary value for each square This is a 64 bit word that holds a binary value for each square Greatly reduces computation time for the program. For example KnightMoves[c2] can be represented as 00000000 00000000 01010000 01010000 10001000 10001000 00000000 00000000 10001000 10001000

5. BitBoards contd. Simialrly WhitePieces can be 00000000 00000000 01010000 01010000 10001101 10001101 00000000 00000000 00001100 00001100 This gives all the positions where there are white pieces on the board. So an AND operation of KightMoves[c2] and NOT of Whitepieces will give us all the White Knight moves from c2.

6. Searching: The most basic search algorithm is minimax. This can be enhanced by alpha beta pruning, especially when combined with iterative deepening.

7. Minimax Computer selects move with maximum benefit and assumes that the opponent will take move with minimum loss Computer selects move with maximum benefit and assumes that the opponent will take move with minimum loss

8. Alpha-Beta Pruning The problem with minimax is that we expand every node down to a certain depth even though, in certain cases we are wasting our time. To combat this a procedures known as alpha/beta (it is called this for historical reasons) pruning has been developed.

9. Iterative Deepening In many occasion there is a time limit in which the computer should decide a the move. The idea behind iterative deepening is : begin by searching all moves arising from the position to depth 2, search again to depth 3, and then depth 4 and so on, until you have reached the appropriate depth or the time limit is over. Even if the time limit is over before the appropriate depth is reached we still have some good estimate of a move.

10. Transposition Table This is equivalent to a hash table that holds board positions that have already been analyzed in the past to save the work already done by the engine. An “opening book”, which is a database of solid opening moves, is almost always included in the transposition table. The transposition table also helps out a lot in the end game, where with most pieces off the board, the move tree will generate many identical positions through different move lists. While nearly every modern chess program has a transposition table, the one disadvantage is that it takes up a huge amount of memory. Despite this, the transposition table shows how a little pre- processing can simplify computations during the actual game. Despite this, the transposition table shows how a little pre- processing can simplify computations during the actual game.

11. Horizon Effect: A problem with these simple algorithms is that the chess program can only scan to a certain depth. For example, if capturing the opponent’s queen on ply 7 results in getting checkmated on ply 8, and the program only searches 7 plies deep, it will think the queen capture is a great move. This is known as the “horizon effect”.

12. Quiescence Search: This can be used to avoid Horizon effect. The whole search process is cotinued until a “quiet position” is reached. The whole search process is cotinued until a “quiet position” is reached. A “quiet position” is a position where the computer is not captured by any piece of the opponent by any further move.

13. Aspirated Search: This is used to reduce the search time by cutting off more nodes. In Alpha-Beta Pruning we take -INFINITY and +INFINITY as initial value of Alpha and Beta resp. The idea behind Aspirated Search is to reduce the window size of -INFINITY to +INFINITY, to a smaller window. This technique can be effectively used with Iterative Deepening. Once we have searched for 2-ply, we get an approximate value for the result of 3ply search. Let the result is A. so when initiating 3 ply search we can give alpha and beta values as A- Constant and A+Constant resp. This will reduce the search time.

14. Singular Extensions: Another way to combat the horizon effect and also improve accuracy is to add another several ply when a particularly promising move is discovered during search. This can quickly determine whether the move’s high valuation is legitimate. Searching through extra plies like this can be an expensive operation and was one of the main features of IBM’s Deep Blue.

15. Position Evaluation Static evaluation of a board position depends on several factors. The most important is Material Balance (Pieces on chess- board). Mobility is another factor on which Position Evaluation depends Board-Control is another measurable feature of a position

16. Position Evaluation (Continued): ● Material balance is an account of which pieces are on the board for each side. ● According to chess literature, a queen may be worth 900 points, a rook 500, a bishop 325, a knight 300 and a pawn 100; the king has infinite value. ● Computing material balance is therefore a simple matter: a side's material value is equal to MB = Sum( Np * Vp ) Np is the number of pieces of a certain type on the board Vp is that piece's value. ● If you have more material on the board than your opponent, you are in good shape.

17. Mobility It can be defined by the number of legal moves a player has. It can be defined by the number of legal moves a player has. A player having more mobility is considered to be in better shape.

18. Board Control Board-Control is another measurable feature of a position. It can be defined by whether or not the king is protected (i.e. by castling) It can be defined by whether or not the king is protected (i.e. by castling) how many rooks are on open files how many central squares on the board are being occupied and attacked. Doubled and tripled pawns (two or three pawns in the same file via a capture) are known to be weak positions Isolated pawns (a pawn which doesn’t have another pawn in either of it’s bordering files) also denote weak positions.

19. Linear Evaluation Functions A linear function of f1, f2, f3 is a weighted sum of f1, f2, f3.... A linear evaluation function is = w1.f1 + w2.f2 + w3.f3 +..... wn.fn where f1, f2, f3, are the features like board control, mobility etc. and w1, w2, w3, are the weights Idea: – more important features get more weight The quality of play will depend directly on the quality of the evaluation function to build an evaluation function we have to – 1. construct good features (using expert knowledge, heuristics) – 2. pick good weights (can be learned)

20. Conclusion Chess and game tree AI have come a long way since when they first began. The best evidence of is that the greatest chess player in the world, Garry Kasparov, was defeated by a machine that used principles based primarily upon many of the topics discussed in previous slides. As computer architecture improves coupled with stronger, more efficient evolving algorithms, we can only expect this classical type of brute force, heuristic AI to become even stronger.

21. References http://www.chessbrain.net/beowulf/theory.html http://www.chessbrain.net/beowulf/theory.html http://www.xs4all.nl/~verhelst/chess/search.html http://www.xs4all.nl/~verhelst/chess/search.html http://www.maths.nott.ac.uk/personal/anw/G13GT1/compch.html http://www.maths.nott.ac.uk/personal/anw/G13GT1/compch.html http://www.gamedev.net/reference/articles/ http://www.gamedev.net/reference/articles/

22. Project Proposal We will create a One Player Chess Program using Iterative deepening Technique.