Search found 861 matches

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

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

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

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

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

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

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...
by AlvaroBegue
Thu May 10, 2018 1:55 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Training data
Replies: 7
Views: 534

Re: Training data

For policy training you also need move probabilities. Relative frequencies for all legal moves per position. And who can tell that these values are right. No, for policy training you just need moves. Take any collection of games (I believe they don't need to be of particularly high quality or evenl...
by AlvaroBegue
Thu May 10, 2018 12:27 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Training data
Replies: 7
Views: 534

Re: Training data

I can give you two related things. The first one is the file I used to tune RuyDos a couple of years ago: https://bitbucket.org/alonamaloh/ruy_tune/raw/74dd679130c5c9d3c186729fcba0dc2638dcef4d/data/quiescent_positions_with_results It looks like this: 3r4/4k3/8/5p1R/8/1b2PB2/1P6/4K3 b - - 1-0 3nk2r/r...
by AlvaroBegue
Wed May 09, 2018 1:36 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Not detected collisions in tt probing
Replies: 9
Views: 485

Re: Not detected collisions in tt probing

You could also check if the hash move is legal in the current position, as further verification. One final twist to that trick consist of storing the move XORed with the additional bits of the hash key that you are not saving or using for addressing. That way the probability that the move you read b...
by AlvaroBegue
Tue May 08, 2018 7:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: MCTS with minmax backup operator?
Replies: 24
Views: 2115

Re: MCTS with minmax backup operator?

I keep actual scores in centipawns but that is irrelvant to the minmax/averaging stuff. Sorry, I haven't followed the whole thread, but this statement makes no sense to me. Since the conversion from "expected result" space (i.e., [-1,1]) to "score in centipawns" is not linear, you can't expect aver...