Artificial-Intelligence-BNUT / TicTacToe-Minimax-AlphaBeta Public

Notifications You must be signed in to change notification settings
Fork 3
Star 0

A Tic-Tac-Toe game employing Minimax and Alpha-Beta Pruning algorithms for the computer player. Play against another player or challenge the computer, which strategically selects optimal moves. Detects winners or draws and offers customizable user interfaces. Ideal for AI algorithm exploration in gaming.

0 stars 3 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
README.md		README.md

Repository files navigation

Tic-Tac-Toe with Minimax and Alpha-Beta Pruning

Objective:

Understand Minimax and Alpha-Beta Pruning algorithms.
Implement Tic-Tac-Toe using these algorithms.

Description:

Two-player game: human vs. computer.
Players take turns placing symbols (X or O) on a 3x3 grid.
Computer player uses Minimax to find best moves.
Alpha-Beta Pruning enhances Minimax's performance.

Notes:

Detects game winners or draws.
Separate functions for Minimax and Alpha-Beta Pruning.
UI customization: text-based or graphical.

About

A Tic-Tac-Toe game employing Minimax and Alpha-Beta Pruning algorithms for the computer player. Play against another player or challenge the computer, which strategically selects optimal moves. Detects winners or draws and offers customizable user interfaces. Ideal for AI algorithm exploration in gaming.

Custom properties

Report repository

Releases

No releases published

Packages

No packages published