unbeatable implementation of tic-tac-toe using the Minimax Algorithm and Strategy Design Pattern.
-
Updated
May 26, 2021 - Java
unbeatable implementation of tic-tac-toe using the Minimax Algorithm and Strategy Design Pattern.
This Java program is a console-based Tic-Tac-Toe game where you can play against an AI opponent. The AI uses the Minimax algorithm to make optimal moves, simulating all possible outcomes to ensure the best strategy. The game includes input validation and automatically detects win, loss, or tie conditions.
Projek Tengah Semester Riset Operasi
Type-safe abstract trait recorder for 'finite state automata'-like agent
This repo contains scripts for optimizing payoff in auction games.
Game Theory Solver created using Java Swing.
This Repository contains topics related to computer optimization, computer orientation, operation research. Optimization techniques are methods used to find the best possible solution or outcome for a given problem within a defined set of constraints and criteria.
Project developed for "Tecnologias de Negócio Eletrónico" ("Eletronic Commerce Technologies") @ FEUP
Implementation of an AI agent for Tic Tac Toe and other games.
This repository aims to solve and create new problems from different spheres of coding. A path to help students to get access to solutions and discuss their doubts.
Add a description, image, and links to the game-theory-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the game-theory-algorithms topic, visit your repo's landing page and select "manage topics."