TalkChess.com

The naive disjunctiv normal form approach would be, with some subexpressions to optimize oneEmptyNeighbor = ( occupied_shift_left & ~occupied_shift_down & ~occupied_shift_right & ~occupied_shift_up) | (~occupied_shift_left & occupied_shift_down & ~occupied_shift_right & ~occupied_shift_up) | (~occup...

CPW is under Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0).

The new wikimedia cpw makes good progress and will be available in about July with revisited and new content and links. No need to waste bandwidth or memory.

We have wikitext backups, and some months time to look for another host. How about digitalocean.com? They're $5/mo. and you get 25gb of ssd disk space, a full linux shell enviornment where you can install whatever you want. I would like to see the 'wikitext backup' for this page: https://chessprogr...

I wondered about this ymmetry business. In Chess you could also do BW mirroring. But no one I know does this, because in good Chess openings the mirrored positions just never occur. To reach them white would have to lose a tempo, and this is considered very bad in Chess. Is it really an advantage t...

1. The US Patent for Gothic Chess was sold for $250,000 to the International team who took a 50% share in the international profits once the International Patent was awarded. Why all the citation claiming "unpaid maintenance fees?" Not even close to the reason. The International Patent overshadows ...

I have noticed the announcement that Wikispaces, which is hosting the Chess Programming Wiki, is shutting down ( http://blog.wikispaces.com/ ). I hope there are plans to migrate the content elsewhere, because it has been a good resource and reference. --Jon We have wikitext backups, and some months...

Nice! One extra register, parallel executed "and" (with mul) instead of L1 access. I guess it depends on the surrounding instructions and register pressure whether your proposal is faster or slower.

Günther, can you tell me the exact url of Butter-Chess , please? The current github package is from 09-11-2017. Norbert Readme from Sep 12, 2017 doesn't fit to to the remaining sources from Feb 11, 2017. Readme claims Magic bitboards, Principal variation search, and Null move pruning - which are no...

Hi Oleg, your code looks like from an obfuscation contest or compiler optimization test - a violation of using bitboards ;-) One sample of many: uint64_t possibleMoves, mask, emask; uint8_t color; if(currentState.whiteMove) { color = WHITE; mask = currentState.white_bit_mask; emask = cu...

Mine, Marcel van Kervinck's and Tony Lezard's 8Q approaches:

https://chessprogramming.wikispaces.com ... 0Bitboards