A strategic board game with 5x5 cells with two players and two types of moves(raid and sneak)
1. The game board is a 5x5 grid representing territories the squirrel warriors will trample. 2. Each player takes turns as in chess or tictactoe.That is, the first player takes a move, then the second player, then back to the first player and so forth. 3. Each square has a fixed point value between 1 and 99, based upon its yield of nuts. 4. The values of the squares can be changed for each game, but remain constant within a game. 5. The objective of the game for each player is to score the most points, i.e. the total point value of all his or her occupied squares. Thus, one wants to capture the squares worth the most points. 6. The game ends when all the squares are occupied, because no more moves are left. 7. On each turn, a player can make one of two moves:
The solution is written in Python and the program uses 3 algorithms(strategies) to find the next best move for a given player. The 3 strategies are: a. Greedy BFS method b. Minimax method c. Alpha-beta pruning method