Search Results for "minimax algorithm"
Sort By:
Showing 18 open source projects for "minimax algorithm"
View related business solutions-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
Build on Google Cloud with $300 in Free CreditStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query exabytes in BigQuery, or build AI apps with Vertex AI and Gemini. Once your credits are used, keep building with 20+ products with free monthly usage, including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. Sign up to start building right away.
-
1
MiniMax-M1
Open-weight, large-scale hybrid-attention reasoning model
MiniMax-M1 is presented as the world’s first open-weight, large-scale hybrid-attention reasoning model, designed to push the frontier of long-context, tool-using, and deeply “thinking” language models. It is built on the MiniMax-Text-01 foundation and keeps the same massive parameter budget, but reworks the attention and training setup for better reasoning and test-time compute scaling. Architecturally, it combines Mixture-of-Experts layers with lightning attention, enabling the model to... -
2
Algerian/Spanish Checkers
Algerian / Spanish checkers with Minimax and Alpha–beta pruning
Algerian / Spanish Checkers Variant is a digital implementation of the classic board game with unique features and rules. Currently, the program integrates an AI opponent using the Minimax algorithm with alpha-beta pruning. The previous versions just favours moves that result in the fewest captures for the opponent. Future versions will include more sophisticated AI to enhance gameplay. The program currently handles all kind of regular piece and dama moves and captures. -
3
Basic Blind Chess
Blind Chess using Taiwan rule
Blind Chess also known as "Dark Chess" (暗棋) or "Banqi" or Half Chess , is a two-player Chinese board game played on a 4x8 grid, or half of the xiangqi (Chinese Chess) board. This application is using Taiwan rule. AI is using basic minimax tree structure and some rules. Advanced algorithm such as Upper Confidence bounds applied to Trees and Monte Carlo Tree Search are NOT used. This app is single player vs computer only. For English user, Christakis Giorgios made Software Requirements Specification(pdf file), it will help anyone that downloads this application to understand basic blind chess and use it. ... -
4
neurochess
Self chess learning process by artificial neural network
Self chess learning process by artificial neural network white random attribution to of values of chess game, before to pass opposed value to neural network and the desire successor of board with various part of game chess generated with minimax algorithm. -
Deploy Apps in Seconds with Cloud RunCloud Run is the fastest way to deploy containerized apps. Push your code in Go, Python, Node.js, Java, or any language and Cloud Run builds and deploys it automatically. Get fast autoscaling, pay only when your code runs, and skip the infrastructure headaches. Two million requests free per month. And new customers get $300 in free credit.
-
5
TicTacToe
Tic Tac Toe game with clever computer player
...Players can be human or AI. The AI has two settings: dumb and intelligent. The dump setting places tokens by random, the intelligent setting plays the best possible move by running a MiniMax algorithm. The executable requires the LabVIEW Run-Time Engine 2014 - (32-bit) available for download here: http://ftp.ni.com/support/softlib/labview/labview_runtime/2014/Windows/f2/LVRTE2014f2std_downloader.exe -
6
Nand2Tetris - TicTacToe
Tic Tac Toe Game for the Nand2Tetris Project
This is an implementation of the classic Tic Tac Toe game on the Hack computer as part of the Nand2Tetris project. The game features a 1 or 2-player mode with a computer-controlled player for single player games. The computer AI uses a 'minimax' algorithm and has 3 levels of difficulty - the Impossible mode is unbeatable! -
7
ChessAT
one more chess engine in the barn
This simple chess engine employs a minimax algorithm to calculate two moves ahead. -
8
Artificial Intelligence Connect 4 Game
Artificial Intelligence Connect 4 Game
Artificial Intelligence Connect 4 Game using minimax search algorithm -
9
Connect Four
A simple connect four game in C#
This is a small and simple project which i used to work on creating a minimax algorithm. In its current state, the algorithm is finished. Future updates will try to: 1. Add heuristics instead of just checking for wins 2. Introduce alpha-beta pruning Other updates not concerning the AI will be: 1. Coins will fall down into place, instead of appearing 2. You can set if you want to play with 2 humans, 2 computers or an AI and a human. 3. -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
10
Dots and Boxes Standalone
Dots and boxes game to practice vs your computer
Dots&Boxes is becoming a super-charged multiplayer game based on the traditional Dot Game first published in 1889 by Édouard Lucas. This standalone version uses the minimax algorithm with alpha-beta pruning to enhance the computer game difficulty. -
11
Panzercheckers
checkers game with official brazilian rules
Checkers board game with official brazilian rules. The game engine uses an endgame database with up to 4 pieces. Many optimization techniques were used to generate and process the game tree tree and minimax algorithm. Bitboards and zobrist keys are also used. -
12
A start of Hockey Demo. The intelligence of the players is using AI techniques, such as MiniMax algorithm.
-
13
Open source clone of the board strategy game blokus, mainly the duo (1vs1) mode. Each player has 21 pieces to put on the board while preventing the opponent from doing the same. Also features solo or 4 players games and an expandable challenge mode.
-
14
Another project based on the famous Tic-Tac-Toe game. The AI is based on the Minimax algorithm. Design: Julian Kuntorov ( http://juliank.eu/ ) , Development: Me :)
-
15
-
16
Color Expansion board game, built on generic minimax algorithm. This program is a member of Color Expansion AI's contest.
-
17
Tic Tac Toe AI
[Tic Tac Toe : AI version]
[Tic Tac Toe ] Tic tac toe is a popular game almost all were played @ some point of their life. Its my sincere effort to make this game more interactive and more interesting. (http://en.wikipedia.org/wiki/Tic-tac-toe) [MiniMax] Current project works on MiniMax algorithm. (http://en.wikipedia.org/wiki/Minimax) [Project Info] Current game has 2 modes 1. Human Vs. Human 2.Human Vs. CPU [Future enhancement] 1.Add network support 2.Add nice GUI (I'm newbie to the graphic programming :( ) [Support] Please feel free to suggest any enhancements or ask any doubts. -
18
S7r47e50 is an attempt to write a version of Stratego for Linux in Ruby using mySQL for 'opening books', a minimax algorithm as the AI, and TCP/IP bindings for internet multiplayer options. It will be licenses under the GPL v2.
- Previous
- You're on page 1
- Next
