Search found 127 matches

by Ronald
Fri Apr 16, 2021 8:41 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: PST-only Evaluation for MinimalChess 0.4
Replies: 19
Views: 392

Re: PST-only Evaluation for MinimalChess 0.4

Thanks for your work and for sharing it. It is quite amazing! I'm still not a believer in theory that static PSTs are superior to dynamic algorithmic created PST's, before every search. It is my current goal for my new engine to do tuning of dynamically created PSTs during search by using a portion...
by Ronald
Thu Apr 15, 2021 7:00 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: PST-only Evaluation for MinimalChess 0.4
Replies: 19
Views: 392

Re: PST-only Evaluation for MinimalChess 0.4

I guess Piece Square Tables are the minimum for creating a seriously strong chess engine. Piece values alone are not enough, because the engine will not have any clue where to put it's pieces. It's nice to see that other people are using the PeSTO tables and that some are even gain an advantage with...
by Ronald
Sat Apr 10, 2021 7:30 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: PERFT transposition table funny?!
Replies: 5
Views: 244

Re: PERFT transposition table funny?!

Using a bucket in the hashtable doesn't give you more entries, if you don't use a bucket in your case it will just get you 4 times as much entries. The advantage of using a bucket system is that you have more influence on the replacement of already used entries (although replacements will occur 4 ti...
by Ronald
Thu Feb 25, 2021 4:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Illegal moves in PV stack
Replies: 6
Views: 599

Re: Illegal moves in PV stack

if the search is stopped before the alfabeta search is finished (ss->info->stopped) you have to make sure you don't use any results of the last search. You seem to do that in alphabeta() but I don't see it in search_root(). This means that the current search results are stored in your PV and also in...
by Ronald
Thu Feb 04, 2021 6:28 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Sorting moves during move ordering
Replies: 16
Views: 2806

Re: Sorting moves during move ordering

I tested the difference a long time ago, and at that time the difference was significant, although I don't remember how much...

Testing it now is not so easy, because I calculate the historyscore on the fly and I don't have space to store the values.
by Ronald
Thu Feb 04, 2021 5:57 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Sorting moves during move ordering
Replies: 16
Views: 2806

Re: Sorting moves during move ordering

If you are using some sort of historyscore for the sorting of quiet moves, the historyscore of moves change while searching the current quiet move. If you presort the quiet moves, you don't use the changes in historyscore for the still to search quiet moves which can lead to a different order of tho...
by Ronald
Wed Feb 03, 2021 5:41 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Progress on Rustic
Replies: 243
Views: 42928

Re: Progress on Rustic

I'm gonna make me some PaSTa... I've heard it goes well with PeSTo :P In other words: let's see how far I can get with only PST's, before I get the urge to finally teach the darn thing that triple and quadruple pawns are not good. Triple and Quadruple SEEMS to be a good thing in beer, but I wouldn'...
by Ronald
Wed Feb 03, 2021 4:07 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Transposition table and multithreaded search
Replies: 7
Views: 1437

Re: Transposition table and multithreaded search

In current CPU's memory from RAM is moved in chunks of 64 bytes (a cacheline) to cache before the CPU can work with the data. This proces is very slow compared to the executiontime of instructions. Because it has taken so much time to get the 64 bytes it's much more efficient to use the full 64 byte...
by Ronald
Sat Jan 30, 2021 11:04 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Progress on Rustic
Replies: 243
Views: 42928

Re: Progress on Rustic

Congratulations :!:
by Ronald
Thu Jan 21, 2021 11:42 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Tapered Evaluation and MSE (Texel Tuning)
Replies: 220
Views: 18480

Re: Tapered Evaluation and MSE (Texel Tuning)

Does your optimizer use a Texel like method, ie changing 1 term at a time? My question is: does using different stepsizes or a different sequence of changing the terms influence the outcome of the optimization?