8000 Decorator by avianey · Pull Request #2 · avianey/minimax4j · GitHub
[go: up one dir, main page]

Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension


Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 14 additions & 2 deletions minimax4j/pom.xml
C07C
Original file line number Diff line number Diff line change
Expand Up @@ -7,8 +7,8 @@
<packaging>jar</packaging>
<version>1.0.1-SNAPSHOT</version>
<description>
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.
Minimax4j is a pure java implementation of the IA algorithm.
It provides implementation of standard IA 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, ...
</description>
<contributors>
Expand Down Expand Up @@ -70,6 +70,9 @@
<goals>
<goal>jar</goal>
</goals>
<configuration>
<additionalparam>${javadoc.additionalparam}</additionalparam>
</configuration>
</execution>
</executions>
</plugin>
Expand Down Expand Up @@ -170,6 +173,15 @@
</repository>
</distributionManagement>
</profile>
<profile>
<id>javadoc-8</id>
<activation>
<jdk>1.8</jdk>
</activation>
<properties>
<javadoc.additionalparam>-Xdoclint:none</javadoc.additionalparam>
</properties>
</profile>
</profiles>

</project>
Loading
0