https://github.com/ivzeng/antichess_cpp

CO456 final project, an antichess bot that defeats everyone!
https://github.com/ivzeng/antichess_cpp

Last synced: 7 days ago
JSON representation

CO456 final project, an antichess bot that defeats everyone!

• Host: GitHub
• URL: https://github.com/ivzeng/antichess_cpp
• Owner: ivzeng
• Created: 2022-11-16T17:24:25.000Z (about 2 years ago)
• Default Branch: master
• Last Pushed: 2022-12-21T03:57:33.000Z (about 2 years ago)
• Last Synced: 2023-10-01T00:21:37.289Z (over 1 year ago)
• Language: C++
• Size: 4.22 MB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        

## Start the program:

Go to the root directory /Antichess_cpp,

complie,

```

MakeFile

```

excecute,

```

./Antichess/Antichess human computer

or

./Antichess/Antichess h c

or

./Antichess/Antichess compu co

or

./Antichess/Antichess cat cat

or 

./Antichess/Antichess black    

(bot be the black player)

or

./Antichess/Antichess white

(bot be the white player)

```

## Input/Output

IO are handled by IO.h and IO.cpp. All instructions and messages except the comptured move are expected to be printed on stderr, and the move computed by the smartMove function will be output on stdin.

(Define PLAY on IO.h to get a better command handle and enable functionalities such as undoing a round.)

---

## Basic process:

The program will

1. check if the argument is valid,

2. construct the Game and Players; intialize (putting Pieces to) and print the game.

3. start the game loop where 

each player will take a turn at each round. Specifically, the game will set up a board and search for all valid moves for the player who takes turn, then the player's ```getDecision()``` will be call to get a decision and the game class will read the redcision and preform. If the decision is a charactor from '1' to '9', then the game's ```smartMove()``` will run to simulate a few round and find a (at least) good move.

4. If one player has no more valid move, end the game.

---

## More details

### Classes

- Game: the main class that handles the rounds and game analysis; contains players and a history of moves; provides functions including do/undo round, move-searching, obtaining the board, and print game status

- Player: the class that owns the piece; provides functions on collecting move and sending the decision to the game class

- Piece: the derived peice class; records the position and status of a peice; provides instructions on move-scanning and value of the peice

- Board: the class that provides an intuitive view of the game; provide helper functions for scannig and visualizing the game

- Move: the derived class of each move; includes the functions for processing a move.

### Move-searching algorithm

In our design, we used the most intuitive strategic: DFS and backtracking.

Specifically, there is a recursive function ```Game::getPositionScoreAtDepth(moves, ...)``` that computes the expected outcome of every possible moves in move, and a wapper function ```findBestMoveWrapper(moves)``` that returns the decision (the move that has the highest outcome).

The number of rounds to be simulated depends on the number of available moves, so the time it take to compute each time is similar. The expected number of operations is around 105, and the expected time taken is around 8 seconds.

---