Search Results for "minimax"
Sort By:
Showing 29 open source projects for "minimax"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your secuirty. Auth0 now, thank yourself later.
-
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
1
MiniMax Timer
Customizable countdown timer
The MiniMax Timer is a simple timer application which, for now, only counts downward. It has the following customizable features: - always on top - fullscreen - timer font, text color and background color - display a customizable text when the timer ends - timer's size and location - timer control shortcuts The settings (positions, colors, sizes) are automatically saved upon exiting the program. -
2
Bookbuilder opensource, based on old version Bookbuilder 3.5 (with full minimax but no opening names) and Bookbuilder 4.3 with openings names, and line minimax
-
3
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. -
4
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... -
IBM Blueworks Live is a cloud-based business process modeling tool that helps you discover, map and document your processes.With an intuitive, web-based interface, IBM Blueworks Live empowers teams to document, analyze and streamline processes with unprecedented ease and efficiency, with no downloads necessary. It's designed for dynamic collaboration, enabling stakeholders to connect, share insights and drive improvements in real-time, from anywhere.
-
5
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. -
6
-
7
TicTacToe
Tic Tac Toe game with clever computer player
This is a LabVIEW implementation of the Tic Tac Toe game. 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 -
8
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! -
9
ChessAT
one more chess engine in the barn
This simple chess engine employs a minimax algorithm to calculate two moves ahead. -
SalesNOW Mobile CRM - CRM for the Mobile ProfessionalSalesNOW allows sales teams, management, and executives to manage all aspects of the sales cycle including contact management, company tracking, lead management, deal management, case management, activity, and sales reporting. Highly mobile individuals can access all customer and prospect data, track contacts, companies, leads, deals, events, and e-mail all from a single platform.
-
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
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. You can select different AI's Lots of work... -
12
Artificial Intelligence Connect 4 Game
Artificial Intelligence Connect 4 Game
Artificial Intelligence Connect 4 Game using minimax search algorithm -
13
Connect 4 AI
a connect 4 game with a smart AI
Connect-4 is a very simple game to learn. It is played on a 8 X 8 board (actually should be 7 x 6 but in this project we changed it to 8 X 8) and, the goal is to get four consecutive cells either horizontally, vertically or diagonally. The first player to get four consecutive cells wins. It has been proven that there is an optimal strategy for this game i.e. In this project, we worked on implementing a player that uses a minimax with alpha-beta pruning and a heuristic model using Java... -
14
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. -
15
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.
-
16
A start of Hockey Demo. The intelligence of the players is using AI techniques, such as MiniMax algorithm.
-
17
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 :)
-
18
-
19
Es un juego de TaTeTi o tres en raya programado en Java SE que ademas de jugar con un oponente humano permite jugar contra el algoritmo Minimax
-
20
-
21
"Plaga" is a board game based on tiles and SDL. The objective of the game is to dominate the greater number of cells of the board. Exist 3 modes: player vs player, player vs com and com vs com. AI of COM is based on minimax. Enjoy it!
-
22
This Projects purpose is to provide a simple Engine to play a basic 2 player Strategy Boardgame. This engine allows you to write computer agents to experiment with AI techniques (minimax, alpha-beta Pruning, neural networks ...)
-
23
This is a program able to play the connect-four game, using a minimax tree search. The interesting part is that the search tree is independent of the heuristic and can be reused. Is written in compiled java.
-
24
Color Expansion board game, built on generic minimax algorithm. This program is a member of Color Expansion AI's contest.
-
25
SMART: SMART Minimax Analyser for Recursive Trees. The goal of the SMART project is to develop a powerful state-of-the art FICS compliant chess engine, using experimental technology (re-iterative MTDf , ETC, reinforced temporal difference learning, etc.)