Search found 836 matches

by Steve Maughan
Thu Jan 18, 2018 11:57 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: CuteChess-cli 64 Bit Windows Binary?
Replies: 7
Views: 2148

CuteChess-cli 64 Bit Windows Binary?

It looks like CuteChess-cli 0.8.3 is the latest version. However, there doesn't seem to be a 64 bit windows executable on the main site:

https://github.com/cutechess/cutechess/releases

Does anyone have a 64 bit windows version?

Thanks,

Steve
by Steve Maughan
Tue Jan 09, 2018 12:31 am
Forum: Computer Chess Club: General Topics
Topic: New Version of The Baron (3.42)
Replies: 12
Views: 3389

New Version of The Baron (3.42)

Richard has released another version of the 3.x code base. This has a few enhancements and some additional compiles.

More info here:

http://www.chessprogramming.net/the-baron/

Steve
by Steve Maughan
Mon Dec 18, 2017 2:51 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Parallel search/LazySMP question
Replies: 11
Views: 2876

Re: Parallel search/LazySMP question

I suspect LazySMP is the "free-market" solution to parallel search. By this I mean, people may think they will be able to organize disparate agents to be more efficient, but in the end the simple exchange of information via the hash will ensure close to optimum search.

Steve
by Steve Maughan
Thu Dec 07, 2017 3:43 pm
Forum: Computer Chess Club: General Topics
Topic: AlphaGo Zero And AlphaZero, RomiChess done better
Replies: 82
Views: 17972

Re: AlphaGo Zero And AlphaZero, RomiChess done better

I remember the experiments at the time. Could you briefly explain what you did? From memory I recall you did the following: At the end of the game you parsed the list of moves and adjusted the score up or down a certain number of centipawns based on the outcome. You then hashed each position and sto...
by Steve Maughan
Wed Dec 06, 2017 2:00 pm
Forum: Computer Chess Club: General Topics
Topic: Historic Milestone: AlphaZero
Replies: 193
Views: 69904

Re: Historic Milestone: AlphaZero

I'm gobsmacked.

There's a bit of me that's skeptical, but since they've cracked Go I guess it's legitimate.

When will the UCI version be available? I need to play with it.
by Steve Maughan
Mon Dec 04, 2017 3:07 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Skipping duplicat moves
Replies: 10
Views: 2102

Re: Skipping duplicat moves

It's all done as part of the "move_ordering". Here's the relevant code: void order_moves(struct t_board *board, struct t_move_list *move_list, int ply) { struct t_move_record *hash_move = move_list->hash_move; struct t_move_record *move; struct t_move_record *killer1 = board->pv_data[pl...
by Steve Maughan
Mon Dec 04, 2017 2:00 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Skipping duplicat moves
Replies: 10
Views: 2102

Re: Skipping duplicat moves

Hi H.G.

Is it really a significant saving to search the hash and killer moves before generating the move list? I don't do it in Maverick. I simply generate all moves and then order them. When I last looked the move generation routine didn't take much time at all. I decided to for simplicity.

Steve
by Steve Maughan
Wed Nov 29, 2017 5:16 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: see
Replies: 27
Views: 4855

Re: see

Folkert, The threshold is normally zero i.e. You only want winning SEE captures. But it may be higher of you're entering qsearch and you're 400 centi pawns down. In this case you could set the threshold to 400 and only find SEE moves that are better than 400 centi pawns. Note, SEE usually doesn't ta...