Search found 870 matches

by Ras
Sat Jun 08, 2019 1:38 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Is this hard ?
Replies: 13
Views: 1181

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: 2669

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: 2669

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: 2669

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: 593

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: 593

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.
by Ras
Wed Jun 05, 2019 7:06 pm
Forum: Computer Chess Club: General Topics
Topic: Finding that 'Only Move'
Replies: 9
Views: 826

Re: Finding that 'Only Move'

Nay Lin Tun wrote:
Wed Jun 05, 2019 6:31 pm
What about Rg8 by black?
Then Rh1-h7. After Rd8xd6 and Rd1xd6, White threatens to take the bishop on e6 with check. The covering pawn on f7 is pinned because of the queen on b7.
by Ras
Sun Jun 02, 2019 10:57 pm
Forum: Computer Chess Club: General Topics
Topic: Why are super top professional Go players so stupid?
Replies: 28
Views: 3724

Re: Why are super top professional Go players so stupid?

Laskos wrote:
Sun Jun 02, 2019 10:19 pm
Isn't it a bit offensive to say that I am weaker than Ke Jie?
I'll take that back the day you beat him in an over the board match without computer access. Shouldn't be a problem for you to cut through the Go world where the top professional players are so stupid, right?
by Ras
Sun Jun 02, 2019 9:17 pm
Forum: Computer Chess Club: General Topics
Topic: Why are super top professional Go players so stupid?
Replies: 28
Views: 3724

Re: Why are super top professional Go players so stupid?

Laskos wrote:
Sun Jun 02, 2019 7:47 pm
Are you implying that I am weaker than Ke Jie?
Of course, that's why you need a computer to find the blunders.

The same happened in chess: "oohhhh Stockfish is swinging form +3 to 0, he threw away his win, it's soooo obvious." Yeah, sure.
by Ras
Sun Jun 02, 2019 6:57 pm
Forum: Computer Chess Club: General Topics
Topic: Why are super top professional Go players so stupid?
Replies: 28
Views: 3724

Re: Why are super top professional Go players so stupid?

Why are super top professional Go players so stupid? Because it's much more difficult to find the right moves over the board. In chess, it's been for a long time that every patzer can start up Stockfish and, lo and behold, find much better moves than the champions played in the actual match. The on...