]>
git.sesse.net Git - stockfish/log
Marco Costalba [Sat, 13 Jul 2013 11:27:22 +0000 (13:27 +0200)]
A useless assignment found by Clang’s static analyzer
Warning is: "Value stored to 'xxx' is never read" and
it is raised in SpNode case.
No functional change.
Marco Costalba [Sat, 13 Jul 2013 11:02:40 +0000 (13:02 +0200)]
Fix build with MSVC 2013
Also add an assert hinted by MSVC code analysis tool.
No functional change.
Marco Costalba [Sat, 13 Jul 2013 05:43:50 +0000 (07:43 +0200)]
Fix printing of PV info: take 2
Now last PV line is printed twice, fix that.
No functional change.
Marco Costalba [Fri, 12 Jul 2013 21:42:42 +0000 (23:42 +0200)]
Fix printing of PV info
It was erroneusly skipped after the
aspiration window rework.
Reported by Eelco.
No functional change.
Marco Costalba [Thu, 11 Jul 2013 14:01:33 +0000 (16:01 +0200)]
Rename some UCI options
Thanks to Don, Miguel, Louis and the other people
of talkchess forum for the suggestion:
http://www.talkchess.com/forum/viewtopic.php?t=48612
Also sync polyglot.ini with current UCI options
No functional change.
Marco Costalba [Thu, 11 Jul 2013 05:22:26 +0000 (07:22 +0200)]
Fix a crash with depth 1 perft
Bug recently introduced in
e215a88cddd16e09
No functional change.
Marco Costalba [Sun, 7 Jul 2013 11:45:46 +0000 (13:45 +0200)]
Don't IID when in check also in PvNodes
This tiny functional change allows to
nicely simplify things.
Performed at 50% in short TC:
LLR: -0.43 (-2.94,2.94)
Total: 46406 W: 9681 L: 9565 D: 27160
And succesfully passed long TC reverse test:
LLR: -2.95 (-2.94,2.94)
Total: 4945 W: 858 L: 937 D: 3150
bench:
4507230
Marco Costalba [Tue, 9 Jul 2013 06:01:51 +0000 (08:01 +0200)]
Revert previous patch
Unfortunatly a reverse test at long TC failed:
master^ vs master
LLR: 1.37 (-2.94,2.94)
Total: 33682 W: 6294 L: 6071 D: 21317
So becuase short TC score is 50% there is a good
possibility patch is not scalable.
So revert it.
bench:
4507288
Marco Costalba [Mon, 8 Jul 2013 05:23:30 +0000 (07:23 +0200)]
Simplify "fail high upon reduction" in null search
Do not use threat move to detect the condition. This
let us to retire the big allows() function.
Test at short TC was within 50% score:
LLR: -2.95 (-2.94,2.94)
Total: 38272 W: 7941 L: 7940 D: 22391
To be verified with reverse long TC
bench:
4191565
Marco Costalba [Sun, 7 Jul 2013 11:27:31 +0000 (13:27 +0200)]
Skip node-level cut-off tests when in check
No functional change.
Marco Costalba [Wed, 3 Jul 2013 16:58:49 +0000 (18:58 +0200)]
Simplify aspiration window code
Here the main difference is that now we center
aspiration window on last returned score. This allows
to simplify handling of mate scores.
We have done a reversed SPRT tests, where we wanted to
verify if master is stronger than this patch.
Long TC: master vs this patch (reverse test)
LLR: -2.95 (-2.94,2.94)
Total: 37992 W: 7012 L: 6920 D: 24060
bench:
4507288
Marco Costalba [Wed, 3 Jul 2013 16:58:23 +0000 (18:58 +0200)]
Workaround github issue
Temporary revert aspiration window patch
so to be visible to everybody: it will be
re-applied with next patch
No functional change (together with next one)
Marco Costalba [Wed, 3 Jul 2013 06:54:44 +0000 (08:54 +0200)]
Simplify aspiration window code
Here the main difference is that now we center
aspiration window on last returned score. This allows
to simplify handling of mate scores.
We have done a reversed SPRT tests, where we wanted to
verify if master is stronger than this patch.
Long TC: master vs this patch (reverse test)
LLR: -2.95 (-2.94,2.94)
Total: 37992 W: 7012 L: 6920 D: 24060
bench:
4507288
Marco Costalba [Wed, 3 Jul 2013 06:21:21 +0000 (08:21 +0200)]
Disable flto when debugging
Link-time optimization does not work well with
generation of debugging information:
http://gcc.gnu.org/onlinedocs/gcc/Optimize-Options.html
Reported by Louis Zulli
No functional change.
Marco Costalba [Tue, 2 Jul 2013 18:06:24 +0000 (20:06 +0200)]
Revert "Remove confusing optimization"
This reverts commit
e05c80a08859f6c4f0f599ca0b262ced00ad66fe .
we gain a speed up of 1.5% under gcc !
No functional change.
Marco Costalba [Tue, 2 Jul 2013 05:25:47 +0000 (07:25 +0200)]
Merge branch 'master' into aspiration
bench:
4507288
Marco Costalba [Tue, 2 Jul 2013 05:25:39 +0000 (07:25 +0200)]
Revert "Increase earlier aspiration window size"
This reverts commit
b88bc7b7667fc6ddbfc7412fb2c0bfc13e3bf11c .
Marco Costalba [Tue, 2 Jul 2013 05:24:17 +0000 (07:24 +0200)]
Entering a pawn endgame is no more dangerous
A simplification of the 'dangerous' definition.
Seems neutral at reverse test at long TC
master vs patch
LLR: -2.96 (-2.94,2.94)
Total: 16974 W: 3122 L: 3139 D: 10713
bench:
4689029
Marco Costalba [Mon, 1 Jul 2013 17:29:23 +0000 (19:29 +0200)]
Increase earlier aspiration window size
bench:
4377851
Marco Costalba [Mon, 1 Jul 2013 17:25:23 +0000 (19:25 +0200)]
Merge branch 'master' into aspiration
Marco Costalba [Sun, 30 Jun 2013 11:12:04 +0000 (13:12 +0200)]
Fix a stale comment
No functional change.
Marco Costalba [Sun, 30 Jun 2013 10:30:57 +0000 (12:30 +0200)]
Simplify search results update
Also some rename while there.
No functional change.
Marco Costalba [Sun, 30 Jun 2013 09:35:03 +0000 (11:35 +0200)]
Reorder conditions according to their frequency
This should minimize useless tests.
No functional change.
Marco Costalba [Sun, 30 Jun 2013 09:00:19 +0000 (11:00 +0200)]
Center aspiration window on last returned score
bench:
4428212
Marco Costalba [Sun, 30 Jun 2013 08:32:09 +0000 (10:32 +0200)]
Simplify aspiration window loop
Don't open the window in case we find a mate score: this
will be takes care with next patch.
No functional change.
Marco Costalba [Sat, 29 Jun 2013 08:23:43 +0000 (10:23 +0200)]
Use calloc() in TranspositionTable::set_size()
Function calloc() already initializes memory to
zero, so avoid calling clear() afterwards.
Also some renaming while there (inspired by DiscoCheck).
No functional change.
Marco Costalba [Sun, 23 Jun 2013 11:19:03 +0000 (13:19 +0200)]
Fix some stale comments
No functional change.
Marco Costalba [Sun, 23 Jun 2013 11:08:10 +0000 (13:08 +0200)]
Move SquareDistance[] to bitboard.cpp
No functional change.
Marco Costalba [Sun, 23 Jun 2013 09:15:58 +0000 (11:15 +0200)]
Don't explicitize enum values when not needed
Compiler will chose the correct values in sequential
order for you.
Also move file and rank bitboards definitions to
bitboard.h
No functional change.
Marco Costalba [Sun, 23 Jun 2013 08:16:43 +0000 (10:16 +0200)]
Retire in_front_bb(Color c, Square s) overload
Explciitly call rank_of() in the few places where
it is used.
No functional change.
Marco Costalba [Sun, 23 Jun 2013 08:03:48 +0000 (10:03 +0200)]
Retire ThisAndAdjacentFilesBB[]
It is unused. Also renamed attack_span_mask to
pawn_attack_span
No functional change.
Marco Costalba [Sun, 23 Jun 2013 06:08:16 +0000 (08:08 +0200)]
Simplify hidden_checkers()
De-templetize and pass color as function argument.
No speed change.
No functional change.
Marco Costalba [Sat, 22 Jun 2013 10:45:14 +0000 (12:45 +0200)]
Name functions along corresponding UCI commands
No functional change.
Marco Costalba [Fri, 21 Jun 2013 07:10:03 +0000 (09:10 +0200)]
Micro-optimize perft
Avoid to call perft function when we just need to count
moves, at leaf nodes.
Speed up of almost 2%
No functional change.
Ryan Schmitt [Mon, 17 Jun 2013 16:55:00 +0000 (18:55 +0200)]
Include file attacks in 'major on pawn'
Passed both short TC:
LLR: 2.97 (-2.94,2.94)
Total: 57846 W: 12248 L: 11974 D: 33624
And long one:
LLR: 2.95 (-2.94,2.94)
Total: 9181 W: 1732 L: 1581 D: 5868
bench:
4609948
Reuven Peleg [Mon, 17 Jun 2013 10:49:11 +0000 (13:49 +0300)]
Remove confusing optimization
Here we skip the call to pos.attacks_from<ROOK>(s) in the 98%
of cases, testing the first 2 members first. Unfortunatly
code is a bit triky and not clear. So we give up to the
speed optimization in exchange of more code clarity.
No functional change.
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
Reuven Peleg [Mon, 17 Jun 2013 08:54:55 +0000 (11:54 +0300)]
Merge some if statements in pos_is_ok()
No functional change.
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
Marco Costalba [Mon, 17 Jun 2013 07:30:59 +0000 (09:30 +0200)]
Remove redundant condition in probcut
When !ss->skipNullMove it is assured that excludedMove == MOVE_NONE
No functional change.
Marco Costalba [Sun, 16 Jun 2013 09:59:40 +0000 (11:59 +0200)]
Rename piece_count and piece_list
No functional change.
Marco Costalba [Sun, 16 Jun 2013 08:51:17 +0000 (10:51 +0200)]
Don't calculate pawnsOnSquares twice
And reformat some code while there.
No functional change.
Marco Costalba [Sun, 16 Jun 2013 08:08:44 +0000 (10:08 +0200)]
Use move_pawns() in Pawns::probe
And rename some stuff.
No functional change.
Marco Costalba [Fri, 14 Jun 2013 06:24:37 +0000 (08:24 +0200)]
Revert "Reduce more CUT nodes only if parent node is reduced"
This reverts commit
d54e8a59551a7ebcbf2c2155dce46c7386b1742a .
It was not proved with SPRT this tweak is stronger. So revert it
for now to follow fishtest guidelines.
bench:
5108393
Marco Costalba [Fri, 14 Jun 2013 06:20:13 +0000 (08:20 +0200)]
Fix description of TT entry
It was way outdated and wrong !
No functional change.
Marco Costalba [Thu, 13 Jun 2013 17:53:14 +0000 (19:53 +0200)]
Reduce more CUT nodes only if parent node is reduced
So when we are doing a LMR search at the parent ALL node.
This patch didn't prove stronger at 60" TC
LLR: -2.97 (-2.94,2.94)
Total: 22398 W: 4070 L: 4060 D: 14268
But, first, it scores at 50%, second (and most important for me) the opposite,
i.e. normal reduction when parent node is not reduced, seems very bad:
LLR: -2.95 (-2.94,2.94)
Total: 7036 W: 1446 L: 1534 D: 4056
According to Don, this idea of increased reduction of CUT nodes
works because if parent node is reduced, missing a cut-off due to
reduced depth search (meaning position is somehow tricky) forces
a full depth research at parent node, giving due insight in this
set of sensible positions.
IOW if we expect a node to fail-high at depth n, then we assume it
should fail-high also at depth n-1, if this doesn't happen it means
position is tricky enough to deserve a research at depth n+1.
bench:
4687419
Marco Costalba [Thu, 13 Jun 2013 17:50:32 +0000 (19:50 +0200)]
Reduce more CUT nodes
We got a good result from this tweak, in line with
what was already found by Don Dailey.
At short TC:
LLR: 2.95 (-2.94,2.94)
Total: 13097 W: 2742 L: 2598 D: 7757
At long TC:
LLR: 2.97 (-2.94,2.94)
Total: 7281 W: 1408 L: 1265 D: 4608
bench:
5108393
Marco Costalba [Sun, 9 Jun 2013 07:43:04 +0000 (09:43 +0200)]
Introduce Cut/All node definitions
Follow Don Dailey definition of cut/all node:
"If the previous node was a cut node, we consider this an ALL node.
The only exception is for PV nodes which are a special case of ALL nodes.
In the PVS framework, the first zero width window searched from a PV
node is by our definition a CUT node and if you have to do a re-search
then it is suddenly promoted to a PV nodes (as per PVS search) and only
then can the cut and all nodes swap positions. In other words, these
internal search failures can force the status of every node in the subtree
to swap if it propagates back to the last PV nodes."
http://talkchess.com/forum/viewtopic.php?topic_view=threads&p=519741&t=47577
With this definition we have an hit rate higher than 90% on:
if (!PvNode && depth > 4 * ONE_PLY)
dbg_hit_on_c(cutNode, (bestValue >= beta));
And an hit rate of just 28% on:
if (!PvNode && depth > 4 * ONE_PLY)
dbg_hit_on_c(!cutNode, (bestValue >= beta));
No functional change.
Marco Costalba [Thu, 13 Jun 2013 05:42:43 +0000 (07:42 +0200)]
Don't use std::vector::data()
It is a C++11 only function.
Reported by Eelco.
No functional change.
Marco Costalba [Sun, 9 Jun 2013 21:32:12 +0000 (23:32 +0200)]
Fix again early stop ss pointer
Fix was wrong becuase search starts from ss+1,
code is a bit tricky here, so rewrite in a way
to be more easy to read and understand.
Spotted by Eelco.
No functional change.
Marco Costalba [Sun, 9 Jun 2013 21:24:36 +0000 (23:24 +0200)]
Don't need to expose namespace Zobrist
It can be local to position.cpp
No functional change.
Marco Costalba [Sun, 9 Jun 2013 11:43:30 +0000 (13:43 +0200)]
Zobrist::init() should be Position::init()
No functional change.
Marco Costalba [Sun, 9 Jun 2013 11:05:41 +0000 (13:05 +0200)]
Convert pieceSquareTable to 3 dimensions
No functional change.
Marco Costalba [Sun, 9 Jun 2013 10:56:05 +0000 (12:56 +0200)]
More consistent 'piece' variable naming
No functional change.
Marco Costalba [Sun, 9 Jun 2013 10:43:12 +0000 (12:43 +0200)]
Introduce operator~(Piece c)
Small syntactic sugar to reverse piece color.
No functional change.
Marco Costalba [Sun, 9 Jun 2013 10:24:43 +0000 (12:24 +0200)]
Retire psq_delta()
No functional change.
Marco Costalba [Sun, 9 Jun 2013 09:52:39 +0000 (11:52 +0200)]
Use alpha instead of beta-1
It is more directly related to a fail-low.
No functional change.
Marco Costalba [Sun, 9 Jun 2013 08:58:24 +0000 (10:58 +0200)]
Fix incorrect 'ss' pointer in early stop check
The exclusion search used to verify one move is much
better than other shall be called with 'ss' and not
'ss+1'
No functional change.
Dariusz Orzechowski [Tue, 4 Jun 2013 21:52:00 +0000 (23:52 +0200)]
Fix a typo
No functional change.
Marco Costalba [Sat, 8 Jun 2013 08:35:35 +0000 (10:35 +0200)]
Fix search log when using skills
In case of we pick a sub-optimal move be
sure to print this, and not the best one
on seach log file.
Bug spotted by Guenther Demetz.
No functional change.
Marco Costalba [Sat, 1 Jun 2013 13:45:46 +0000 (15:45 +0200)]
Fix a crash when 'go' multiple times
Search is started after setting a position and
issuing UCI 'go' command. Then if we stop the search
and call 'go' again without setting a new position it
is assumed that the previous setup is preserved, but
this is not the case because what happens is that
SetupStates is reset to NULL, leading to a crash as
soon as RootPos.is_draw() is called because st->previous
is now stale.
UCI protocol is not very clear about requiring that a
position is setup always before launching a search,
so here we easy the life of GUI developers assuming
that the current state is preserved after returning
from a 'stop' command.
Bug reported by Gregor Cramer.
No functional change.
Marco Costalba [Sat, 1 Jun 2013 09:48:38 +0000 (11:48 +0200)]
Assorted renaming in evaluation
And some reshuffle too.
No functional change.
jundery [Thu, 30 May 2013 03:07:24 +0000 (21:07 -0600)]
Passed pawn tuning
A small number of tests with simulated
annealing at 15s indicated these values
may be better
And this is verified at long 60+0.05 TC
LLR: 2.95 (-2.94,2.94)
Total: 40658 W: 7821 L: 7501 D: 25336
bench:
4931544
Marco Costalba [Mon, 27 May 2013 15:42:52 +0000 (17:42 +0200)]
Shrink engine UCI name
Some GUI have problems with long names.
Reported by George Speight.
No functional change.
Marco Costalba [Sat, 25 May 2013 11:14:41 +0000 (13:14 +0200)]
Add Pawn Structure also to polyglot.ini
No functional change.
Marco Costalba [Sat, 25 May 2013 10:18:58 +0000 (12:18 +0200)]
Re-add "Pawn Structure" UCI option
And reshuffle the code to not special case
this parameter.
No functional change.
Marco Costalba [Sat, 25 May 2013 09:57:18 +0000 (11:57 +0200)]
More uniform tracing code
No functional change.
Uri Blass [Tue, 21 May 2013 22:58:52 +0000 (01:58 +0300)]
Bunch of 3 small patches
This patch is the sum of:
- Grainsize of 4 instead of 8
- Removing "depth < DEPTH_ZERO"
- Change DEPTH_QS_RECAPTURES = -5 to -7
All the patches individually failed to pass SPRT but scored
around 50%.
Together they pass easily short TC:
LLR: 2.96 (-2.94,2.94)
Total: 4429 W: 964 L: 844 D: 2621
And with some difficult long TC of 60+0.05:
LLR: 2.95 (-2.94,2.94)
Total: 64133 W: 11968 L: 11532 D: 40633
bench:
4821467
Marco Costalba [Sun, 19 May 2013 20:00:49 +0000 (22:00 +0200)]
Microptimize MoveList loop
Add MOVE_NONE at the tail, this allows to loop
across MoveList checking for *it != MOVE_NONE,
and because *it is used imediately after compiler
is able to reuse it.
With this small patch perft speed increased of 3%
And it is also a semplification !
No functional change.
Marco Costalba [Sat, 18 May 2013 10:49:31 +0000 (12:49 +0200)]
Delay killers[] initialization
Most of the time we cut-off earlier, at captures, so this
results in useless work.
There is a small functionality change becuase 'ss' can change
from MovePicker c'tor to when killers are tried due, for
instance, to singular search.
bench:
4603795
Marco Costalba [Sun, 19 May 2013 19:32:52 +0000 (21:32 +0200)]
Reduce countermoves less in LMR
Passed SPRT for both short TC 15+0.05:
LLR: 2.95 (-2.94,2.94)
Total: 17724 W: 3756 L: 3598 D: 10370
And long TC 60+0.05:
LLR: 2.95 (-2.94,2.94)
Total: 22672 W: 4232 L: 4011 D: 14429
bench:
4418832
Marco Costalba [Sun, 19 May 2013 11:28:25 +0000 (13:28 +0200)]
Mimic an iterator for looping across MoveList
Seems more conventional.
No functional change.
Joona Kiiski [Wed, 15 May 2013 19:31:45 +0000 (20:31 +0100)]
Use two counter moves instead of one
Very good at long 60"+0.05 TC
LLR: 2.95 (-2.94,2.94)
Total: 5954 W: 1151 L: 1016 D: 3787
[edit: slightly changed form original patch to avoid useless loop
across killers when killer is MOVE_NONE]
bench:
4327405
Marco Costalba [Wed, 15 May 2013 18:35:54 +0000 (20:35 +0200)]
Rename Refutation to Countermove
Use proper naming according to:
http://chessprogramming.wikispaces.com/Countermove+Heuristic
The name of this idea is "Countermove Heuristic" and was
first introduced by Jos Uiterwijk in 1992
No functional change.
Uri Blass [Tue, 14 May 2013 22:19:51 +0000 (23:19 +0100)]
Increased mobility array
Performed more or less well at short TC
LLR: 2.95 (-2.94,2.94)
Total: 50517 W: 9815 L: 9574 D: 31128
And a bit better at long TC
LLR: 2.96 (-2.94,2.94)
Total: 15564 W: 2805 L: 2624 D: 10135
bench:
4375253
Marco Costalba [Tue, 14 May 2013 22:06:11 +0000 (00:06 +0200)]
Revert trapped rook bug fix
It seems that do not limiting checking the
trapped rook only on rank 1 improves the
score.
At long TC
LLR: 2.97 (-2.94,2.94)
Total: 6581 W: 1346 L: 1204 D: 4031
bench:
4985012
Gary Linscott [Mon, 13 May 2013 19:04:18 +0000 (12:04 -0700)]
Minor bugfixes to refutation table
Don't update refutation table in case of
previous move is MOVE_NULL or MOVE_NONE
and don't try refutation if is already
a killer move.
Pass both short TC
LLR: 2.96 (-2.94,2.94)
Total: 4310 W: 953 L: 869 D: 2488
And long one
LLR: 2.95 (-2.94,2.94)
Total: 6707 W: 1254 L: 1184 D: 4269
bench:
4785954
Marco Costalba [Mon, 13 May 2013 18:07:10 +0000 (20:07 +0200)]
Reformat previous patch
No functional change.
Joona Kiiski [Sun, 12 May 2013 20:23:29 +0000 (21:23 +0100)]
Enable refuation table
Very good result both at short TC 15+0.05
LLR: 2.95 (-2.94,2.94)
Total: 2803 W: 596 L: 483 D: 1724
And at long TC 60+0.05
LLR: 2.95 (-2.94,2.94)
Total: 2862 W: 548 L: 431 D: 1883
bench:
4329221
Joona Kiiski [Sun, 12 May 2013 20:21:46 +0000 (21:21 +0100)]
Simple always overwrite Refutation table
Marco Costalba [Sat, 11 May 2013 09:32:34 +0000 (11:32 +0200)]
Use Them instead of ~Us
Unortunatly we have no guarantee that the call to
operator~(Color c) is resolved at compile time.
Perhaps the solution would be to use C++11 const_expr,
but for now simply use the good old-style ternary operator
that works as expected.
No functional change.
Marco Costalba [Sat, 11 May 2013 07:29:02 +0000 (09:29 +0200)]
Some code reformat in evaluate_pieces
No functional change.
Marco Costalba [Wed, 8 May 2013 21:06:21 +0000 (23:06 +0200)]
Simplify previous patch
No functional change.
Marco Costalba [Wed, 8 May 2013 21:02:08 +0000 (23:02 +0200)]
Merge 'passed_pawns' tweaks
Good at both short and long TC
15+0.05
LLR: 2.96 (-2.94,2.94)
Total: 28220 W: 5531 L: 5349 D: 17340
TC 60+0.05
LLR: 2.95 (-2.94,2.94)
Total: 12612 W: 2221 L: 2057 D: 8334
bench:
4857939
Reuven Peleg [Sun, 5 May 2013 19:39:06 +0000 (22:39 +0300)]
Avoid explicit bitwise operators
No functional change.
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
jundery [Sun, 5 May 2013 17:12:04 +0000 (11:12 -0600)]
Passed pawn eval
Use a stepped function to evaluate bonuses and add the bonus to the
middle game
bench:
4857939
Marco Costalba [Sun, 5 May 2013 11:43:26 +0000 (13:43 +0200)]
Merge increased 'movecount' pruning
Good at both short and long TC
15+0.05
LLR: 2.95 (-2.94,2.94)
Total: 13814 W: 2731 L: 2588 D: 8495
TC 60+0.05
LLR: 2.95 (-2.94,2.94)
Total: 18013 W: 3136 L: 2946 D: 11931
bench:
4306557
Marco Costalba [Sat, 4 May 2013 10:27:19 +0000 (12:27 +0200)]
Simplify previous condition
No functional change.
Marco Costalba [Sat, 4 May 2013 10:18:18 +0000 (12:18 +0200)]
Fix trapped rook condition
A rook is trapped if on rank 1 as is the king.
Currently the condition aloows for the rook
to be also in front of the pawns as long
as king is on first rank.
Verified with short TC test:
LLR: -1.71 (-2.94,2.94)
Total: 23234 W: 4317 L: 4317 D: 14600
Here what it counts is that after 23K games
result is equal.
bench:
4696542
Marco Costalba [Sat, 4 May 2013 09:42:34 +0000 (11:42 +0200)]
Further simplify previous patch
No functional change.
homoSapiensSapiens [Fri, 3 May 2013 11:01:41 +0000 (14:01 +0300)]
Merge some conditions
No functional change.
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
Marco Costalba [Fri, 3 May 2013 13:21:23 +0000 (15:21 +0200)]
Drop some redundant defined(_WIN64)
When it is already defined(_WIN32).
According to Microsoft documentation:
http://msdn.microsoft.com/en-us/library/b0084kay.aspx
_WIN32 Defined for applications for Win32 and Win64. Always defined.
_WIN64 Defined for applications for Win64.
Patch suggested by Joona.
No functional change.
Marco Costalba [Fri, 3 May 2013 08:25:25 +0000 (10:25 +0200)]
Print time and node count before search ends
This info is normally printed together with
PV info in uci_pv() but when search is stopped,
for instance when max search time is reached,
uci_pv is not called and we miss this bits.
Suggested by gravy_train
No functional change.
Marco Costalba [Fri, 3 May 2013 08:10:08 +0000 (10:10 +0200)]
Merge mobility area tweak
A nice improvment.
Was good at 15+0.05
LLR: 2.96 (-2.94,2.94)
Total: 10731 W: 2176 L: 2040 D: 6515
And at 60"+0.05
LLR: 2.96 (-2.94,2.94)
Total: 10601 W: 1968 L: 1810 D: 6823
bench:
4676606
Gary Linscott [Thu, 2 May 2013 18:37:55 +0000 (14:37 -0400)]
Fix rounding issue
Gary Linscott [Thu, 2 May 2013 13:47:34 +0000 (09:47 -0400)]
More aggressive move count pruning
Marco Costalba [Thu, 2 May 2013 07:35:52 +0000 (09:35 +0200)]
Another take at TT alignment
This time revert to original version but using
uintptr_t instead of size_t
Suggested by Lucas.
No functional change.
Marco Costalba [Wed, 1 May 2013 20:55:23 +0000 (22:55 +0200)]
Re-add "Cache line aligned TT"
But this time do not play with pointers, in
particular do not assume that size_t is an
unsigned type of the same width as pointers.
This code should be fully portable.
No functional change.
jhellis3 [Wed, 1 May 2013 07:37:50 +0000 (02:37 -0500)]
Tweak Mobility Area
Only consider pawns and the king as restricting.
Marco Costalba [Tue, 30 Apr 2013 18:00:05 +0000 (20:00 +0200)]
Restore development version
No functional change.
Marco Costalba [Sun, 28 Apr 2013 22:59:57 +0000 (00:59 +0200)]
Stockfish 3
Stockfish bench signature is:
4176431
Marco Costalba [Tue, 30 Apr 2013 06:08:54 +0000 (08:08 +0200)]
Revert "Cache line aligned TT"
This reverts commit
083fe5812485597e13943b690cc24a8f25c0d140
It seems to break Android build
No functional change.