Project 2.3 - Minimax with alpha beta pruning in java for reversi / othello and Tic-Tac-Toe - 🏆 nr 1 out of 25 groups
-
Updated
Apr 19, 2019 - Java
Project 2.3 - Minimax with alpha beta pruning in java for reversi / othello and Tic-Tac-Toe - 🏆 nr 1 out of 25 groups
An AI that plays Reversi by computing the best move through simulating future game states with a minimax algorithm (with alpha-beta pruning).
Reversi Game developed with Java for Android
This repository contains an implementation of the Reversi game with an AI player using the minimax algorithm. The game is developed in Java, with a graphical user interface built using Java Swing.
Strategy board game for two players
This Project belongs to the course Artificial Intelligence, given by the master. I did this project with contribution to Mohsen Rahnamaei.
Reversi game with Min-Max algorithm with alpha-beta pruning
Othello or Reversi is a strategy board game played between 2 players. One player plays black and the other white. Each player gets 32 discs and black always starts the game. The goal is to get the majority of colour discs on the board at the end of the game.
An implementation of the "Othello-Reversi" game, we created during our third year at AUEB's Artificial Intelligence course.This impementation, uses the MiniMax algorithm with a-b pruning.For that reason, you can initialize the depth ot the algorithm, in order to make him more clever or dumber.
MinMax AI with Alpha-beta pruning for Othello board game
Software Development Methods (567SM) final project
This repository stores code that can be used to solve\analyze the Reversi board game
Othello is Strategy board game for two player
First Year project (Module: Programming Paradigms), focusing on Object Oriented Principles and getting to grips with Java
Add a description, image, and links to the reversi topic page so that developers can more easily learn about it.
To associate your repository with the reversi topic, visit your repo's landing page and select "manage topics."