Minimax4j is a JAVA implementation of the minimax algorithm.
It is a simple but complete abstract API that let you concentrate on the evaluation function.
<dependency>
<groupId>fr.avianey</groupId>
<artifactId>minimax4j</artifactId>
<version>1.0.0</version>
</dependency>Samples are available in the minimax-sample project and provide basic implementations for the following IA :
- Tic-Tac-Toe
The Minimax4j javadoc is available on the github project page.
The MIT License (MIT)
Copyright (c) 2015 Antoine Vianey
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
Feel free to contribute by sending pull requests.
Abstract mechanism that would likely fit into the API are :
- Transposition table (to optimize & test)
- Quiescence search
- Opening table
- Best-First Search
- @avianey : creator
List of projects using minimax4j :
Fork the project and send a pull request to add your application in this list.