ai working and winning, added move rank heuristic
This commit is contained in:
parent
05536f0dc3
commit
92a11f0898
5 changed files with 169 additions and 31 deletions
15
README.md
15
README.md
|
|
@ -1,13 +1,11 @@
|
|||
# Othello
|
||||
|
||||
## Project Structure
|
||||
## Running
|
||||
|
||||
```
|
||||
├── iagorithms <-- contains expert system AI library
|
||||
│ └── ...
|
||||
├── othello <-- contains main binary and library for Othello
|
||||
│ └── ...
|
||||
└── README.md <-- you are here
|
||||
I recommend using the release profile for the compiler optimizations. These are
|
||||
quite important since our algorithms involve evaluating millions of moves.
|
||||
```sh
|
||||
cargo run --release
|
||||
```
|
||||
|
||||
## Game Representation
|
||||
|
|
@ -15,6 +13,3 @@
|
|||
The game state is represented by what's known as a
|
||||
[BitBoard](https://www.chessprogramming.org/Bitboards). I knew about these
|
||||
already from researching Chess programming in the past.
|
||||
|
||||
This does mean that when calling upon iagorithms' it will need to _explode_
|
||||
the bitboard into a format that can be pattern matched on.
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue