My coordinates are relative to each side. A8 = 0 for White, A1 = 0 for Black.
It seems complex but it simplifies many calculations to make them true color independent.
Search found 434 matches
- Wed Oct 07, 2020 1:45 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Bit Board Orientation
- Replies: 9
- Views: 1868
- Wed Nov 28, 2018 9:10 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: How to incrementally update attack tables?
- Replies: 5
- Views: 1979
Re: How to incrementally update attack tables?
Board representation for incremental attack tables should be build from scratch.
It is not a efficient idea to add attacks as extra weight to well-known representations.
It is not a efficient idea to add attacks as extra weight to well-known representations.
- Fri Nov 02, 2018 4:27 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Blocking input
- Replies: 3
- Views: 1155
Re: Blocking input
You need to do std::flush() after printing each info string.
- Thu Aug 16, 2018 11:02 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Attacks From table
- Replies: 12
- Views: 5366
Re: Attacks From table
This representaion is as fast as the fastest perft known engines. My principal chess representation consists of 16-byte vector for each 16 chess piece from each side. attackMap is array of Ranks of BitRank vectors for each piece; BitRank: byte of 8 squares per rank (1/8 of bitboard); PieceId: index ...
- Tue Aug 07, 2018 8:59 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: need to update my knowledge
- Replies: 14
- Views: 2823
Re: need to update my knowledge
Stroustrup's "The C++ Programming Language" is must read for practical experience. I personally read some old Effective C++ books and dislike them all. Agile is all about Team Project Management not about individual programming skills. "Clean Code" is good reading for programmer but it is not a tuto...
- Wed Mar 21, 2018 8:42 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: trick question
- Replies: 25
- Views: 7333
Re: trick question
The trick is to use second counter. unsigned long nodes; unsigned long nodesLimit; //search limit enum : unsigned { TickLimit = 5000 }; // ~1 msec unsigned nodesQuota; //number of remaining nodes before slow checking for terminate // the current exact number of nodes node_count_t getNodes&...
- Mon Mar 05, 2018 10:18 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: [Discussion] - Measuring move ordering
- Replies: 14
- Views: 5286
Re: [Discussion] - Measuring move ordering
There is a true metric: ratio of nodes pruned relative to full minimax tree.
- Thu Mar 01, 2018 8:47 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Some opening book design questions
- Replies: 39
- Views: 13203
Re: Some opening book design questions
It is easy to make color-independent but side-to-move dependent board representation. So all hashing and evaluation are transparently symmetrical.jdart wrote:Color-flipped positions *can* occur in chess, but I would be surprised if they were frequent enough to make this optimization a significant win.
--Jon
- Fri Jan 26, 2018 7:27 am
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Alpha-Beta as a rollouts algorithm
- Replies: 15
- Views: 7217
Re: Alpha-Beta as a rollouts algorithm
Please can you explain what is rollout algorithm in simple words?
- Tue Aug 29, 2017 12:06 pm
- Forum: Computer Chess Club: Programming and Technical Discussions
- Topic: Question on Null Move Pruning
- Replies: 19
- Views: 5213
Re: Question on Null Move Pruning
Null move heuristic should not be done on PV-nodes. To my limited understanding all non-PV nodes in PVS are searched with null-window.