Search found 3783 matches

by lkaufman
Fri Jun 10, 2011 6:43 am
Forum: Computer Chess Club: General Topics
Topic: Komodo 2.01 is out!
Replies: 77
Views: 25473

Re: Komodo 2.01 is out!

So far I've played 157 bullet (1') games against Rybka 3 (1 cpu) on my non-sse4 64 bit laptop using the Fritz interface and so far no problems, Komodo is four games ahead. I'm away from home so I can't test the sse4 version myself now.
by lkaufman
Thu Jun 02, 2011 2:41 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: testing question
Replies: 26
Views: 3910

Re: testing question

[quote="bob"I am not sure how testing A against A' requires fewer games than when testing A vs B, C, D, E and F. I've not seen where the opponents matter, just the total number of games. In fact, the opposite might be the case, because when testing A vs A', the difference is typically very small, wh...
by lkaufman
Thu Jun 02, 2011 3:09 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: testing question
Replies: 26
Views: 3910

Re: testing question

Yes, gains against foreign programs are almost always less than predicted by self-testing. Furthermore we already do what you say, a mix of the two types of testing. So I guess what I really want to know is which of the two types of testing should we do mostly? It is unlikely that exactly a 50-50 di...
by lkaufman
Thu Jun 02, 2011 3:03 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: testing question
Replies: 26
Views: 3910

Re: testing question

[quoteTo me, it seems logical that self-testing is the most logical way to make your program improve against earlier versions of itself and foreign testing is the best way to make your program improve against the programs you tested it against. I remember Quark self tests that showed a big improvem...
by lkaufman
Wed Jun 01, 2011 9:37 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: testing question
Replies: 26
Views: 3910

testing question

There are basically two methods to test whether a new version of your program is strong than the previous one, which I call "self-testing". You can play a direct match between them, or you can play each against a set of unrelated programs (let's call that "foreign testing"). Self-testing is more eff...
by lkaufman
Tue Apr 19, 2011 4:40 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Move ordering by PST
Replies: 25
Views: 6694

Re: Move ordering by PST

[quote="bob" I was talking about "history information". Which can be applied to ordering, reductions, pruning, extensions, etc. Used to work until depths swiftly passed 20 plies and beyond... Then the numbers began to look more like random garbage... Correct me if I am wrong, but I don't believe th...
by lkaufman
Fri Mar 25, 2011 1:19 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: critter question
Replies: 3
Views: 1026

Re: critter question

I see. Thanks. I notice that Critter 1.0 is much stronger than Stockfish 2.0 at hyperblitz speeds though they are rated equal at normal blitz on the IPON list. Care to comment on why this is so?
by lkaufman
Thu Mar 24, 2011 9:46 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: critter question
Replies: 3
Views: 1026

critter question

Why does Critter 1.0, when set to do a one ply search (using a Fritz GUI), always report that the score is 0.01? The moves look normal enough. I've never seen this behavior from any other engine.
by lkaufman
Mon Mar 07, 2011 6:47 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: "CUT" vs "ALL" nodes
Replies: 11
Views: 4538

Re: "CUT" vs "ALL" nodes

I think Stockfish distinguishes between these types of nodes more by what is stored in the Transposition Table. If the entry is a lower limit, I think this means it was a CUT node at least when this entry was stored. Only these entries are candidates for singular extensions. I assumed that it would...
by lkaufman
Mon Mar 07, 2011 5:01 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: "CUT" vs "ALL" nodes
Replies: 11
Views: 4538

Re: "CUT" vs "ALL" nodes

Yes, the term should be "expected" or "predicted" CUT or ALL node. Most top programs do distinguish between PV and non-PV nodes; I'm only interested in the question of which ones distinguish between the two sub-categories of non-PV nodes, and whether this helps or not.