Search found 864 matches

by Ras
Sun Jun 16, 2019 10:04 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI2WB 4.0
Replies: 67
Views: 3858

Re: UCI2WB 4.0

I also don't like the lowering of engine priorities to be applied to the adapter, but I don't know how it can be applied by the GUI to the engine without applying it to the adapter first. Is it the adaptor that actually launches the engine process for UCI engines? If so, you could start the adaptor...
by Ras
Sun Jun 16, 2019 8:47 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Explanation of the Cute Chess message 'connection stalls'
Replies: 15
Views: 391

Re: Explanation of the Cute Chess message 'connection stalls'

When I look at alouette.pas, the parser for the "go" command is not really implementing the UCI spec. The order of arguments is not specified, but you rely on it in utils.pas. Also, the case where wtime, btime, winc, binc AND movestogo is given seems to be missing. I'd suggest that you do a WordPres...
by Ras
Fri Jun 14, 2019 1:30 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: UCI2WB 4.0
Replies: 67
Views: 3858

Re: UCI2WB 4.0

Perhaps it floods WinBoard with unintended output which overruns some buffer. A function like this (from UCI2WB) looks like a buffer overflow waiting to happen: int ReadLine (FILE *f, char *line) { int x, i = 0; while((x = fgetc(f)) != EOF && (line[i] = x) != '\n') i++; line[++i] = 0; return (x != ...
by Ras
Mon Jun 10, 2019 11:16 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hash collision?
Replies: 42
Views: 1418

Re: Hash collision?

The total size of the table only comes in when the the table only gets partly filled. Yeah I have to agree. In that case, my objection was wrong. (you tacitly assume that by taking it for granted that a key length of 64 bits is enough to have no key collisions) That's an unrelated issue for the pro...
by Ras
Sat Jun 08, 2019 1:38 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Is this hard ?
Replies: 12
Views: 427

Re: Is this hard ?

My engine has this: 2/04 0:00 +4.78 1.g6 Rg1+ 2.Kf5 Rg3 (908) 4 TB:4 3/04 0:00 +4.79 1.g6 Kd6 2.h5 Kd5 (1.552) 7 TB:10 4/07 0:00 +4.84 1.g6 Rg1+ 2.Kf5 Rh1 3.g7 Rf1+ 4.Kg6 (5.136) 23 TB:22 5/07 0:00 +4.46 1.g6 Rg1+ 2.Kf4 Rxg6 3.f8Q+ Kxf8 4.Bxg6 (15.311) 69 TB:62 6/07 0:00 +4.46 1.g6 Rg1+ 2.Kf4 Rxg6 3...
by Ras
Sat Jun 08, 2019 1:35 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hash collision?
Replies: 42
Views: 1418

Re: Hash collision?

Take the other extreme: A hash table that stores a single entry. Yeah then you would need to store the full 64 bit signature. Basically, the information stored is the length of the signature plus the implicit index bits minus the bucket length bits. Of course, you have to store bits that are not al...
by Ras
Sat Jun 08, 2019 1:19 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hash collision?
Replies: 42
Views: 1418

Re: Hash collision?

The total size of the table has no influence on any of this. I don't agree. Imagine you had enough memory for a table with 2^64 entries, then you wouldn't need to store a signature at all because the full signature itself is only 64 bit (usually) so that the signature would be identical to the inde...
by Ras
Fri Jun 07, 2019 5:35 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hash collision?
Replies: 42
Views: 1418

Re: Hash collision?

Bob Hyatt has already done the research on the required hash length many years ago. The result was that 32 bit are not sufficient, 64 bit are, and you can even get away with 48 bit. Obviously, you also have the implicit storage via the hash table index, minus the bits for your number of slots. You c...
by Ras
Fri Jun 07, 2019 12:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: correct way to score promotions using MVV-LVA
Replies: 6
Views: 321

Re: correct way to score promotions using MVV-LVA

Dann Corbit wrote:
Thu Jun 06, 2019 10:37 pm
Including underpromotion to knight?
Yes, it's not worth the effort in QS. In main search however, underpromotions should be searched.
by Ras
Thu Jun 06, 2019 6:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: correct way to score promotions using MVV-LVA
Replies: 6
Views: 321

Re: correct way to score promotions using MVV-LVA

MahmoudUthman wrote:
Thu Jun 06, 2019 4:28 pm
do you use different schemes in the main search than in Qsearch ?
You can drop underpromotion from quiescence.