https://github.com/nxhawk/minimax-with-game

Minimax is a backtracking algorithm used in decision-making and game theory to determine the best move for a player, provided that your opponent also plays optimally. It is commonly employed in two-player turn-based games like Tic-Tac-Toe, Backgammon, Mancala, and Chess.
https://github.com/nxhawk/minimax-with-game

ai alpha-beta-pruning astar-algorithm bot connect-four heuristics minimax-algorithm python3 tic-tac-toe

Last synced: 4 months ago
JSON representation

Minimax is a backtracking algorithm used in decision-making and game theory to determine the best move for a player, provided that your opponent also plays optimally. It is commonly employed in two-player turn-based games like Tic-Tac-Toe, Backgammon, Mancala, and Chess.

• Host: GitHub
• URL: https://github.com/nxhawk/minimax-with-game
• Owner: nxhawk
• Created: 2023-03-07T11:31:09.000Z (over 2 years ago)
• Default Branch: master
• Last Pushed: 2023-03-07T11:46:13.000Z (over 2 years ago)
• Last Synced: 2025-01-12T05:08:22.240Z (5 months ago)
• Topics: ai, alpha-beta-pruning, astar-algorithm, bot, connect-four, heuristics, minimax-algorithm, python3, tic-tac-toe
• Language: Python
• Homepage: https://indiaai.gov.in/article/understanding-the-minmax-algorithm-in-ai
• Size: 10.7 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Minimax

Project sử dụng thuật toán minimax kết hợp alpha-beta pruning, heurictis để cài đặt bot chơi các game phổ biến.

Đặc điểm của các game này là game 2 người chơi (hoặc là người chơi với (nhiều) kẻ địch), người chơi biết trạng thái của cả hai bên, game có 2 trạng thái (thắng, thua) or 3 trạng thái (thắng, thua, hòa) or vị trí cụ thể (game di chuyển).

Ví dụ các game như: [tic-tac-toe](https://nxhawk.github.io/caro-bot/), [connect4](https://connect4.gamesolver.org/?pos=44234352511334),...