Creating a 4-in-a-row bot using Monte Carlo Tree Search, because why not.
Find a file
2026-04-16 16:41:41 +02:00
src minor changes 2026-04-16 16:39:31 +02:00
.gitignore Fixed Bug 2026-03-24 16:25:37 +01:00
LICENSE.txt Added Readme.md and added LICENSE.txt 2026-03-19 16:37:58 +01:00
pom.xml Finished the basics of the Connect-4 Game. Slopped some tests. TODO for next version: Add Readme.md, maybe start aalgorithm 2026-03-19 16:09:17 +01:00
Readme.md Added Basic MiniMax Engine 2026-03-24 11:42:49 +01:00

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