Skip to content

Minimax search algorithm and AIs competing against each other in Breakthrough

Notifications You must be signed in to change notification settings

anaverul/Breakthrough

Repository files navigation

Breakthrough: Part 1

Implementation of some initial functions needed for AIs competing in a game of Breakthrough.

Dependencies:

  • os
  • copy

How to use:

  • On the CLI: navigate to the directory containing Lab_B.py and type $python3 andystrozewski-anaverulidze-katrinaziebarth-labB.py -r 5 -c 2 -p 2. r, c and p refer to the number of rows, columns, and piece rows in that order. Make sure to replace 5, 2 and 2 with integers of choice.

example output:

XX
XX
--
OO
OO

Possible Moves for X:

XX
-X
X-
OO
OO

XX
-X
-X
OO
OO

XX
X-
-X
OO
OO

XX
X-
X-
OO
OO

About

Minimax search algorithm and AIs competing against each other in Breakthrough

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages