Search found 150 matches

by Volker Annuss
Sat Nov 03, 2018 5:01 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Which author what engine?
Replies: 6
Views: 2129

Re: Which author what engine?

You can find a list of chess programmers here.
And here is a list of engines.
Aldus wrote:
Sat Nov 03, 2018 4:03 pm
PS: As a suggestion, put some info in your profiles! :P
done
by Volker Annuss
Thu Jul 05, 2018 7:12 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Attack
Replies: 7
Views: 2541

Re: Attack

I will try to apply pawn shield bonus only to castled king ...
You can also try to apply pawn shield bonus for a king on g1/g8 when the king still has short castling right.
by Volker Annuss
Thu May 03, 2018 5:25 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Alternative to power of two size hash tables
Replies: 9
Views: 2214

Re: Alternative to power of two size hash tables

Much too late to edit. This one should be correct:

Code: Select all

return &table[((key & 0x3ffffffffull) * cluster_count) >> 34].entry[0];
by Volker Annuss
Wed May 02, 2018 7:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Alternative to power of two size hash tables
Replies: 9
Views: 2214

Re: Alternative to power of two size hash tables

I have not measured how fast it is, but you might want to try

Code: Select all

return &table[(((key * cluster_count) & 0x3ffffffffull) >> 34].entry[0];
for 512GB if your cluster size is 32.
by Volker Annuss
Thu Apr 26, 2018 5:25 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On-line engine blitz tourney April
Replies: 50
Views: 9364

Tip of the month

If you leave your engine online after the tourney is over, please check if your tourney variable has been reset.

Entering

Code: Select all

set tourney 0
makes sure, your engine is open to accept challenges.
by Volker Annuss
Wed Apr 25, 2018 8:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Saving killer moves...
Replies: 13
Views: 4668

Re: Saving killer moves...

No, any move that is not en passant, underpromotion and not moving to the same square as the move one ply before is a killer move. When ordering moves they get a bonus that makes killers more important than quiet moves and captures more important than most other captures.
by Volker Annuss
Wed Apr 25, 2018 6:48 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Saving killer moves...
Replies: 13
Views: 4668

Re: Saving killer moves...

Captures can become killers in Arminius to have these capture moves searched before others.

There is one important exception. Moves that capture the last moved piece never become killers.
by Volker Annuss
Thu Feb 15, 2018 8:40 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Near-random movers
Replies: 21
Views: 8366

Re: Near-random movers

Robert Pope wrote:I also made a normal searcher that returned a random number instead of the regular eval. That version scored 600 elo better than a RandomMater. Is that to be expected?
Does your version find deep mates? It is known, that a random eval helps the search to find positions with high mobility.
by Volker Annuss
Wed Feb 14, 2018 8:41 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Near-random movers
Replies: 21
Views: 8366

Re: Near-random movers

Arminius http://www.nnuss.de/Hermann/Arminius2017-01-01.zip has a random mover built in. When you give him the command line argument --Rnd he is a random mover.

When you give him the command line argument --RndMate he will find every mate in one. When there is no mate in one, he is a random mover.