Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/loopfz/jnegachess
Simple Chess game written in Java with a Negamax solver.
https://github.com/loopfz/jnegachess
Last synced: 29 days ago
JSON representation
Simple Chess game written in Java with a Negamax solver.
- Host: GitHub
- URL: https://github.com/loopfz/jnegachess
- Owner: loopfz
- License: mit
- Created: 2013-03-06T19:36:43.000Z (almost 12 years ago)
- Default Branch: master
- Last Pushed: 2013-03-10T01:18:28.000Z (almost 12 years ago)
- Last Synced: 2024-10-16T14:12:19.894Z (3 months ago)
- Language: Java
- Size: 969 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.txt
- License: LICENSE.txt
Awesome Lists containing this project
README
--------------------------------------------------------------------------------
| ___ _____ _ |
| |_ | / __ \ | |
| | |_ __ ___ __ _ __ _| / \/ |__ ___ ___ ___ |
| | | '_ \ / _ \/ _` |/ _` | | | '_ \ / _ \/ __/ __| |
| /\__/ / | | | __/ (_| | (_| | \__/\ | | | __/\__ \__ \ |
| \____/|_| |_|\___|\__, |\__,_|\____/_| |_|\___||___/___/ |
| __/ | |
| |___/ |
| |
--------------------------------------------------------------------------------
| Written by Thomas Schaffer in Java. |
| Licensed under the MIT license. |
--------------------------------------------------------------------------------
--------------------------------------------------------------------------------
| Description |
--------------------------------------------------------------------------------
JnegaChess is a simple Chess game written by myself in Java for the purpose of
discovering game tree search techniques (minimax, negamax, alpha-beta...).
It uses a Negamax solver with alpha-beta pruning as its core, which
can look between 6 and 8 plies ahead. The number of plies is kept small for
real-time performance.
Leaf nodes in the game tree are evaluated using a simplified evaluation
function proposed by Polish researcher Tomasz Michniewski, using
only material evaluation (piece values) and position matrixes for each
piece type. No quiescence search or other chess-specific optimizations
are applied since this was not the goal pursued.
Human player plays white, good luck!