Skip to content

Commit 651a77c

Browse files
committed
Preparations before release
1 parent c603abc commit 651a77c

File tree

2 files changed

+30
-6
lines changed

2 files changed

+30
-6
lines changed

CHANGELOG.md

Lines changed: 22 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,26 @@
1+
# Version 1.4.0 (03-08-2024)
2+
- Added relative PST
3+
- Added check extensions
4+
- Added countermove heuristic
5+
- Added simplified benchmark when "dev" feature is not enabled
6+
- Added history table penalties and reduced aging divisor
7+
- Added non-standard "fen" command to UCI
8+
- Added crash when the best move is invalid (only in dev version)
9+
- Added pawn attacks cache
10+
- Added support for LZCNT instruction
11+
- Improved evaluation parameters by using a new dataset for tuning
12+
- Improved search parameters
13+
- Improved header, now it also includes LLVM version, target, profile and enabled features
14+
- Renamed "tunerset" command to "dataset"
15+
- Merged "bindgen" and "syzygy" features
16+
- Fixed rare bug with invalid moves when a search was aborted
17+
- Fixed crash when ply is larger than the killer table size
18+
- Fixed performance overhead of setting a new position
19+
20+
**Strength**: 2950 Elo
21+
122
# Version 1.3.0 (14-06-2024)
2-
- Added search parameters as UCI options (only if the dev feature is present)
23+
- Added search parameters as UCI options (only if the "dev" feature is enabled)
324
- Added gradient descent tuner in place of local search
425
- Added internal iterative reduction
526
- Added bishop pair evaluation

README.md

Lines changed: 8 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,13 +1,14 @@
11
# Inanis
22
UCI chess engine written in Rust, the successor of [Proxima b](https://github.com/Tearth/Proxima-b), [Proxima b 2.0](https://github.com/Tearth/Proxima-b-2.0) and [Cosette](https://github.com/Tearth/Cosette). The project is written after hours, with the goal to reach a strength of 3000 Elo. Perfect as a sparring partner for other chess engines, since it was heavily tested using very fast games. Supports Syzygy tablebases, MultiPV, pondering and multithreading.
33

4-
**Current strength**: 2900 Elo (14-06-2024)
4+
**Current strength**: 2950 Elo (03-08-2024)
55

66
**Documentation**: https://tearth.dev/Inanis/
77

88
## Releases
99
| Version | Release date | Elo | Main changes |
1010
|---------------------------------------------------------------|--------------|------|--------------|
11+
| [1.4.0](https://github.com/Tearth/Inanis/releases/tag/v1.4.0) | 03-08-2024 | 2950 | Check extensions, relative PST, countermove heuristic |
1112
| [1.3.0](https://github.com/Tearth/Inanis/releases/tag/v1.3.0) | 14-06-2024 | 2900 | Gradient descent tuner, improved SEE and evaluation |
1213
| [1.2.1](https://github.com/Tearth/Inanis/releases/tag/v1.2.1) | 04-09-2023 | 2850 | Commands executed directly from a command line, perft in UCI mode |
1314
| [1.2.0](https://github.com/Tearth/Inanis/releases/tag/v1.2.0) | 15-01-2023 | 2850 | Improved Syzygy support, general performance and stability improvement |
@@ -70,7 +71,7 @@ Examples of running the tuner:
7071
- `tuner ./input/quiet.epd ./output/ true true 4` - run tuning with 4 threads (excluding piece values) for positions stored in `quiet.epd`, starting from the values already set in the engine, and saving the result in the `output` directory
7172

7273
Since version 1.1.0, Inanis also has a command to generate epd files with quiet positions, based on provided PGN input:
73-
- `tunerset ./input/games.pgn ./output/quiet.epd 16 250 50 3 0.5` - generate a new `quiet.epd` file, by parsing `games.pgn` and taking 3 random positions from each of the game, ignoring these with a ply less than 16, evaluation score bigger than 250, and the difference between evaluation score and quiescence search score bigger than 50. The average game phase 0.5 means that the positions will be balanced (> 0.5 = near opening, < 0.5 = near ending)
74+
- `dataset ./input/games.pgn ./output/quiet.epd 16 250 50 3 0.5` - generate a new `quiet.epd` file, by parsing `games.pgn` and taking 3 random positions from each of the game, ignoring these with a ply less than 16, evaluation score bigger than 250, and the difference between evaluation score and quiescence search score bigger than 50. The average game phase 0.5 means that the positions will be balanced (> 0.5 = near opening, < 0.5 = near ending)
7475

7576
## Test suites
7677
Testing of strategic evaluation performance can be done by using the `test` command, which performs a fixed-depth search for positions stored in the EPD file.
@@ -111,12 +112,14 @@ All commands listed below can be executed both in interactive mode and directly
111112
=== General ===
112113
benchmark - run test for a set of positions
113114
evaluate [fen] - show score for the position
115+
uci - run Universal Chess Interface
116+
quit - close the application
117+
118+
=== Development ===
119+
[DEV] dataset [pgn] [output] [min_ply] [max_score] [max_diff] [density] - dataset generator
114120
[DEV] magic - generate magic numbers
115121
[DEV] testset [epd] [depth] [transposition_table_size] [threads_count] - run test of positions
116122
[DEV] tuner [epd] [output] [lock_material] [randomize] [threads_count] - run tuning
117-
[DEV] tunerset [pgn] [output] [min_ply] [max_score] [max_diff] [density] - dataset generator
118-
uci - run Universal Chess Interface
119-
quit - close the application
120123
121124
=== Perft ===
122125
perft [depth]

0 commit comments

Comments
 (0)