JarCasting
JarCasting JarCasting

minimax4j

Minimax4j is a pure java implementation of the minimax algorithm. It provides implementation of standard minimax but also provides alpha-beta pruning, negamax or negascout. This project can be use to implement two-person zero-sum games of perfect information such as chess, reversi, connect four, ...

License

License
Categories

Categories

Avian
GroupId

GroupId

fr.avianey
ArtifactId

ArtifactId

minimax4j
Last Version

Last Version

1.0.0
Release Date

Release Date
Type

Type

jar
Description

Description

minimax4j
Minimax4j is a pure java implementation of the minimax algorithm. It provides implementation of standard minimax but also provides alpha-beta pruning, negamax or negascout. This project can be use to implement two-person zero-sum games of perfect information such as chess, reversi, connect four, ...
Source Code Management

Source Code Management

https://github.com/avianey/minimax4j

Download minimax4j

Filename Size
minimax4j-1.0.0.pom
minimax4j-1.0.0.jar 8 KB
minimax4j-1.0.0-sources.jar 4 KB
minimax4j-1.0.0-javadoc.jar 50 KB
Browse

How to add to project

<!-- https://jarcasting.com/artifacts/fr.avianey/minimax4j/ -->
<dependency>
    <groupId>fr.avianey</groupId>
    <artifactId>minimax4j</artifactId>
    <version>1.0.0</version>
</dependency>
// https://jarcasting.com/artifacts/fr.avianey/minimax4j/
implementation 'fr.avianey:minimax4j:1.0.0'
// https://jarcasting.com/artifacts/fr.avianey/minimax4j/
implementation ("fr.avianey:minimax4j:1.0.0")
'fr.avianey:minimax4j:jar:1.0.0'
<dependency org="fr.avianey" name="minimax4j" rev="1.0.0">
  <artifact name="minimax4j" type="jar" />
</dependency>
@Grapes(
@Grab(group='fr.avianey', module='minimax4j', version='1.0.0')
)
libraryDependencies += "fr.avianey" % "minimax4j" % "1.0.0"
[fr.avianey/minimax4j "1.0.0"]

Dependencies

There are no dependencies for this project. It is a standalone project that does not depend on any other jars.

Project Modules

There are no modules declared in this project.

Minimax4j

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

Samples are available in the minimax-sample project and provide basic implementations for the following IA :

  • Tic-Tac-Toe

Documentation

The Minimax4j javadoc is available on the github project page.

Licence

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.

Contribute

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

Contributors

Who's using it ?

List of projects using minimax4j :

Fork the project and send a pull request to add your application in this list.

Versions

Version
1.0.0