Creating a 4-in-a-row bot using Monte Carlo Tree Search, because why not.
- Java 100%
|
|
||
|---|---|---|
| src | ||
| .gitignore | ||
| LICENSE.txt | ||
| pom.xml | ||
| Readme.md | ||
4-Pascaline
What is this?
This is a stupidly made Connect-4 Bot, currently WIP.
WIP in this context means Work-In-Progress, so as of right now:
- No Actual Solver, or Bot
- The Game itself will most likely contain many bugs
- This is probably really trashy
Why use this?
Don't
There are a few reasons to not use this, including, but not limited to:
- This will be actual trash and really inperformant
- I have limited experience in writing Bots for things other than tetris and chess, which are completely different.
- Honestly, why would you need a Connect-4 Bot for anyway?
- Even my chess bots suck so much they can't beat Martin.
What Algorithms will this use
I don't really know yet
List of planned Algorithms to support:
- Monte Carlo Tree Search
- Minimax
Owned by Schimeltuer144 aka. MoldyGuy
LICENSED UNDER MIT LICENSE AS STATED IN THE LICENSE.txt