Search found 25 matches

by jackd
Wed Dec 26, 2018 10:17 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: neural network architecture
Replies: 7
Views: 1830

neural network architecture

Giraffe, the author of this paper http://www.ai.rug.nl/~mwiering/Thesis_Matthia_Sabatelli.pdf and the authors of this paper https://www.cs.tau.ac.il/~wolf/papers/deepchess.pdf had success using a normal, fully connected neural network to label positions. However, AlphaZero, LeelaZero and Scorpio all...
by jackd
Wed Dec 26, 2018 6:38 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Bad architecture
Replies: 3
Views: 771

Re: Bad architecture

quiescence search is just normal search, but only searching the important moves and getting standpat scores.
by jackd
Wed Dec 26, 2018 6:25 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: fast(er) movegen
Replies: 34
Views: 8976

Re: fast(er) movegen

C is just an "or" of the following: pawns giving check, knights giving check, bishops and knights giving check along with all squares in between. If more than one piece is giving check king moves only. To calculate B, first get a bit-board for all the pinned pieces on your side. Then when generating...
by jackd
Wed Dec 26, 2018 6:10 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: fast(er) movegen
Replies: 34
Views: 8976

Re: fast(er) movegen

HGM's move generation on qperft is a good reference for speed. If you want to change your board representation there is no doubt that bitboard representation is the fastest. Actually I doubt that. Shouldn't everything be faster with bit-boards? -get a bit-board for the piece in question via bitscan...
by jackd
Wed Dec 26, 2018 5:25 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Staged move generation and killers
Replies: 24
Views: 4755

Re: Staged move generation and killers

^^

Just write a fast legal move generation and never worry about it again (or about checkmate).