Search found 17072 matches

by bob
Tue Oct 06, 2020 12:39 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Performance loss when removing unused function
Replies: 11
Views: 1192

Re: Performance loss when removing unused function

You might check out your compilers many alignment optimization options...
by bob
Sun Jul 19, 2020 2:57 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Data structure choice for TT
Replies: 35
Views: 12718

Re: Data structure choice for TT

This is a bit confusing using normal terminology. "age" refers to the search that an entry is stored. IE it advances once for each real move played on the board. The idea is to let you recognize entries that come from the previous search (which might be great for the current search or completely use...
by bob
Sun Jul 19, 2020 2:46 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Mind your language
Replies: 16
Views: 3886

Re: Mind your language

In 1969/1970 PL/1 was "the up and coming language" with bits of Algol, FORTRAN and COBOL included. And then in the 80's it was ADA. There is always going to be the next great language that turns out to be "not so great". C is 50 years old. That much history can't be completely wrong.
by bob
Sun Jul 12, 2020 1:34 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Idea for ID/transposition table
Replies: 7
Views: 2132

Re: Idea for ID/transposition table

Probably would work, but you won't have a PV for the best move at that point. Would be sort of an odd circumstance as to how this might happen, however. There's a moderately good chance that the PV can be recreated by following the stored best move from the hash for as far as it goes, which optimal...
by bob
Sat Jul 11, 2020 2:53 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Idea for ID/transposition table
Replies: 7
Views: 2132

Re: Idea for ID/transposition table

Probably would work, but you won't have a PV for the best move at that point.

Would be sort of an odd circumstance as to how this might happen, however.
by bob
Mon Jun 29, 2020 3:51 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Simplifying code
Replies: 118
Views: 49970

Re: Simplifying code

Yes looks better. But I saw a video about monads recently. Although i am not sure I understand it. Don't know anything about category theory. So maybe I could use something like a monad to hide some obvious recurring tests. Monad is a functor plus a flatten operation I understood. Already unfamilia...
by bob
Mon Jun 29, 2020 3:46 am
Forum: Computer Chess Club: General Topics
Topic: TCEC Question
Replies: 46
Views: 4681

Re: TCEC Question

One more point. More games == smaller standard deviation. Which means the samples will be closer to the middle value. If you run an infinite number of samples, you will end up exactly on the midpoint. 1000 games has a pretty high standard deviation. 100 significantly larger. 1 game? pretty much a ra...
by bob
Tue Jun 23, 2020 6:53 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Syzygy 6 dtz problem
Replies: 3
Views: 1733

Re: Syzygy 6 dtz problem

I put 'em all in the same directory. On linux you could scatter them all over and use symbolic links. In looking at the distributed syzygy code, you can pass tb_init a string of directories separated by ":" (colon) if you want to scatter files in different directories or on different drives...
by bob
Sat Jun 20, 2020 9:16 pm
Forum: Computer Chess Club: General Topics
Topic: Auto Brute Force
Replies: 10
Views: 1821

Re: Auto Brute Force

As a note you might get a sequence of moves that will lead to that position, but you will never get "the" series that was actually played...
by bob
Fri Jun 19, 2020 2:03 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Perft speed and depth questions
Replies: 43
Views: 9787

Re: Perft speed and depth questions

minor addition... each "bucket needs to have the low order 6 bits of the address as 000000, which makes each bucket lie on an address that starts a 64 bit block of memory that gets read in in one cache fill cycle. If it spans a 64 bit address break, it will take two cache fill cycles which is bad fo...