...as Anantharaman|Anantharaman]] et al. 1990)</ref>. '''Conspiracy theory''' can be formulated using the following definition <ref>[[David McAllester]], [[D
14 KB (1,859 words) - 17:10, 16 November 2020
...twise maximum, max(a, b) or as addition with saturation, min(a + b, 1). It can also be interpreted as sum minus product, a + b - a*b, with possible tempor
The complement can be interpreted as bitwise subtraction (1 - a).
94 KB (12,233 words) - 00:52, 18 January 2022
...dia.org/wiki/Recurrence_relation recurrence relation] of population counts can be transformed to iteration as well, but lacks an arithmetical sum-formula:
...o look whether it is equal with the bitboard. Alternatively and faster, we can [[General Setwise Operations#LS1BReset|reset the LS1B]] to look whether the
39 KB (5,372 words) - 19:58, 16 November 2020
...ly hash]] the bit-index table. Three gaps are 0, 17, and 34, so the mod 67 can make a branchless trailing zero count:
If we have a fast [[Population Count|population-count]] instruction, we can count the trailing zeros of [[General Setwise Operations#TheLeastSignifican
60 KB (7,408 words) - 19:33, 28 April 2022
Rotation can be deduced from flipping and mirroring in various ways.
...swap bits, but maps file to a rank or vice versa in different steps, which can not be combined in one step. Main application is to map file- or diagonal o
38 KB (4,378 words) - 15:10, 19 December 2018
As proposed by [[Andrew Tridgell]] and used in [[KnightCap]], piece-sets can be used to generate moves, as seen in the move generation code of [[Dorpsge
/* En-passant captures can move to nothing, so we avoid skipping them */
5 KB (519 words) - 23:01, 5 February 2020
...which pieces (and how many of both sides) attack a particular square, one can even imagine a 16-bit lookup inside a 64KByte table to get an denser attack
...icient for practical purposes - and it is fast. Each byte (for both sides) can act as index inside pre-calculated three-dimensional table to perform an SE
11 KB (1,539 words) - 11:36, 31 August 2020
Mr. Steinmeier, can you actually play chess, like [https://en.wikipedia.org/wiki/Peer_Steinbr%C
11 KB (1,545 words) - 20:14, 28 September 2019
For bitsets with multiple sliding pieces one can apply a [[Fill Algorithms|fill algorithm]] in each of the eight [[Rays#RayD
11 KB (1,434 words) - 12:42, 25 March 2022
Isolating none-empty subsets with possibly multiple one-bits can be applied by [https://en.wikipedia.org/wiki/Divide_and_conquer_algorithm d
...ason - we like to traverse the sets in reverse or unknown order anyway, we can not (or don't want to) rely on the independent LS1B reset.
14 KB (2,006 words) - 10:30, 11 April 2020
'''Sliding Pieces''' can move an indefinite number of [[Squares|squares]] along a [[Ranks|horizontal
3 KB (340 words) - 17:25, 7 May 2018
...Material, thus no [[Captures|captures]] nor [[Promotions|promotions]]. One can also exclude moves that present imminent threats, such as [[Check|check]].
446 bytes (60 words) - 13:35, 8 May 2018
...d.jpg|border|right|thumb|link=https://fineartamerica.com/featured/the-king-can-never-be-captured-marina-kalinovsky.html
...om/featured/the-king-can-never-be-captured-marina-kalinovsky.html The King can never be Captured by Marina Kalinovsky, Artwork for Sale - Brooklyn, NY - U
4 KB (494 words) - 10:06, 11 July 2021
...[[Double Check|double check]]. Pieces potentially able to discover a check can be determined almost with the same method along with a union set of [[Pin|p
1 KB (165 words) - 10:08, 8 May 2018
...Check]]. Discovered attacks can be extremely powerful, as the piece moved can make a threat independently of the piece it reveals.
1 KB (185 words) - 19:49, 15 July 2019
* [[Alexis Drogoul]] ('''1993, 1995'''). ''When Ants Play Chess (Or Can Strategies Emerge From Tactical Behaviors?)'' [http://www.informatik.uni-tr
15 KB (1,973 words) - 22:14, 30 November 2021
A partial pin refers to (absolute) pins, where the pinned piece or pawn can move along the attacking [[Direction|direction]], and may even capture the
Evaluation can take the restricted [[Mobility|mobility]] of pinned pieces into account, an
6 KB (920 words) - 00:44, 27 October 2020
Whether a king is in check can be determined by the attacked-routine mentioned in [[Square Attacked By#Any
7 KB (928 words) - 12:13, 4 April 2022
...kup|sliding piece attacks]]. Instead of the pre-calculated line-attacks we can also pre-calculate attacks behind the first blocker, including a possible s
7 KB (1,013 words) - 23:13, 19 October 2018
...n], Magdeburger Zeitung, 1930</ref> covers a skewer. The threat 1... b1=Q can be parried with the skewer b8=Q+, which safes white game and forces [[Stale
2 KB (348 words) - 11:10, 8 May 2018
