Search found 722 matches

by jwes
Sat Dec 15, 2018 10:26 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: out of time in PVS
Replies: 14
Views: 1013

Re: out of time in PVS

One usually stop the PVS search and use the result of the previous finished iterative deepening result. Remember that after you decide to stop the search you have also to stop saving killers, sving info to transposition tables and so on. One thing that has not been mentioned is that if the best mov...
by jwes
Sun Nov 04, 2018 8:22 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: LMR and sacrifices
Replies: 8
Views: 1325

LMR and sacrifices

I was wondering what methods people use in distinguishing between between sacrifices that appear to lose material but should not be reduced and bad moves which do lose material and should be reduced.
by jwes
Sun Aug 26, 2018 10:26 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On-line engine blitz tourney August
Replies: 15
Views: 2077

Re: On-line engine blitz tourney August

:Tourney Players: Round 9 of 9 : : Name Rating Score Perfrm Upset Results : ----------------- ------ ----- ------ ------ ------- : 1 +LeelaZero [1971] 13.0 [2234] [ 182] +16w +12w +04b +07b +06w =02b =03b +11w +08w : 2 -Berta [1991] 11.5 [2080] [ 56] =13w +05b =06w +12w +14b =01w =08b =03w +11b : 3...
by jwes
Mon Jun 04, 2018 1:22 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 572
Views: 90148

Re: 7-men Syzygy attempt

According to this page , the average number of probes for successful find is estimated to be http://cseweb.ucsd.edu/~kube/cls/100/Lectures/lec16/lec16-22.gif For alpha = 3002/4096, this gives 2.372. So what you measured is better than expected. For alpha = 3002/8192, we get 1.289, which is slightly...
by jwes
Wed Apr 25, 2018 7:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Saving killer moves...
Replies: 12
Views: 1601

Re: Saving killer moves...

Volker Annuss wrote:Captures can become killers in Arminius to have these capture moves searched before others.

There is one important exception. Moves that capture the last moved piece never become killers.
Do you also check if the move is still a capture?
by jwes
Mon Apr 23, 2018 5:37 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Draw scores in TT
Replies: 15
Views: 2085

Re: Draw scores in TT

How do you handle draw scores by repetition and fifty move rule in TT? I use zero as draw score, and simply prevent to load such an value from TT, i guess there are better techniques to prevent an mix up with an eval score of zero. -- Srdja edit: assuming i wish to use an 16 bit signed integer as t...
by jwes
Sun Apr 22, 2018 6:03 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Draw scores in TT
Replies: 15
Views: 2085

Re: Draw scores in TT

How do you handle draw scores by repetition and fifty move rule in TT? I use zero as draw score, and simply prevent to load such an value from TT, i guess there are better techniques to prevent an mix up with an eval score of zero. -- Srdja edit: assuming i wish to use an 16 bit signed integer as t...
by jwes
Sat Apr 07, 2018 4:44 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: 7-men Syzygy attempt
Replies: 572
Views: 90148

Re: 7-man Syzygy attempt.

They already have in production a 100 TB SSD that draws 14 watts at full tilt. https://www.cinema5d.com/nimbus-data-100tb-ssd-worlds-largest-ssd/ Since it is already possible to make it, the density is feasible. And I guess that it costs little more to make it than to make a 10 TB SSD. The fact tha...
by jwes
Thu Mar 22, 2018 1:47 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: trick question
Replies: 25
Views: 4917

Re: trick question

The trick is to use second counter. for IO, I'd use a separate thread (main thread IO, search in a separate thread for the timeout, however, I'd still use polling I use one thread for input which blocks and one thread which waits for an input line, a search result, or a timeout. The search routine ...
by jwes
Thu Mar 22, 2018 6:42 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: trick question
Replies: 25
Views: 4917

Re: trick question

The trick is to use second counter. for IO, I'd use a separate thread (main thread IO, search in a separate thread for the timeout, however, I'd still use polling I use one thread for input which blocks and one thread which waits for an input line, a search result, or a timeout. The search routine ...