]>
git.sesse.net Git - stockfish/log
Marco Costalba [Fri, 19 Apr 2013 07:41:28 +0000 (09:41 +0200)]
Skip a couple of popcount in previous patch
And some little tidy up
No functional change.
Marco Costalba [Fri, 19 Apr 2013 07:31:18 +0000 (09:31 +0200)]
Merge Joona's bishop+pawn tweak
The idea is to penalize a bishop in case of
its pawns are on the same colored squares.
Good at short 15"+0.05 TC
LLR: 2.95 (-2.94,2.94)
Total: 4252 W: 925 L: 806 D: 2521
And at longer 60"+0.05 TC
LLR: 2.95 (-2.94,2.94)
Total: 15006 W: 2743 L: 2564 D: 9699
bench:
5274705
Joona Kiiski [Wed, 17 Apr 2013 06:58:59 +0000 (07:58 +0100)]
Try more aggressive version
Joona Kiiski [Tue, 16 Apr 2013 20:20:31 +0000 (21:20 +0100)]
Give a small penalty for bishop for each pawn on the same colored square
Marco Costalba [Sun, 14 Apr 2013 21:29:00 +0000 (23:29 +0200)]
Skip a redundant check
Spotted by Joona
No functional change.
Marco Costalba [Wed, 10 Apr 2013 20:23:48 +0000 (22:23 +0200)]
De-templetize Position::is_draw()
Now that we always check for repetition we don't
need a template anymore.
No functional change.
Joona Kiiski [Wed, 10 Apr 2013 20:19:21 +0000 (22:19 +0200)]
Always check repetition
It seems stronger both at fast 15+0.05 TC with fixed game number test:
ELO: 2.74 +-2.7 (95%) LOS: 97.6%
Total: 24000 W: 4698 L: 4509 D: 14793
And also at long 60+0.05 TC with SPRT
LLR: 3.05 (-2.94,2.94)
Total: 38986 W: 6845 L: 6547 D: 25594
bench:
5157061
Marco Costalba [Tue, 9 Apr 2013 21:18:28 +0000 (23:18 +0200)]
Simplify and speed up previous patch
Use an optinal argument instead of a template
parameter. Interestingly, not only is simpler,
but also faster, perhaps due to less L1 instruction
cache pressure because we don't duplicate the very
used SEE code path.
No functional change.
Joona Kiiski [Tue, 9 Apr 2013 08:20:10 +0000 (09:20 +0100)]
Document asymmetric SEE pruning trick
Here are the tests:
sprt @ 60+0.05
ELO: 3.53 +-2.8 (95%) LOS: 99.3%
Total: 18794 W: 3098 L: 2907 D: 12789
16000 @ 60+0.05
ELO: 1.39 +-3.1 (95%) LOS: 81.0%
Total: 16000 W: 2689 L: 2625 D: 10686
16000 @ 15+0.05
ELO: 2.82 +-3.3 (95%) LOS: 95.1%
Total: 16000 W: 3148 L: 3018 D: 9834
No functional change
Signature:
4969307
Joona Kiiski [Sun, 7 Apr 2013 08:23:52 +0000 (09:23 +0100)]
Don't treat king safety differently in AnalysisMode
Rationale:
- Current settings seem to make engine *significantly* weaker in analysis mode.
- In practice this setting only has effect when king safety scores are high.
- Even in analysis mode its far more important to know if one side is getting mated,
rather than get evaluation correct with 1cp accuracy.
No functional change
Marco Costalba [Sun, 7 Apr 2013 08:55:10 +0000 (10:55 +0200)]
Rescale UCI parameters to 100
And correspondingly modify internal ones
to compensate it.
No functional change.
Marco Costalba [Fri, 5 Apr 2013 15:42:15 +0000 (17:42 +0200)]
Tweak some UCI parameters
According to Jean-Paul this setup should be stronger
than default.
And SPRT test seems to confirm it:
At fast TC 15"+0.05
ELO: 3.33 +-2.7 (95%) LOS: 99.2%
Total: 25866 W: 5461 L: 5213 D: 15192
At longer TC 60"+0.05
ELO: 7.27 +-5.0 (95%) LOS: 99.8%
Total: 6544 W: 1212 L: 1075 D: 4257
bench:
5473339
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
Marco Costalba [Sun, 7 Apr 2013 08:25:21 +0000 (10:25 +0200)]
Re-add 'Cowardice' and 'Aggressiveness' UCI options
I have lost my bet with Jean-Paul, so now I re-add
the two options...and I am glad of it :-)
No functional change.
Marco Costalba [Thu, 4 Apr 2013 19:53:59 +0000 (21:53 +0200)]
Increase null verification threshold to 12 plies
Increasing depth limit to 10 plies seems stronger
after 16K games at 15"+0.05 (ELO: +3.56) and also
repeating the test at 60"+0.05 TC:
ELO: 2.08 +-3.1 (95%) LOS: 90.9%
Total: 16000 W: 2641 L: 2545 D: 10814
Moreover setting the limit to 12 is proved stronger
then limit set to 10 by direct SPRT test at 15"+0.05:
ELO: 2.56 +-2.0 (95%) LOS: 99.5%
Total: 46568 W: 9240 L: 8897 D: 28431
So we directly set the limit to 12, the strongest setup.
bench:
4361224
Joona Kiiski [Sat, 30 Mar 2013 20:01:49 +0000 (20:01 +0000)]
Make use of asymmetric SEE
Joona Kiiski [Sat, 30 Mar 2013 19:59:34 +0000 (19:59 +0000)]
Fix a silly bug
Joona Kiiski [Sat, 30 Mar 2013 19:49:49 +0000 (19:49 +0000)]
Introduce asymmetric SEE.
No functional change
Marco Costalba [Fri, 5 Apr 2013 14:56:01 +0000 (16:56 +0200)]
Lower minimum allowed TT size to 1 MB
Setting a very low TT size could be used
for some specific testing.
No functional change.
Marco Costalba [Fri, 5 Apr 2013 06:56:22 +0000 (08:56 +0200)]
Revert "Double Impact of Gain tables"
This reverts commit
36c82b751ce227c05bfb
Seems a regression against 2.3.1 tested with 20K games at 60"+0.05
With patch applied
ELO: 15.44 +-2.8 (95%) LOS: 100.0%
Total: 20000 W: 3928 L: 3040 D: 13032
Without patch applied
ELO: 18.76 +-2.8 (95%) LOS: 100.0%
Total: 20000 W: 3903 L: 2824 D: 13273
bench:
4781239
Hiraoka Takuya [Thu, 4 Apr 2013 17:31:31 +0000 (02:31 +0900)]
Don't early stop if we have a mated score
No functional change.
Joona Kiiski [Sun, 31 Mar 2013 17:35:45 +0000 (18:35 +0100)]
Double Impact of Gain tables
Very unorthodox idea.
After 16000 games at 60"+0.05
ELO: 3.14 +-3.4 (95%) LOS: 96.6%
Total: 13407 W: 2278 L: 2157 D: 8972
bench:
4705335
Marco Costalba [Fri, 29 Mar 2013 21:55:07 +0000 (22:55 +0100)]
Set IID half way between d/2 and d-4
Master IID formula is depth / 2
Previous patch is depth - 4 * ONE_PLY
This one is the middle way:
(dept/2 + depth-4*ONE_PLY)/2 -> depth-2*ONE_PLY-depth/4
After 16000 games at 60+0.05 th 1
ELO: 4.08 +-3.1 (95%) LOS: 99.5%
Total: 16000 W: 2742 L: 2554 D: 10704
bench:
4781239
Marco Costalba [Fri, 29 Mar 2013 21:50:04 +0000 (22:50 +0100)]
Merge branch 'master' into increase_iid
Marco Costalba [Mon, 25 Mar 2013 19:04:49 +0000 (20:04 +0100)]
Raise Min Split Depth
Raise the limit to 12 so to allow people to test
on many cores machines.
Suggested by Gary and Martin.
No functional change.
Marco Costalba [Fri, 22 Mar 2013 08:52:41 +0000 (09:52 +0100)]
Update bestValue when futility pruning (2)
Same idea of
5af8179647b9e80353c
in qsearch() but applied to search()
After 15500 games at 15+0.05
ELO: 4.48 +-3.4 (95%) LOS: 99.5%
Total: 15500 W: 3061 L: 2861 D: 9578
bench:
4985829
Joona Kiiski [Fri, 22 Mar 2013 07:54:03 +0000 (08:54 +0100)]
Fix bogus mate scores in some positions
Always before pruning the move, it's important to check that:
bestValue > VALUE_MATED_IN_MAX_PLY
See example position:
8/2p1p3/P1NpP3/3k4/1P1BN3/2P1P3/2Q5/6K1 w - - 0 1
http://support.stockfishchess.org/discussions/problems/268-wrong-declaring-a-forced-mate-in-3-moves
This problem was present in 2.3.1, then it was fixed by my patch.
After 24000 games at 15+0.05
ELO: 2.40 +-4.4 (95%) LOS: 95.7%
Total: 24000 W: 4774 L: 4608 D: 14618
bench:
4465997
jundery [Thu, 21 Mar 2013 05:07:25 +0000 (23:07 -0600)]
Use ALL_PIECES value to reference attackedBy
No functional change
Marco Costalba [Fri, 22 Mar 2013 19:57:31 +0000 (20:57 +0100)]
Increase non-PV IID search depth
bench:
5146380
Marco Costalba [Tue, 19 Mar 2013 18:08:00 +0000 (19:08 +0100)]
Better document bitbase loop
Thanks to Lucas to spot the weak comment and
to Jundery to suggest a better one.
No functional change.
Gary Linscott [Mon, 18 Mar 2013 15:35:19 +0000 (11:35 -0400)]
Add KNPKB endgame
In a game vs Junior, SF had the option to trade into a winning
pawn endgame, and failed to do so. PGN at bottom.
This FEN was one key position: 8/2Nb1k2/6pp/4Pp2/5K1P/5PP1/8/8 w - - 5 62.
SF master chooses h5 here, with a fail high, which goes into the drawn KNPKB
ending. With the patch, SF correctly chooses Ke3, which maintains chances to win.
[Event "nTCEC - Stage 2a - Season 1"]
[Site "http://www.tcec-chess.net"]
[Date "2013.03.05"]
[Round "11.3"]
[White "Stockfish 210213"]
[Black "Junior 13.3"]
[Result "1/2-1/2"]
[Variant "normal"]
1. d4 f5 2. g3 Nf6 3. Bg2 e6 4. c4 d5 5. Nh3 c6 6. O-O Bd6 7. Bf4 Be7 8. Nd2 O-O
9. Qb3 a5 10. Rfd1 Ne4 11. Be3 Nd7 12. Nf4 Ndf6 13. f3 a4 14. Qc2 Nxd2 15. Bxd2
dxc4 16. Qxc4 b5 17. Qc3 Qb6 18. Rac1 e5 19. Nd3 exd4 20. Qxc6 Qxc6 21. Rxc6
Bd7 22. Rcc1 Be6 23. Bb4 Rae8 24. Bxe7 Rxe7 25. Nb4 Bc4 26. Bf1 Rd7 27. Rd2 Re8
28. Rcd1 Rc7 29. Ra1 Rd8 30. Rc1 Rdd7 31. Rcd1 Re7 32. Ra1 Nd5 33. Nc2 Ne3
34. Nxd4 Bxa2 35. Nxb5 Rc5 36. Nd4 Bf7 37. Kf2 g6 38. Rd3 Nxf1 39. Kxf1 Rc4
40. b3 axb3 41. Nxb3 Kf8 42. Rd8+ Re8 43. Rxe8+ Bxe8 44. Kf2 Ke7 45. Ra7+ Bd7
46. Ke1 Rc3 47. Rb7 Rc2 48. Kd1 Rc4 49. Kd2 Kd6 50. Kd3 Rc7 51. Rxc7 Kxc7
52. Kd4 Kd6 53. Nc5 Bb5 54. e4 Be2 55. e5+ Ke7 56. Ke3 Bd1 57. Kf4 h6 58. h3
Kf7 59. h4 Bc2 60. Na6 Ba4 61. Nc7 Bd7 62. h5 g5+ 63. Ke3 Ba4 64. f4 Bd1
65. fxg5 hxg5 66. h6 Kg6 67. e6 f4+ 68. gxf4 gxf4+ 69. Kxf4 Bh5 70. Ke5 Kh7
71. Kf6 Kxh6 72. Na6 Bg4 73. e7 Bh5 74. Nc7 Bg6 75. Nd5 Be8 76. Ne3 Kh7 77. Nc4
Kh6 78. Nd2 Kh5 79. Nf3 Kg4 80. Nd4 Bh5 81. Ne6 Be8 82. Nc5 Kf3 83. Kf5 Ke3
84. Ke5 Ke2 85. Kf4 Kd2 86. Ne4+ Kd3 87. Ke5 Ke3 88. Nf6 Bf7 89. Nd5+ Kf3
90. Kf5 Ke2 91. Ke4 Be8 92. Nc3+ Kd2 93. Kd4 Kc2 94. Nd5 Kd1 95. Nf6 Bf7
96. Ne4 Be8 97. Ke3 Kc2 98. Nd6 Bd7 99. Kd4 Kd1 100. Kd3 Ba4 101. Nc4 Bb5
102. Kc3 Be8 103. Nb2+ Ke1 104. Kd3 Kf2 105. Nd1+ 1/2-1/2
No functional change (just because bench does not change)
Marco Costalba [Sat, 16 Mar 2013 10:20:03 +0000 (11:20 +0100)]
Further increase SEE prune depth
After 16000 games at 60+0.05
ELO: 2.89 +-5.4 (95%) LOS: 96.5%
Total: 16000 W: 2775 L: 2642 D: 10583
bench:
5442365
Marco Costalba [Sat, 16 Mar 2013 10:08:02 +0000 (11:08 +0100)]
Revert "Check for easy move just once"
This reverts commit
a24da071f0d6128c633febab7df55f14475217c3
Seems a regression when tested against 2.3.1
With this patch, have after 20000 games at 60+0.05, we have
ELO: 13.42 +-4.8 (95%) LOS: 100.0%
Total: 20000 W: 3746 L: 2974 D: 13280
Instead with the patch reverted:
ELO: 16.62 +-4.8 (95%) LOS: 100.0%
Total: 20000 W: 3816 L: 2860 D: 13324
Although we are within error bounds here we take the conservative
approach of not introducing changes that are not proved stronger
It doesn't mean that the change shall be weaker, simply that we
don't want to take any risk.
No functional change.
RyanTaker [Wed, 13 Mar 2013 23:23:29 +0000 (16:23 -0700)]
Improved Readability of Material
This is a non-functional change that simply changes the look
of the code to help clarity.
No functional change.
jundery [Mon, 11 Mar 2013 14:18:15 +0000 (08:18 -0600)]
Do more work between prefetch and querying transposition table
More time to load the cache line before access
No functional change.
Gary Linscott [Sun, 10 Mar 2013 09:06:39 +0000 (10:06 +0100)]
Check for easy move just once
Here the rational seems to be that if after one try easy
move detection fails then the easy move is not so easy :-)
After 15563 games at 60+0.05
ELO: 3.04 +-5.5 (95%) LOS: 97.0%
Total: 15563 W: 2664 L: 2528 D: 10371
No functional change.
Gary Linscott [Mon, 4 Mar 2013 15:36:10 +0000 (10:36 -0500)]
Be more aggressive on trying to finish iterations
Increase MaxRatio to use more time when in trouble.
After 16000 games at 60+0.05
ELO: 4.89 +-5.4 (95%) LOS: 99.9%
Total: 16000 W: 2700 L: 2475 D: 10825
No functional change.
Marco Costalba [Mon, 4 Mar 2013 08:38:58 +0000 (09:38 +0100)]
Increase see prune depth
This seems good at short TC controls.
After 10000 games at 20+0.05
ELO: 9.56 +-6.8 (95%) LOS: 100.0%
Total: 10000 W: 1949 L: 1674 D: 6377
Testing at long TC and regression testing is still
ongoing. So this is a bit speculative commit and
could be reverted in the future.
Also re-testing at long TC the SEE pruning in PV nodes
seems less effective (perhaps even a regression, but
still ongoing) so disabled for now.
bench:
4968764
Marco Costalba [Mon, 4 Mar 2013 08:28:21 +0000 (09:28 +0100)]
Revert "Store moves sent with "position" UCI command"
This reverts commit
0d68b523a390e2f5c37f211316869d798e852289 .
After easy move semplification this machinery is not
needed anymore (because of we don't need to know if a
root move is a recapture)
No functional change.
Marco Costalba [Mon, 4 Mar 2013 08:27:00 +0000 (09:27 +0100)]
Simplify "easy move" detection
Detect a move as easy only if it is the only one ;-)
or if is much better than remaining ones after we
have spent 20% of search time.
Tests are ongoing, but it seems this semplification
stands. Anyhow it is experimental for now and could
be reverted/improved with further work Gary is
testing right now.
No functional change.
Marco Costalba [Mon, 4 Mar 2013 07:58:57 +0000 (08:58 +0100)]
Avoid locking/unlocking in a tight loop
After previous patch if split point master is
waiting for job and "Use Sleeping Threads" is
false (our condition for official releases) then
it will lock/unlock splitPoint mutex in a super
tight loop badly affecting performance.
Rewrite the code to lock only when we are about
to finish. Note that race condition on slavesMask
is anyhow fixed.
No functional change.
jundery [Mon, 4 Mar 2013 06:44:46 +0000 (23:44 -0700)]
Fix race condition where idle_loop() gets called from Split()
SplitPoint member slavesMask wasn't read under lock
No functional change.
jhellis3 [Sun, 3 Mar 2013 21:13:05 +0000 (15:13 -0600)]
Stop search if only 1 legal move
There is no point searching a move that is forced.
It wastes time while allowing computer opponents to
fill hash with 100% accuracy.
[edit: Condition moved together with "easy move" ones]
Bench identical:
4922272
Marco Costalba [Sat, 2 Mar 2013 12:20:40 +0000 (13:20 +0100)]
Fix easy re-capture case
We detect an easy move as a recapture with an
high margin on the second best move.
Unfortunatly the recapture detection is broken
becuase we identify as a recapture any move that
follows an opponent's previous capture !
This patch fix the logic to correctly detect a
real re-capture.
No functional change.
Marco Costalba [Sat, 2 Mar 2013 12:03:56 +0000 (13:03 +0100)]
Store moves sent with "position" UCI command
Store all the game moves until current position.
This will be used by next patch.
No functional change.
Marco Costalba [Fri, 1 Mar 2013 08:38:43 +0000 (09:38 +0100)]
Rename sp to splitPoint
Still keep 'sp' name when used as local
variable with limited scope.
From Jundery.
No functional change.
jundery [Thu, 28 Feb 2013 05:18:11 +0000 (22:18 -0700)]
Remove strange use of the ternary operator
Note that we read shared data without lock
protection, so code is theoretically prone to
torn reads. But, first splitPoint pointer
never changes, and alpha is of integer type so
it is read in a single DWORD access.
No functional change.
jundery [Thu, 28 Feb 2013 00:55:56 +0000 (17:55 -0700)]
Split() clean up locking
Only unlock and relock when idle_loop() is actually called
No functional change
Marco Costalba [Wed, 27 Feb 2013 07:10:24 +0000 (08:10 +0100)]
Merge Lucas's "SEE pruning at PV nodes"
bench:
4922272
Marco Costalba [Wed, 27 Feb 2013 07:07:26 +0000 (08:07 +0100)]
Remove pruning condition on alpha
Further simplifying on Lucas's idea, seems reliable
in tests:
ELO: 2.15 +-7 (95%) LOS: 84.9%
Total: 9999 W: 1831 L: 1769 D: 6399
Lucas Braesch [Thu, 21 Feb 2013 14:54:06 +0000 (09:54 -0500)]
Prune negative SEE moves also in PV nodes
This patch is actually the sum of two contributions that
have been tested independently:
1) Pruning of negative SEE moves in PV
After 10000 games at 20+0.05
ELO: 5.18 +-7 (95%) LOS: 99.2%
Total: 10000 W: 1952 L: 1803 D: 6245
2) Remove of bestValue > VALUE_MATED_IN_MAX_PLY condition
After 23000 games at 20+0.05
ELO: 1.63 +-4 (95%) LOS: 88.1%
Total: 23000 W: 4232 L: 4124 D: 14644
The whole patch as been re-tested at long TC with positive results:
After 10000 games at 60+0.05
ELO: 4.31 +-7 (95%) LOS: 98.3%
Total: 10000 W: 1765 L: 1641 D: 6594
Marco Costalba [Sat, 23 Feb 2013 18:27:32 +0000 (19:27 +0100)]
Avoid a tricky line in shelter_storm()
kf = (kf == FILE_A) ? kf++ : ....
is tricky becuase kf is updated twice and it happens
to do the right thing just by accident.
Rewrite in a better way.
Spotted by pdimov
No functional change.
Marco Costalba [Sat, 23 Feb 2013 16:00:33 +0000 (17:00 +0100)]
Convert Readme to markdown format
Looks better on GitHub, that supports this format.
No functional change.
Marco Costalba [Thu, 21 Feb 2013 06:19:03 +0000 (07:19 +0100)]
Use DD-MM-YY as date format
In engine name and version number.
No functional change.
Marco Costalba [Thu, 21 Feb 2013 04:27:26 +0000 (05:27 +0100)]
Statically link std libraries under mingw
Allows for easier redistribution.
No functional change.
Marco Costalba [Wed, 20 Feb 2013 11:19:19 +0000 (12:19 +0100)]
Merge Gary's bishop_pin patch
Give a bonus if a bishop can pin a piece or can
give a discovered check through an x-ray attack.
Seems good after 24000 games at 15"+0.05 (single thread):
ELO: 12.30 +- 99%: 5.79 95%: 4.40 LOS: 100.00%
Total: 24000 W: 4931 L: 4082 D: 14987
bench:
4917064
jundery [Tue, 19 Feb 2013 07:54:16 +0000 (00:54 -0700)]
Print leading zeroes in hash keys
And convert to uppercase. Reset the stream to dec too.
[Edit: Also fixed the hash key in Position::pretty()]
Gary Linscott [Tue, 19 Feb 2013 15:31:52 +0000 (10:31 -0500)]
Merge branch 'master' into bishop_pin_clop
Gary Linscott [Tue, 19 Feb 2013 15:31:50 +0000 (10:31 -0500)]
Bring back original bonus
Marco Costalba [Tue, 19 Feb 2013 06:54:14 +0000 (07:54 +0100)]
Update copyright year
No functional change.
Gary Linscott [Sun, 17 Feb 2013 03:36:58 +0000 (22:36 -0500)]
Back to CLOP average values
Marco Costalba [Sat, 16 Feb 2013 11:42:22 +0000 (12:42 +0100)]
Account for gamePly after each move
Rename startPosPly to gamePly and increment/decrement
the variable after each do/undo move. This adds a little
overhead in do_move() but we will need to have the
game ply during the search for the next patches now
under test.
Currently we don't increment gamePly in do_null_move()
becuase it is not needed at the moment. Could change
in the future.
As a nice side effect we can now remove an hack in
startpos_ply_counter().
No functional change.
Marco Costalba [Fri, 15 Feb 2013 15:21:15 +0000 (07:21 -0800)]
Merge Gary's king safety tweak
Still well within error bars, so probably not a big improvement,
but may be worthwhile. I will let the test keep running. The idea
for the tweak came from the TCEC game against Houdini. Stockfish saw
it as a draw, well past when it should have seen problems. King safety
was off, since it was QN and pawns only, but in fact the king was
quite vulnerable.
After 8000 games at 60/1 (Gary's test)
ELO: -0.43 +- 99%: 10.02 95%: 7.62
Wins: 1235 Losses: 1245 Draws: 5520 Total: 8000
PGN of game against houdini. Moves 55-59 it was seeing a draw, and
Houdini was seeing a good sized advantage for black. With the change,
Stockfish now recognizes that moving the king there is a bad idea.
[Event "nTCEC - Stage 1 - Season 1"]
[Site "http://www.tcec-chess.net"]
[Date "2013.02.07"]
[Round "4.2"]
[White "Stockfish 2.31"]
[Black "Houdini 3.0"]
[Result "0-1"]
[Variant "normal"]
1. Nf3 Nf6 2. c4 e6 3. Nc3 Bb4 4. Qc2 O-O 5. a3 Bxc3 6. Qxc3 b6 7. b4 a5 8. Bb2
axb4 9. axb4 Rxa1+ 10. Bxa1 Na6 11. e3 Qe7 12. b5 Nc5 13. Qc2 Bb7 14. Be2 d6
15. O-O Ra8 16. Bb2 h6 17. Ra1 Rxa1+ 18. Bxa1 e5 19. Qa2 Be4 20. Ne1 Bg6
21. Bb2 Kh7 22. f3 Nfd7 23. Bc3 h5 24. Qa1 h4 25. Kf1 Qf6 26. Qa7 Qd8 27. Qa2
e4 28. Qa1 h3 29. g3 exf3 30. Nxf3 Bf5 31. Bd4 g6 32. Kf2 Kg8 33. Qa3 Bg4
34. d3 Qc8 35. Bxc5 bxc5 36. Ke1 Qb7 37. e4 Bxf3 38. Bxf3 Ne5 39. Be2 Qc8
40. Qa6 Qd8 41. Qa5 Kh7 42. Kd1 Kg7 43. Qa7 Kg8 44. Qa5 Kh7 45. Qa7 Kg7 46. Qa5
Qb8 47. Kd2 Kh7 48. Kc2 Kg8 49. Qa6 Qd8 50. Qa5 Qf6 51. Qe1 Kg7 52. Qf1 Qe6
53. Qe1 Qd7 54. Qc1 Qe8 55. Kc3 Qa8 56. Kb3 Kh7 57. Qa3 Qd8 58. Qc1 c6 59. Qc3
Qb6 60. Ka4 Qb7 61. Qd2 Nd7 62. Qc3 Qa7+ 63. Kb3 Kg8 64. Bg4 cxb5 65. cxb5 Nb6
66. Bxh3 Qa4+ 67. Kb2 Qd1 68. Ka3 Qe2 69. Kb3 Qh5 70. Bg2 Qxh2 71. Qf6 Qxg3
72. Bf1 Qe3 73. Kc2 Na4 74. b6 Nxb6 75. Qd8+ Kg7 76. Qxb6 Qf2+ 77. Kc3 Qxf1
78. Qxd6 Qf6+ 79. Qxf6+ Kxf6 80. Kc4 g5 81. Kxc5 Ke5 82. d4+ Kxe4 83. d5 g4
84. d6 g3 85. d7 g2 86. d8=Q g1=Q+ 87. Kb5 Qb1+ 88. Ka4 Qa2+ 89. Kb4 f5
90. Qe8+ Kf4 91. Qg6 Qd5 92. Qg1 Qe4+ 93. Ka5 Qe2 94. Qg8 Kf3 95. Qd5+ Qe4
96. Qd1+ Kg2 97. Qd2+ Kf1 98. Qh2 f4 99. Qh3+ Ke2 100. Qg4+ Kd2 101. Qg5 Kc2
102. Qh4 0-1
bench:
5518286
Marco Costalba [Fri, 15 Feb 2013 07:56:04 +0000 (08:56 +0100)]
Further speed up bitbase generation
Another trick, along the same lines of previous
patch. This time we first check positions with
white side to move that, becuase we start with
pawn on rank 7, are easily classified as wins,
then black ones.
Number of cycles reduced to 15 !
Becuase now it is faster we can remove a lot of
code to detect theoretical draws. We will calculate
them anyhow, although a bit slower, but the speed
up trick more than compensates it.
Verified that generated bitbases match original ones.
No functional change.
Gary Linscott [Fri, 15 Feb 2013 01:29:24 +0000 (20:29 -0500)]
Add new clop tuned value
Gary Linscott [Thu, 14 Feb 2013 02:41:15 +0000 (21:41 -0500)]
Merge branch 'master' into bishop_pin_clop
Gary Linscott [Thu, 14 Feb 2013 02:40:38 +0000 (21:40 -0500)]
Revert "Use CLOP mean value instead of max"
This reverts commit
d0c2faa5fd9ad05f865d2a69b59efab43b2be421 .
Marco Costalba [Wed, 13 Feb 2013 11:26:08 +0000 (12:26 +0100)]
Speedup KPK bitbase of 25%
Change the way the index is coded so that
now looping from 0 to IndexMax generates
the pawns from RANK_7 down to RANK2.
Becuase positions with pawns at RANK_7
are easily classified as wins/draws, this
small trick allows to reduce the number
of needed iterations from 30 down to 26!
No functional change.
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
Marco Costalba [Mon, 11 Feb 2013 21:59:37 +0000 (22:59 +0100)]
Simplify bitbase.cpp
Use a std::vector to store positions and
rearrange KPKPosition.
No functional change.
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
Gary Linscott [Wed, 13 Feb 2013 17:21:16 +0000 (12:21 -0500)]
Use CLOP mean value instead of max
Gary Linscott [Wed, 13 Feb 2013 17:19:54 +0000 (12:19 -0500)]
Merge branch 'simplify_eval' into bishop_pin_clop
Gary Linscott [Wed, 13 Feb 2013 05:12:02 +0000 (00:12 -0500)]
CLOP tuned
Gary Linscott [Tue, 12 Feb 2013 05:10:21 +0000 (00:10 -0500)]
Add clop parameters
Gary Linscott [Mon, 11 Feb 2013 15:26:25 +0000 (10:26 -0500)]
Merge branch 'master' into simplify_eval
Gary Linscott [Mon, 11 Feb 2013 15:26:18 +0000 (10:26 -0500)]
Bishop pins only
Marco Costalba [Sun, 10 Feb 2013 18:10:01 +0000 (19:10 +0100)]
Rename and de-templetize sort()
Rename to insertion_sort so to avoid confusion
with std::sort, also move it to movepicker.cpp
and use the bit slower std::stable_sort in
search.cpp where it is used in not performance
critical paths.
No functional change.
Marco Costalba [Sat, 9 Feb 2013 15:22:47 +0000 (16:22 +0100)]
Further simplify first_entry()
We can encode the ClusterSize directly in the
hashMask, this allows to skip the left shift.
There is no real change, but bench number is now
different because instead of using the lowest order
bits of the key to index the start of the cluster,
now we don't use the last two lsb bits that are
always set to zero (cluster size is 4). So for
instance, if 10 bits are used to index the cluster,
instead of bits [9..0] now we use bits [11..2].
This changes the positions that end up in the same
cluster affecting TT hits and so bench is different.
Also some renaming while there.
bench:
5383795
Marco Costalba [Sat, 9 Feb 2013 09:22:34 +0000 (10:22 +0100)]
Microptimize first_entry() for 32bits
Do a 32bit bitwise 'and' instead of a 64bit
subtract and bitwise 'and'.
This is possible because even in the biggest
hash table case (8GB) the number of entries
is 2^29 so storable in an unsigned int.
No functional change.
Marco Costalba [Sat, 9 Feb 2013 07:17:03 +0000 (08:17 +0100)]
Retire TTCluster and simplify TT
Also some renaming while there.
No functional change.
Marco Costalba [Sat, 9 Feb 2013 05:40:46 +0000 (06:40 +0100)]
Simplify move_to_san()
Nicely simplify disambiguation code.
No functional change.
Gary Linscott [Fri, 8 Feb 2013 13:53:13 +0000 (08:53 -0500)]
Slight tweak to king safety. Bench:
5534531
Marco Costalba [Fri, 8 Feb 2013 10:04:07 +0000 (11:04 +0100)]
Retire slavesPositions
Save the current active position in each Thread
instead of keeping a centralized array in struct
SplitPoint.
This allow to skip a memset() call at each split.
No functional change.
Marco Costalba [Fri, 8 Feb 2013 09:05:04 +0000 (10:05 +0100)]
Add const qualifer to go()
Obsolete renmant of when position was directly
passed to the search instead of being copied
for the main thread as is now.
From Jundery.
No functional change.
Marco Costalba [Fri, 8 Feb 2013 07:49:36 +0000 (08:49 +0100)]
Workaround value-initialization in MSVC
The syntax splitPoints() should force the compiler to
value-initialize the array and because there is no
user defined c'tor it falls back on zero-initialization.
Unfortunatly this is broken in MSVC compilers, because
value initialization for non-POD types is not supported,
so left splitPoints un-initialized and add in split()
initialization of slavesPositions, that is the only
member not already set at split time.
This fixes an assert under MSVC when running with
more than one thread.
Spotted and reported by Jundery.
No functional change.
Gary Linscott [Sun, 3 Feb 2013 20:42:51 +0000 (15:42 -0500)]
Add KBPKP endgame
It is a draw if pawns are on G or B files, weaker pawn is
on rank 7 and bishop can't attack the pawn.
No functional change (because it is very rare and does not appear in bench)
Marco Costalba [Wed, 6 Feb 2013 08:36:13 +0000 (09:36 +0100)]
Change slave_available() API
To return a pointer to the available
thread instead of a bool. This allows
to simplify the core loop in split().
No functional change.
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
jundery [Tue, 5 Feb 2013 17:02:54 +0000 (10:02 -0700)]
Rename posKey stored in the transposition table
[Edit: Slightly extended by me]
No functional change.
jundery [Tue, 5 Feb 2013 17:06:37 +0000 (10:06 -0700)]
Add const qualifer to check_is_dangerous
No functional change.
Marco Costalba [Tue, 5 Feb 2013 05:30:05 +0000 (06:30 +0100)]
Slightly change split() API
This function "returns" two values: bestValue and bestMove
Instead of returning one and passing as pointer the other
be consistent and pass as pointers both.
No functional change.
Marco Costalba [Mon, 4 Feb 2013 21:38:42 +0000 (22:38 +0100)]
Derive ThreadPool from std::vector
Prefer sub-classing to composition in this case.
No functional change.
Marco Costalba [Mon, 4 Feb 2013 21:09:52 +0000 (22:09 +0100)]
Move split() under Thread
Previous renaming patch suggested this reformat:
when a better naming leads to a better code!
No functional change.
Marco Costalba [Mon, 4 Feb 2013 18:48:56 +0000 (19:48 +0100)]
Some renaming in split()
Naming suggested by jundery.
No functional change.
Marco Costalba [Sun, 3 Feb 2013 10:14:21 +0000 (11:14 +0100)]
Be clear about not LMR the ttMove
Currently a ttMove is reduced with ss->reduction = DEPTH_ZERO,
so it is actually not reduced (as it should be), but the
trick works just becuase it happens that ttMove is the first
to be tried and
reduction(depth, 1)
Always returns zero. So explicitly forbid reduction of ttMove
in the LMR condition. This is much clear and self-documented.
No functional change.
Marco Costalba [Sun, 3 Feb 2013 08:52:39 +0000 (09:52 +0100)]
Templetize score_xxx() functions
So to be style-wise aligned with the corresponding
generate() functions.
No functional change.
Marco Costalba [Sun, 3 Feb 2013 08:16:44 +0000 (09:16 +0100)]
Rename prevents_move() to refutes()
Better! From DiscoCheck.
No functional change.
Marco Costalba [Sun, 3 Feb 2013 08:01:55 +0000 (09:01 +0100)]
Correctly score enpassant captures
Surprisingly this rare case was not considered
when scoring a capture.
Also take in account that in the promotion case
we gain a new piece (typically a queen) but we
lose the promoting pawn.
These small issues were present since Glaurung times!
Found while browsing DiscoCheck sources
bench:
5400063
Marco Costalba [Sat, 2 Feb 2013 16:13:33 +0000 (17:13 +0100)]
Unify History and Gains under a single Stats class
Handling of History and Gains is almost the same, with
the exception of the update logic, so unify both
classes under a single Stats struct.
No functional change.
Marco Costalba [Sat, 2 Feb 2013 15:04:41 +0000 (16:04 +0100)]
Retire history.h
And move the contents to movepick.cpp, where they are
mostly used.
Idea from DiscoCheck.
No functional change (bench
5379503 )
Gary Linscott [Sat, 2 Feb 2013 15:19:59 +0000 (10:19 -0500)]
Simplify eval take 2. Bench
5097444
Marco Costalba [Sat, 2 Feb 2013 05:44:20 +0000 (06:44 +0100)]
Restore "fail-low of reduced" and close regression
This reverts "Threat Extensions" and is the last of
this revert series.
In single-thread tests we should now be on par with 2.3.1
Marco Costalba [Sat, 2 Feb 2013 05:43:11 +0000 (06:43 +0100)]
Revert "Simplify Evaluation"
This reverts commit
496c7497cb81de4383