Search found 865 matches

by AlvaroBegue
Wed Jul 11, 2018 9:30 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: statistic magicians help required
Replies: 2
Views: 389

Re: statistic magicians help required

First of all, I think they report 1.96 standard deviations, not 2. But that's small potatoes. You haven't been precise enough in describing the two-tournaments scenario. If you do two tournaments between the same two engines and you obtain Elo estimates with means Elo1, Elo2 and corresponding standa...
by AlvaroBegue
Wed Jul 11, 2018 5:40 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Testing a set of engines
Replies: 3
Views: 514

Re: Testing a set of engines

If you look at the CCRL table that lists engines in decreasing order of strength, you'll see a column "LOS". That is something like one minus the p-value of the hypothesis that the engine in one line is actually stronger than the one below. Running more games allows you to make those numbers closer ...
by AlvaroBegue
Tue Jun 26, 2018 5:44 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Hoziron effect and extensions
Replies: 9
Views: 1021

Re: Hoziron effect and extensions

In my experience, it is important to be restrictive in the definition of recapture. My code currently does something like this: bool extend = false; // Extend checks if (!extend && in_check) extend = true; // Extend recaptures if (!extend && last_two_moves_had_the_same_destination_square() && last_t...
by AlvaroBegue
Thu Jun 21, 2018 1:48 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: What am I missing with respect to MTDf
Replies: 6
Views: 1062

Re: What am I missing with respect to MTDf

Disclaimer: I have never implemented MTD(f) myself.

I suspect a fail-soft alpha-beta implementation could be very important here.

The details of your hash table also matter: You may want to try storing an upper bound and a lower bound, each with its own depth.
by AlvaroBegue
Tue Jun 12, 2018 12:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: whether or not a piece has moved and how many times
Replies: 11
Views: 1474

Re: whether or not a piece has moved and how many times

Curious about how others have implemented calculation of how many times each piece has moved since the beginning of the game. The concern is when a piece has been captured in a make move and then uncaptured and updating the array. How did you solve this? Why do you think anyone has ever solved this...
by AlvaroBegue
Wed Jun 06, 2018 2:44 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Bitboard for a non-chess game
Replies: 4
Views: 875

Re: Bitboard for a non-chess game

I would do something like this: #include <iostream> typedef unsigned long long u64; void print_bb(u64 x) { for (int row = 7; row >= 0; row--) { for (int col = 7; col >= 0; col--) std::cout << ((x >> (row*8+col)) & 1); std::cout << '\n'; } } inline u64 N(u64 x) { return x << 8; } inline u64 W(u64 x) ...
by AlvaroBegue
Thu May 31, 2018 9:17 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: tuning for the uninformed
Replies: 41
Views: 8570

Re: tuning for the uninformed

1-0 for white. I use the same format of the "Result" tag in PGN.
by AlvaroBegue
Fri May 25, 2018 12:39 am
Forum: Computer Chess Club: General Topics
Topic: LCZero: Progress and Scaling. Relation to CCRL Elo
Replies: 604
Views: 77357

Re: LCZero: Progress and Scaling. Relation to CCRL Elo

Offhand, I'd say maybe, but that is a very speculative maybe. One cannot remove tactics from the equation, so oversights in its calculations will affect its decisions. An argument such as ' 'this would be a great move if.... it didn't lose a piece" holds no water in my book. Once Capablanca was ask...
by AlvaroBegue
Tue May 22, 2018 6:11 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: CLOP in cutechess-cli debug
Replies: 8
Views: 768

Re: CLOP in cutechess-cli debug

Albert Silver wrote:
Tue May 22, 2018 4:00 pm
I am having trouble with the UCI options though when configuring the engines. Some are more than one word and have spaces. Any idea how best to solve this?
Why is that a problem? The UCI protocol allows for multiple words in the name of options.
by AlvaroBegue
Thu May 10, 2018 7:04 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: TT test positions
Replies: 13
Views: 1303

Re: TT test positions

Do you really need more than 1 byte for depth? In RuyDos the maximum depth is 64, and even if I had fractional values, I think I wouldn't use more than 8 bits. There are only three possible values for the flag, so 8 bits is very wasteful. Also 8 bits for age is a lot. You can combine those two field...