This is a chess game written in java 8, using a javafx ui.
The goal was to create a user-friendly game which allows the user to play against a computer opponent. Also, games can be exported or imported in FEN or PGN.
- About the game
1.1 Before you start the game
1.2 The game
1.2.1 The AI opponent
1.2.2 Chess notations
1.2.3 Editing a game
1.2.4. Thoughts about this project - Project structure
- How to get it
Before the game starts, you will be able to adjust some parameters:
- Color choice: pieces of chosen color will be initialized at the bottom
- Rule choice: as there are some not-sure-if-I-like-this-rules, specific rules can be deactivated
- Mode choice: choose how players are controlled (by you or AI)
- Difficulty choice: the AI player difficulty can be controlled here. the highest setting is around the difficulty level 5-6 of Chess.com
- Load: here, you can load existing games from FEN or PGN code
The game can be played by clicking or by using drag&drop. For more information about how to handle the application see the manual. If you are not very familiar with the chess game itself, there is an additional file which quickly explains the rules.
The AI opponent was created by using a minimax algorithm with alpha-beta-pruning. This means, that the opponent will simulate a few moves ahead and then choose the move which seems to avoid the worst situation while maximizing the chance to win.
The algorithm takes following to account:
- Recursion depth (steps of simulating moves ahead)
- Heuristics to add recursion depth for the endgame
- Piece values (e.g. a queen is valued higher than a pawn)
- Piece position values (e.g. a knight is valued higher when positioned at the center of the board, as it has more move options there)
- So called 'spasm-parameter', which will generate random moves occasionally to appear more human
- Library of known chess openings to obtain a good starting position
- Heuristics to avoid a a draw by stalemate
- Heuristics to avoid a draw by threefold repetition
- Heuristics to avoid a draw by 50 'moves of no value'
Depending on the rule and difficulty settings, the behavior of the AI opponent will change accordingly. Example: On the highest difficulty setting we have a recursion depth of 4, while on the lowest difficulty setting we have a no recursion at all.
As the recursion depth has a huge impact on the speed of the caluclations (which increases exponentially), the maximum depth of 4 seemed a suitable compromise to get a more-or-less smart opponent, without having to wait 100 years for the next move.
During the game, the moves are logged to the console and can be exported as html file. Here, the long algebraic notation (LAN) is used.
Example for LAN:
e2-e4
For importing and exporting games, the FEN and PGN notations are used. These notations are widely used for chess games.
The FEN notation is a very compact one-line-code for a current board situation. It is useful if a board state should be quickly copied to be recreated later and/or in another chess program.
Example for FEN:
rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1
The PGN notation is more complex. It contains metadata about the game (players, location, round, etc.) and the complete list of moves. This means, a whole game can be recreated step by step, which is useful if you want to do analyzes.
Example for PGN:
[Event "Casual waste of time"]
[Site "Your cave, SWITZERLAND"]
[Date "2019.12.08"]
[Round "2"]
[White "Thought, Deep"]
[Black "Blue, Deep"]
[Result "0:1"]
1. f4 d5 2. Nc3 d4 3. Nb5 a6 4. Na3 Bg4 5. h3 Bh5 6. d3 Nd7
7. Bd2 e6 8. Nc4 Qh4+ 9. g3 Qxg3# 0:1
I really hated to implement this feature, as in a real chess game, steps should not be undone. Still, it's cool for whait-what-happened-moments or analyzing already played games.
I did this project for fun and curiosity. The main motivation I was driven by was 'how do I get a nice chess game with a really smart AI' (and so far, I was not able to beat the AI myself). As you will see in the code, many of the features (e.g. exports, edit mode) grew in in a quite organic way. If I was more serious about it, the architecture should have been restructured accordingly. The main issue of the AI opponent is the speed of the calculations, which limits the recursion depth to 4. Recursion depth could be increased if the move generation handling would be closer to machine code (i.e. bit shifting methods). After all, Java might not be the best programming language for that purpose. Another issue is testability. As the coupling is not loose enough, I was not going too far with unit tests. Some other time, I will do further work here or start again from scratch.
com.chess.applicationthis package contains the main method (inChess.java), as well as gui related classescom.chess.modelenums, container classes, data classescom.chess.resourcestext and image filescom.chess.rootcontains the 'game engine' (pieces, board, game handling, AI logic)
Clone the repository with:
git clone https://github.com/lpapailiou/chess your-target-path
For further help, click here.