Search found 1211 matches

by ZirconiumX
Wed Aug 04, 2021 9:04 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: in check detection: "Square attacked by" vs "Attack and defend maps"
Replies: 2
Views: 143

Re: in check detection: "Square attacked by" vs "Attack and defend maps"

I really like attack tables, but the question is how much information you want to store in them. Dorpsgek uses a piece-set per square of the board for 256 bytes in total; HGM's mailbox trials engine uses a piece-set per piece of the board, along with other information like distance to next piece in ...
by ZirconiumX
Wed Jul 21, 2021 7:12 am
Forum: Computer Chess Club: General Topics
Topic: Following Principal Variations in PVS
Replies: 2
Views: 956

Re: Following Principal Variations in PVS

Principal Variation Search and Principal Variation move scoring are two distinct things. First, a PV node is a node that has alpha > beta - 1, that is, the search window is not zero-width. When the search is called at the root it is called with a full-width search window, making the root a PV node. ...
by ZirconiumX
Wed Jul 14, 2021 1:33 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: The mailbox trials
Replies: 149
Views: 59313

Re: The mailbox trials

Perhaps I'm grave digging this thread a little bit, but I want to do two things. First, thank you very much for this thread HGM, which has provided valuable insight into how to make the most of the board infrastructure in Dorpsgek, leading to a quadrupling of nodes per second. I think the biggest pi...
by ZirconiumX
Sun Jul 11, 2021 12:54 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Efficiently Generated Legal moves question
Replies: 45
Views: 8965

Re: Efficiently Generated Legal moves question

i can't use the native popcount becasue i am limited to use . Net framework up to 4.x not . Net framework 5 (is the minimun required version to use that) Unfortunately an approach like the one that that code uses is going to be significantly slower than native instructions generated by the JIT, and...
by ZirconiumX
Sat Jul 10, 2021 9:03 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Efficiently Generated Legal moves question
Replies: 45
Views: 8965

Re: Efficiently Generated Legal moves question

but in visual studio it does not point to any relevant "hot point". In visual studio even doing an bitwise and operation (&) and performing a count bits lookup it represents a 5% in computation time? it was not supposed to be a really fast operation? Would you mind showing the implementation of Bit...
by ZirconiumX
Fri Jun 08, 2018 10:47 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: syzygy request for info
Replies: 35
Views: 12311

Re: syzygy request for info

Ronald's site on github appears to be gone now. Huh? Search me, the search is broken. Try this: https://github.com/search?l=C&q=syzygy&type=Repositories You're searching for a repository called syzygy. Ron's account is "syzygy1", and the repository name is "tb". The users tab brings up syzygy1 as t...
by ZirconiumX
Mon May 28, 2018 7:54 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: On-line engine blitz tourney May
Replies: 24
Views: 9485

Re: On-line engine blitz tourney May

hgm wrote:
Sun May 27, 2018 9:39 pm
Dorpsgek lost connection after 7 rounds, and had to be forfeited.
XBoard segfaulted while I was asleep. Sorry for the inconvenience.
by ZirconiumX
Tue May 15, 2018 11:48 am
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Root move sorting
Replies: 4
Views: 2380

Re: Root move sorting

Fail soft scores are still fairly unreliable in my experience; just because a score can be outside the window doesn't always mean it is. Hyatt suggested root move ordering by node count, and I think it's worth trying out, but I would have to test. Printing root move ordering coincidentally helped me...
by ZirconiumX
Tue May 08, 2018 4:25 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Quad-bard vs bitboard : is it faster ?
Replies: 10
Views: 5305

Re: Quad-bard vs bitboard : is it faster ?

32-bit. 64-bit RPi - last time I checked - lacked things like processor reclocking which is found in the RPF kernel, and the RPF aren't interested in a 64-bit version.
by ZirconiumX
Mon May 07, 2018 8:12 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Quad-bard vs bitboard : is it faster ?
Replies: 10
Views: 5305

Re: Quad-bard vs bitboard : is it faster ?

This got sidetracked by the forum migration and me getting ill over the weekend. So, I ran a Perft benchmark (which admittedly isn't the whole story of a search, but it magnifies the important part). It turns out that a monochrome move generator is slightly faster: AMD FX-6300 @ 3.5GHz: Double-colou...