...just those links. If you are looking for a specific page or catchword you can use the search box on top.
3 KB (417 words) - 13:23, 19 April 2024
...''' data-structure fitting in one 64-bit register. For example, a bitboard can represent things like attack- and defend sets, move-target sets and so on.
* Bitboards can have a high information density.
26 KB (3,485 words) - 18:37, 12 March 2022
...free board representation that knows '''every''' rule of chess. While this can sometimes be a pain, especially implementing the more complicated rules suc
...a look at some of the [[:Category:Open Source|Open Source Engines]]. These can be very helpful when translating rather vague algorithms into specific data
2 KB (422 words) - 15:48, 17 December 2018
* [[:Category:Can|Can]] - [https://en.wikipedia.org/wiki/Tago_Mago Paperhouse], [https://en.wikip
[[Category:Can]]
4 KB (457 words) - 21:23, 21 September 2020
....org/wiki/Specification_%28technical_standard%29 specification], the rules can be expressed by [[Algorithms|algorithms]] and data structures.
9 KB (1,194 words) - 09:29, 3 July 2021
...] [[Robots|robot]] able to move its own pieces. It is still functional and can be visited at the Torres Quevedo Museum of Engineering, Institute of Civil
A detailed explanation of El Ajedrecista can be found in ''Les Automates'' by [[Henri Vigneron]] <ref>[[Henri Vigneron]]
20 KB (2,969 words) - 14:19, 14 August 2020
...can be well ordered. This gave rise to the Zermelo axiom that every class can be well ordered. In 1904 Zermelo defined the [https://en.wikipedia.org/wiki
9 KB (1,273 words) - 22:10, 1 October 2018
We can deduct square mapping on enumerating [[Files|files]] and [[Ranks|ranks]] fr
7 KB (965 words) - 18:15, 5 October 2020
We can safely replace bitwise-or by add, since unused bits are always zero:
10 KB (1,405 words) - 16:45, 20 June 2020
...ew/how-rybka-and-i-tried-to-beat-the-strongest-chess-computer-in-the-world Can a GM and Rybka beat Stockfish?] by GM [https://en.wikipedia.org/wiki/Daniel
* [https://www.talkchess.com/forum3/viewtopic.php?f=2&t=74484 Can the sardine! NNUE clobbers SF] by [[Henk Drost]], [[CCC]], July 16, 2020 »
65 KB (8,362 words) - 13:19, 1 March 2024
...ers with the score 1.5 to 0.5. Those, who remember the hot summer of 1972, can envy to the authors of Kaissa, that carried out the pair of days in the wee
...anywhere do not share and among them a lot of such where quality of result can be estimated objectively. The majority of serious experts, before engaged i
54 KB (7,939 words) - 06:55, 24 September 2023
...''[https://en.wikipedia.org/wiki/What_Computers_Can%27t_Do What Computers Can't Do]''.</ref> at MIT was challenged by Greenblatt to play a game against h
21 KB (3,150 words) - 18:33, 25 February 2021
...rchitectures with different net size give different nodes per second. CPUs can be utilized for example via BLAS and DNNL and GPUs via CUDA, cuDNN, OpenCL,
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69622 Can somebody explain what makes Leela as strong as Komodo?] by Chessqueen, [[CC
35 KB (4,831 words) - 15:09, 10 August 2023
...are all mailbox, independently from elements in the array for padding that can act as a [https://en.wikipedia.org/wiki/Sentinel_value sentinel value] <ref
* Suitable with the same efficiency for any size of boards, from one can be fitted on 64-bit integers to much larger. Thus it is also easier to supp
7 KB (993 words) - 12:00, 13 June 2021
...are all mailbox, independently from elements in the array for padding that can act as a [https://en.wikipedia.org/wiki/Sentinel_value sentinel value] <ref
need to figure out what pieces can go where. Let's say we have a
10 KB (1,393 words) - 21:42, 14 August 2018
Represented as such a square difference, displacement vectors can be used to index 225 (15x15) or 240 (16x15) sized lookup tables for stuff d
...6x8, making the "off the board" index condition almost redundant, since it can be combined with the coding of the guard or sentinal squares <ref>[https://
25 KB (2,238 words) - 16:19, 25 December 2020
...6x8, making the "off the board" index condition almost redundant, since it can be combined with the coding of the guard or sentinal squares <ref>[https://
18 KB (2,661 words) - 17:16, 1 October 2020
* [http://rybkaforum.net/cgi-bin/rybkaforum/topic_show.pl?tid=30373 You can't win a WC by playing drawing lines] by Venator, [[Computer Chess Forums|Ry
20 KB (2,719 words) - 11:36, 28 January 2020
11th World Microcomputer Chess Championship, May 1991, Vancouver CAN <ref>[http://www.csvn.nl/index.php?option=com_content&view=article&id=75%3A
14 KB (1,590 words) - 11:43, 28 January 2020
...arks given by [[Morris Miller]], "A comedy of errors in which the readers can supply their own question marks, exclamation points, asterisks and stars" <
5 KB (622 words) - 12:51, 28 January 2020
...izing this concept we have found that a pseudo-dynamic position projection can be effected in a static environment on a local scale. Significant is that t
8 KB (1,171 words) - 00:17, 7 November 2019
...essence. Most programs have opening books, but I seriously doubt that any can handle [[Transposition|transpositions]]. I have never seen a program sacrif
...ss the nation will bring forth new ideas. We must learn all the lessons we can, for next year, the Russians are coming.
7 KB (1,107 words) - 00:17, 7 November 2019
...her side of the fence are the slower but "smarter" computer programs. They can't think about zillions of chess moves, so they need a lot of information ab
13 KB (1,864 words) - 14:31, 7 December 2019
...different patterns. The program is structured so that additional patterns can be easily added by a chess player unfamiliar with the details of the progra
4 KB (584 words) - 23:14, 1 January 2020
...second high failure, the first high failure remains the best move, and it can still avoid doing any more full searches.
24 KB (2,852 words) - 18:36, 25 February 2021
...[https://www.newspapers.com/newspage/107846183/ At Engineer Week at UL you can try to make a soft landing on the moon]''. [https://en.wikipedia.org/wiki/T
...[https://www.newspapers.com/newspage/107846183/ At Engineer Week at UL you can try to make a soft landing on the moon]''. [https://en.wikipedia.org/wiki/T
6 KB (885 words) - 19:52, 3 July 2021
I remember [[Ken Thompson|Ken]] once saying "If you can just hold on and not get caught by its tactics, it will eventually 'fold' a
6 KB (875 words) - 15:32, 2 April 2020
...pedia.org/wiki/Operating_system operating system]. One or multiple threads can exist within the same [[Process|process]] to share its resources such as [[
...alkchess.com/forum/viewtopic.php?t=65844 Lazy SMP >4 Thread Slowdown] by [[Can Cetin]], [[CCC]], November 29, 2017 » [[Lazy SMP]]
25 KB (3,329 words) - 21:14, 28 March 2022
...of Artificial Intelligence”. A public pronouncement of his point of view can be found in an interview with [[Jaap van den Herik|H.J. van den Herik]] hel
...this journal), but the game is limited in the types of challenges that it can offer to the AI researcher. Being a game of perfect information (both playe
76 KB (10,439 words) - 14:01, 10 August 2023
...ur queen, it's phenomenally brilliant. You are winning the game. So if you can find a way to get your queen out there and sacrifice her, well, you've won.
24 KB (3,641 words) - 21:59, 3 July 2021
...https://en.wikipedia.org/wiki/Linear_algebra linear algebra] library which can be used for [https://en.wikipedia.org/wiki/Dynamical_simulation simulating]
2 KB (285 words) - 10:11, 3 September 2018
...ings and pawns, add the square roots of the number of moves that the piece can make, counting a capture as two moves.
18 KB (2,507 words) - 18:37, 25 February 2021
...computation]" with the [[Alan Turing#TuringMachine|Turing machine]], which can be considered a model of a [https://en.wikipedia.org/wiki/Computer general
...ng_machine Turing machines] are abstract symbol-manipulating devices which can be adapted to simulate the logic of any computer algorithm, described in 19
28 KB (4,173 words) - 09:54, 14 November 2020
...ng strength]] of a chess engine or game playing program. Evaluation tuning can be applied by [[Automated Tuning#Optimization|mathematical optimization]] o
* Can modify any number of weights simultaneously - constant [https://en.wikipedi
91 KB (12,241 words) - 21:01, 28 March 2022
...ikipedia.org/wiki/Gradient gradient] isn't mathematically defined, but you can use [https://en.wikipedia.org/wiki/Difference_quotient difference quotients
...ew-7000003879/ Dell PowerEdge T620 review | ZDNet]</ref> . A local minimum can usually be computed within 6 hours, faster if only small changes to the par
28 KB (4,063 words) - 21:06, 28 March 2022
The basic theory on which one chess program can be constructed is that there exists a general characteristic of the game of
9 KB (1,350 words) - 16:17, 6 December 2020
...e it self starts, the answers for both kings are ready before the software can ask the question. </code>
17 KB (2,527 words) - 23:40, 18 February 2021
...] method for computer chess). The program is written in 486- assembler and can search 9 or ten plies in the [[Middlegame|middlegame]]. Schach participated
9 KB (1,257 words) - 10:10, 29 February 2020
...[Principal Variation|best variation]] if the [[Side to move|side to move]] can have anything captured.
...tor]] to resolve situations where something is under attack. If a decision can not be made using this score, then a secondary positional score is generate
8 KB (1,106 words) - 22:22, 16 December 2019
...een CB and Crafty last night, one CPU, no [[Pondering|pondering]] since CB can't yet ponder, 10 secs per move. Crafty won handily, typically searching 14-
18 KB (2,693 words) - 16:15, 16 November 2020
...the project PIONEER, Dr. Botvinnik used to say: “If a human chess master can make it, a computer will make it as well.” He believed in the existence o
* [[:Category:Can|Can]] - [https://en.wikipedia.org/wiki/Landed_(album) Unfinished], 1975, [https
38 KB (4,367 words) - 09:31, 28 March 2021
...ction reflects the [[Playing Strength|playing strength]] to maximize, SPSA can be used in [[Automated Tuning|automated tuning]] of [[Evaluation|evaluation
...ural networks]], is applicable to any optimization task where the gradient can be computed or approximated <ref>[[Martin Riedmiller]], [[Heinrich Braun]]
18 KB (2,427 words) - 16:42, 2 June 2021
...ust not be locked and skipped for the 62 with an extra depth reduction. 32 can not appear as index inside the 58 recursive tests in one path, and is there
6 KB (673 words) - 10:57, 22 September 2018
...are. They ensure that SOMA will move or defend any White piece which Black can capture with advantage, that he will harry his opponent's pieces (+5 for in
...[[Castling|castling]], which discourage him from leaving pieces where they can be threatened by an opponent's pawn advance, and which enable him to allow
14 KB (2,114 words) - 20:50, 8 December 2019
...pected pay-off replaces the iterated [[Minimax|minimax]]. The minimax idea can come in if we are trying to prove a theorem and we imagine that we have an
23 KB (3,383 words) - 17:08, 16 November 2020
... I can speak from experience here. In the early versions of my chess program Phoen
12 KB (1,783 words) - 17:57, 26 December 2019
'''YNCT''', (You Never Can Tell)<br/>
* [https://en.wikipedia.org/wiki/You_Never_Can_Tell You Never Can Tell (disambiguation) from Wikipedia]
4 KB (529 words) - 13:07, 26 October 2018
...has been my alter-ego when it comes to discussion of chess ideas, and what can be done to allow Hitech to understand this or that.
...rds) to do fast [[Search|searching]] and [[Evaluation|evaluation]]. HiTech can search about 175,000 [[Nodes per Second|positions/second]] and executes a [
15 KB (2,069 words) - 18:27, 27 November 2022
...de>For first time users Rebel is easy to understand. Within Rebel 10.0 you can even choose three modes to operate Rebel (novice, intermediate and expert).
22 KB (3,106 words) - 17:47, 11 August 2023
...function]] is complex and hence a little slow. Positional [[Score|scores]] can "easily exceed several Pawns". Separate evaluation terms are used for [[Ope
9 KB (1,287 words) - 14:44, 29 November 2020
...re, the score of each move is now the score of the worst that the opponent can do.
17 KB (2,338 words) - 17:34, 15 January 2022
...f negaMax is only returning an optimal score, then just how is it that you can know which particular move this score is related to? These two questions ar
3 KB (435 words) - 08:40, 27 April 2018
...know that we can achieve at least that, so anything that is clearly worse can be ignored.
...e go to a search [[Depth|depth]] of 3 or greater, because now both players can make choices affecting the game tree. Now we have to maintain both a [[Lowe
37 KB (5,099 words) - 16:20, 1 December 2021
* [http://www.talkchess.com/forum/viewtopic.php?t=48356 LMR at CUT nodes can be arbitrarily bad!] by [[Michel Van den Bergh]], [[CCC]], June 20, 2013 »
15 KB (2,159 words) - 11:21, 31 May 2021
...Usually any given type of [[Neural Networks|neural network]] architecture can be employed in any of those tasks.
...ame but the final result (still) unknown. A form of reinforcement learning can be used for unsupervised learning, where an [https://en.wikipedia.org/wiki/
137 KB (18,484 words) - 00:18, 19 December 2021
...s later, but is conceptually simple, and we will first show how a computer can be programmed for such a strategy.
3 KB (408 words) - 13:52, 7 December 2019
...constituting an analysis of variations, until a position is reached which can be evaluated. The final choice depends on an acceptance value and if a move
7 KB (1,048 words) - 13:54, 7 December 2019
* [https://www.stmintz.com/ccc/index.php?id=93686 Can we use hash table at root?] by Tim, [[CCC]], January 31, 2000 » [[Transpos
5 KB (631 words) - 21:04, 8 November 2021
...o window]] search centered around alpha is conducted to test if a new move can be better. If so, with respect to the null window but not with respect to t
...second high failure, the first high failure remains the best move, and it can still avoid doing any more full searches.
28 KB (3,999 words) - 00:15, 1 February 2022
...cutoff, a [[Best Move|best]] (or good enough) move from a previous search can improve [[Move Ordering|move ordering]], and save search time. This is espe
...ally a 64-bit number, and with current hardware limitations, no hash table can be large enough to accommodate it. Therefor to calculate the address or ind
60 KB (8,162 words) - 21:35, 28 April 2022
...ne becomes unnecessary. This way, also the results from the partial search can be accepted - though in case of a severe drop of the score it is wise to al
13 KB (1,843 words) - 23:44, 4 October 2019
...aluation|static exchange evaluation]] < 0, [[Delta Pruning|delta pruning]] can be used for that purpose.
...t exceeds [[Alpha|alpha]], to see if any [[Tactical Moves|tactical moves]] can increase [[Alpha|alpha]].
25 KB (3,459 words) - 10:30, 15 June 2021
...efining one [[Ply|ply]] to be a number greater than one. Then an extension can be added that does not yet extend the search, but further down the tree may
14 KB (1,884 words) - 21:12, 20 November 2020
...otes too little effort to critical lines. The singular extension heuristic can be seen as a solution to this problem.
...of flattery"; as to why the author(s) of the clone don't openly admit it I can't say. But the specific idea I'm talking about here is attributed to the cl
16 KB (2,280 words) - 17:09, 16 November 2020
...has been my alter-ego when it comes to discussion of chess ideas, and what can be done to allow HiTech to understand this or that.
13 KB (1,716 words) - 17:09, 16 November 2020
...hould we be searching a line that already is equal to or longer than n, we can impossibly increase alpha even if another mate was found. This means we cou
...root, the opponent can impossibly be evaluated > SCORE_MATE - n. Thus beta can be set to this value should it be higher.
5 KB (719 words) - 11:57, 12 May 2018
...hing on his turn, that is, by playing a "No Move" and then seeing if White can enforce an immediate checkmate.
...that sometimes an extension of the game tree by introducing of dummy move can lead to a reduction of the search tree. In positions with material advantag
40 KB (5,641 words) - 18:55, 25 December 2020
...In principle, forward pruning at an expected All-node is not dangerous but can trigger unnecessary re-searches.
7 KB (953 words) - 23:30, 2 November 2019
...and this pruning technique does not make much difference in most cases, it can significantly decrease the search effort when move ordering heuristics fail
7 KB (968 words) - 23:21, 14 December 2019
Some processing power may be saved by testing if '''any''' move can improve over alpha. Then in truly hopeless nodes we don't do move generatio
// The next three lines test if alpha can be improved by greatest
3 KB (418 words) - 10:37, 25 September 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=30036 Can someone explain this?] by [[Michel Van den Bergh]], [[CCC]], October 07, 20
1 KB (164 words) - 18:59, 29 April 2018
...> used open source implementations based on the [[History Heuristic]]. LMR can often reduce the [[Branching Factor#EffectiveBranchingFactor|effective bran
...r in pv nodes), [[Depth|depth]] and move number. Here some sample formulas can be viewed:
17 KB (2,291 words) - 11:20, 4 April 2022
| if we are doing fairly badly, we can reduce the depth |
14 KB (1,941 words) - 20:31, 6 November 2020
...lstice winter solstice] or [https://en.wikipedia.org/wiki/Equinox equinox] can be observed, by means of further bearing points also [https://en.wikipedia.
5 KB (765 words) - 19:57, 6 August 2018
...same score for the (in that case redundant) re-search, which most programs can not guarantee due to possible [[Extensions|extensions]] <ref>[https://www.s
...he value returned by the null window search instead of alpha. But then you can get a fail-low on the research due to search anonomalies. If that happens N
12 KB (1,752 words) - 20:59, 2 March 2020
...-Max]] (which does have no move ordering at all, not even a move list, and can only search moves as it generates them) is able to compete with 'serious' e
9 KB (1,332 words) - 10:40, 25 September 2020
..."winning" move. For example, PxQ will always be a win, since the Pawn side can choose to stop the exchange after its Pawn is recaptured, and still be ahea
...[[Quiescence Search#StandPat|standing pat]] rather than to capture, which can be done by a conditional assignment, or by a [[Avoiding Branches#Max|max]]
20 KB (2,822 words) - 10:43, 1 August 2022
...[[Moves|moves]], which appear inside the [[Search|search]]. Those counters can then be used for [[Move Ordering|move ordering]] as mentioned in the [[Hist
13 KB (1,736 words) - 16:05, 12 January 2019
We believe that we can considerably improve the performance of the history heuristic in some games
6 KB (851 words) - 17:48, 19 December 2018
...r example, ETC transposes the right portion of the tree into the left. ETC can be enhanced to also transpose from left to right. At an interior node, look
7 KB (1,019 words) - 23:44, 10 January 2020
...es. In [[Alpha-Beta#MaxversusMin|max versus min alpha-beta]] a beta-cutoff can only occur for the max-player, while the min-player cuts if below or equal
4 KB (515 words) - 10:27, 7 April 2022
...voiding this position, so you have to assume that they'll do this. If they can avoid this position, there is no longer any need to search successors, sinc
You can also talk about failing high and failing low from the root position, if you
5 KB (759 words) - 10:22, 11 April 2020
...score or an upper bound on its value. This path from the d - 1 ply search can be used as the basis for the search to d ply. Often, searching the previous
6 KB (795 words) - 15:07, 30 April 2018
...]]. Both reduce a randomly ordered tree by about 80%, in favor to HH which can perform the search in much less time. However, along with [[Iterative Deepe
...e information about its environment, meaning that the evaluation functions can be reliable, and is not so complex that trying to encapsulate the process i
11 KB (1,358 words) - 23:25, 5 February 2020
...quares]] of the moves. Although the network is very large, the move scores can be computed quickly, since one only has to propagate the activation for the
5 KB (725 words) - 09:47, 22 May 2021
...s-players-that-cant-be-beaten BBC - Future - The cyborg chess players that can’t be beaten] by [http://www.chrisbaraniuk.com/ Chris Baraniuk], December
...ter the games we were in the bar talking and he was saying that "computers can't play endgames, even simple endgames and they never will." And he said "I
35 KB (4,953 words) - 10:55, 21 March 2021
...with depth A against itself with depth B. The exact tournament conditions can be studied on his webpage <ref>[http://www.top-5000.nl/ply.htm Experiments
28 KB (3,741 words) - 10:51, 16 February 2022
...roduced strong dependencies between sibling nodes and discovered that this can cause search-depth pathology to disappear. While Nau was primarily concerne
12 KB (1,680 words) - 11:13, 4 April 2021
* The position can be treated differently if there is a chance of [[Repetitions|repetition]] o
* Different [[Move Ordering|move ordering]] can cause different result (different moves causing a cutoff), when it comes fr
3 KB (359 words) - 11:50, 2 May 2018
...itions are not the same if a pawn that could have been captured en passant can no longer in this manner be captured or if the right to castle has been cha
...ght not use this kind of replacement scheme. Another problem is that there can be hash table entry collisions, and they must be dealt with. I am not talki
34 KB (4,898 words) - 12:51, 21 August 2022
* [https://groups.google.com/d/msg/rec.games.chess/wqAWR7ylU4w/PTvP5DbWadcJ Can Chess Help Adapt to Life?] by [[Michael Valvo|Mike Valvo]], [[Computer Ches
...s-players-that-cant-be-beaten BBC - Future - The cyborg chess players that can’t be beaten] by [http://www.chrisbaraniuk.com/ Chris Baraniuk], December
40 KB (5,362 words) - 20:47, 22 November 2023
...arch bound without an extra bonus, to make the final convergence. Also, it can be quite instructive to experiment with different evaluation function grain
22 KB (3,042 words) - 10:31, 11 April 2021
...s]]. Depth-first examines child nodes before [[Sibling Node|siblings]] and can easily implemented with [[Recursion|recursion]] using a [[Stack|stack]] of
7 KB (955 words) - 23:55, 9 March 2019
...aeffer]], [[Wim Pijls]] and [[Arie de Bruin]] pointed out, that '''SSS'''* can be reformulated as a sequence of [[Alpha-Beta|alpha-beta]] [[Null Window|nu
...order. Insert and (in particular) delete/purge operations on the OPEN list can dominate the execution time of any program using SSS*. Despite the promise
18 KB (2,480 words) - 23:49, 9 March 2019
...aka [[NegaScout]], and [[MTD(f)]], with integers (α, α+1) or (β-1, β), can therefor only provide a [[Bound|bound]], either [[Fail-High|failing-high]]
...fficiency. Here's the way to follow why. If every root move fails low, it can do so after searching only one move at ply 2, the one move necessary to 're
4 KB (612 words) - 19:38, 22 September 2018
A null window search can never return an [[Exact Score|exact score]] with <span style="background-co
3 KB (443 words) - 16:23, 2 May 2018
You can also talk about failing high and failing low from the root position, if you
6 KB (812 words) - 20:53, 8 April 2020
...causes of instability, and I will discuss how various search enhancements can lead to instability, when I discuss those enhancements. A few other search
...ail-high indicated very clearly that the score should be 25 or better. How can you fail low?
7 KB (952 words) - 13:56, 7 December 2019
...utdegree]. If this value is not uniform, an '''average branching factor''' can be calculated <ref>[https://en.wikipedia.org/wiki/Branching_factor Branchin
...tps://www.stmintz.com/ccc/index.php?id=69483 Please, say in few words what can reduce the "branching factor"] by [[Leonid Liberman|Leonid]], [[CCC]], Sept
9 KB (1,311 words) - 18:22, 12 March 2021
which can be reformulated for both cases using [https://en.wikipedia.org/wiki/Floor_a
3 KB (445 words) - 13:56, 7 December 2019
...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
...[[Root|root]] the [[Score|score]] of a mated player is the worst score one can get, that is a negative score with the greatest absolute value of the score
16 KB (2,217 words) - 21:27, 5 August 2021
...s) by a [[Pawn Push#DoublePush|double pawn push]]. This double pushed pawn can then be captured the same way, as it would only performed a single push - b
8 KB (1,231 words) - 09:55, 22 May 2021
...vious example being a [[KPK|KPK endgame]], where [[Opposition|opposition]] can be regarded as a special case of zugzwang.
9 KB (1,237 words) - 17:10, 16 November 2020
...ccur in late [[Endgame|endings]] only, where it is a regular resource that can enable the player with the inferior position to draw the game, i.e. in [[KP
12 KB (1,753 words) - 21:35, 23 February 2021
To find the pawn set, which can actually capture, on the fly, we can start with the target squares as well:
6 KB (623 words) - 11:40, 26 September 2020
...avily depends on the [[Board Representation|board representation]], and it can be generalized into two types, pseudo-legal and legal move generation.
...me color square]] as the opponent king if they are to attack it. And rooks can only generate at most 2 checking moves...to the [[Intersection Squares|squa
26 KB (3,630 words) - 18:39, 12 March 2022
...unique with respect to [[Distance|distance]] and direction. That way, one can greatly reduce the size of the lookup [[Array|array]] to only 240 instead o
31 KB (3,214 words) - 14:48, 20 August 2020
.../en.wikipedia.org/wiki/Cartesian_coordinates cartesian coordinate system], can be determined by x- and y-coordinates, here the labels of [[Files|files]] a
5 KB (716 words) - 18:40, 25 February 2021
...rom square is omitted. Otherwise, if two (or more) pieces of the same kind can move to the same square, the piece's initial is followed by (in descending
With the [[Chess Engine Communication Protocol]] version 2, one can use the feature command to select SAN as move format for both input and out
19 KB (2,798 words) - 14:04, 3 December 2021
...m/fsmosca/chess-artist GitHub - fsmosca/chess-artist: A python script that can annotate chess games in pgn file ...] <ref>[http://www.talkchess.com/forum/
7 KB (1,075 words) - 18:49, 11 November 2021
* [http://www.talkchess.com/forum/viewtopic.php?t=63572 What can be said about 1 - 0 score?] by [[Kai Laskos]], [[CCC]], March 28, 2017 » [
12 KB (1,780 words) - 12:27, 7 November 2021
...om 'A' to 'H' (or with lower case letters 'a' to 'h'), so that each square can be uniquely addressed via concatenated file- and rank labels. The lower lef
3 KB (469 words) - 22:50, 8 March 2019
...and black and white colors alternate on consecutive ranks (and files), one can not use the simple [https://en.wikipedia.org/wiki/Parity_%28mathematics%29
...hite squares. Since we need to mask off the least significant bit only, we can save masking off the file from square, because upper bits have no influence
5 KB (707 words) - 20:36, 28 September 2018
...4. The a1-scaled mask is shifted left left by the "smallest" square, which can be done by multiplication with the isolated LS1B of the in-between set. The
15 KB (1,911 words) - 01:00, 29 October 2020
...he same File, if their file distance is zero. The masking of the file bits can be done after the subtraction.
3 KB (470 words) - 14:08, 20 August 2020
...merates all Diagonals, unfortunately with negative numbers involved, which can easily adjusted by adding seven.
10 KB (1,154 words) - 16:23, 20 August 2020
...UpOccluded() is based on a Kogge-Stone parallel prefix network, because it can be implemented very easily in software. The diagram below (trust me, it rea
13 KB (1,712 words) - 22:32, 11 April 2021
opposing [[Pawn|pawns]] in contact that can [[Captures|capture]] each other. In chess the term lever is also used as ''
* '''Fork lever''' - A lever attacking two units at once (can include a piece).
5 KB (730 words) - 18:42, 25 February 2021
...west attack sets for a unique 1:1 source-target relationship. On demand we can use the union or intersection on the fly. Note that attack direction is rel
Otherwise, if the set of defenders was already determined (or vice versa), we can already take advantage of the unique target/source relation ship:
6 KB (403 words) - 10:51, 19 November 2020
Of course we can simply restore a filefill by zero-extending the fileset to a bitboard plus
7 KB (583 words) - 16:45, 25 June 2019
...on of white and black frontspans is called interspan. Obviously interspans can only occur on closed files. [[Rook|Rooks]] on interspans may have a hard ti
5 KB (530 words) - 09:25, 3 April 2020
Based on [[Pawns and Files (Bitboards)#Fileset|filesets]], we can simply determine the west- or east border-files of each island. By shifting
5 KB (713 words) - 09:24, 3 April 2020
...he pawn must be on a half-open file, and the number of defender pawns that can help the pawn advance are greater than or equal to the number of pawns whic
...le of the former candidate and becomes a passer. The black candidate on f4 can also force a passer. The helper on g4 compensates the sentry on g2. Usually
8 KB (1,181 words) - 18:44, 25 February 2021
...t-distance]] refers to [[Knight|knight]] moves. In a wider sense, distance can be interpreted as a generalization of [[Mobility|mobility]], for instance d
...iquely with respect to distance and [[Direction|direction]]. That way, one can greatly reduce the size of the lookup [[Array|array]] to only 240 instead o
16 KB (1,466 words) - 13:18, 6 March 2020
...spect to [[Distance]], Manhattan-Distance and [[Direction]]. That way, one can greatly reduce the size of the lookup [[Array|array]] to only 240 instead o
7 KB (951 words) - 00:12, 29 November 2019
...are is off the board. In both cases there is no intersection square, which can be combined by one test with 0x111. If AND 0x111 is false, we convert 0x88
22 KB (2,483 words) - 15:32, 16 August 2018
'''Irreversible Moves''' can not be reversed. Thus, they are either [[Captures|captures]] or [[Pawn Push
2 KB (276 words) - 11:45, 22 September 2018
...deeper. It corresponds to one level of the [[Search Tree|search tree]] and can act as index (ply-index) into a random accessible [[Stack|search stack]], a
2 KB (373 words) - 09:07, 30 April 2021
...to [[Checkmate|checkmate]] the opponent or when no sequence of legal moves can lead to checkmate.
11 KB (1,553 words) - 08:27, 3 December 2023
...ng of the nineties, when it has been proven that some [[Endgame|endgames]] can be won only in a larger number of moves, there has been an attempt to compl
7 KB (986 words) - 23:43, 21 March 2020
If neither side can castle, the symbol '-' is used, otherwise each of four individual [[Castlin
12 KB (1,705 words) - 08:47, 5 April 2022
If neither side can castle, the symbol '-' is used, otherwise each of four individual [[Castlin
10 KB (1,465 words) - 12:43, 26 May 2022
However, there are aspects of a [[Chess Position|chess position]], which can not generally restored from a child-position by unmaking a move, and which
7 KB (985 words) - 19:21, 25 February 2021
...Rights|castling rights]] and the [[Halfmove Clock|halfmove clock]], which can not [[Incremental Updates|incrementally updated]] during [[Unmake Move|unma
4 KB (594 words) - 11:32, 21 June 2020
* [https://www.stmintz.com/ccc/index.php?id=81949 Test suites - can they reliably predict ELO?] by [[Tom King]], [[CCC]], December 11, 1999
...hess.com/forum3/viewtopic.php?f=7&t=77777 Any Testsuites in EPD format you can recommend?] by [[Thomas Jahn]], [[CCC]], July 22, 2021
20 KB (2,671 words) - 21:31, 5 August 2021
...elf, but only affect performance (eg. [[Move Generation|move generation]]) can be tested with given fixed nodes, fixed time or fixed depth. In all other c
...game, ie. what the average quality of the games should be like. While one can test more changes in the a certain time at short time controls, it is also
21 KB (2,895 words) - 12:16, 4 February 2022
To calculate all eight [[Direction|directions]], one can actually do some simple [[Parallel Prefix Algorithms|parallel prefix stuff]
...e king. That is the union of own pieces with all opposite attacks, then we can simply calculate a move target set by relative complement of the king attac
13 KB (1,621 words) - 22:35, 5 August 2021
...s are combinations of the simpler ones. In fact, the chess position itself can be viewed as composed of 'primitive' or 'atomic' patterns (bitboards). Most
3 KB (390 words) - 14:12, 24 January 2019
...is left to the ambitious reader. In orthodox chess, west or east castling can simply distinguished from ordinal king moves due to the double king step, b
15 KB (1,901 words) - 19:03, 10 May 2018
A conversion of a quad-bitboard to 16 disjoint bitboards can be done quite efficiently with [[SSE2]] instructions:
...use this set as possible target set of check-breaking moves. Otherwise we can intersect it with own pieces to get pinned pieces (in total and by directio
12 KB (1,634 words) - 22:27, 1 December 2020
Surprisingly, thanks to xor, we can restore the initial value by a final:
Associative expressions can be bracketed any way you like, the result is the same. To see why this is i
19 KB (2,539 words) - 00:13, 12 April 2021
To combine the dumb7fill as attack getter, we also can take advantage of [[First Rank Attacks#TheOuterSquares|outer square]] occup
...d to consider wraps from H-file to A-file and vice versa. Fortunately this can be combined by intersection of ~A-file or ~H-file with the propagator:
18 KB (1,763 words) - 22:17, 24 January 2019
...trick only works on [[On an empty Board#PositiveRays|positive rays]], but can be applied for [[Files|files]] or [[Diagonals|diagonals]] with leading and
...peration principally works set-wise, even with multiple rooks per rank, it can be applied in [[Fill by Subtraction|SIMD- or SWAR-wise]] manner on all eigh
6 KB (563 words) - 21:33, 22 October 2019
...lled in a tight dependency chain such as this, where no other calculations can be completed while the processor waits for the memory read to complete.
...eliminates the lookup tables in favor of simple calculations, all of which can be done in the 64-bit [[MMX]] registers.
13 KB (2,038 words) - 09:02, 11 May 2018
Generally every Recursive Function can also be converted into an Iterative Search by means of replacing the functi
In the Recursive Search the function can store local values, this doesn't work for the Iterative Structure, as all p
9 KB (1,280 words) - 15:30, 25 December 2020
...octahedron in the middle, a full-size tetrahedron is formed; this process can be repeated recursively to form larger and larger tetrahedra, from [https:/
...wiki/Tower_of_Hanoi Tower of Hanoi] puzzle to move N disks from peg A to C can be reduced to three sub problems:
17 KB (2,415 words) - 12:56, 19 November 2021
...ogleplex Starthinker''' in the Seventh Galaxy of Light and Ingenuity which can calculate the trajectory of every single dust particle throughout a five-we
6 KB (739 words) - 13:37, 17 June 2021
...pproximation to best-first order, this establishes a good alpha value that can then be used to parallel search the later children. The algorithm in the 19
...essor could read the integer at the same time and both would see that they can freely access the memory.
86 KB (11,607 words) - 18:34, 11 November 2021
Multiple threads inside one process can share its [https://en.wikipedia.org/wiki/Global_variable global variables]
...>[http://www.talkchess.com/forum/viewtopic.php?t=57343&start=5 Re: scorpio can run on 8192 cores] by [[Daniel Shawul]], [[CCC]], August 29, 2015</ref> <re
26 KB (3,729 words) - 09:42, 7 October 2021
...ation time and their cardinality is reasonable small, a perfect hash table can be created, in which there will be no collisions, since each key has an uni
24 KB (3,307 words) - 21:17, 7 October 2020
...of computer memory and refers to the idea that any piece of [[Data|data]] can be stored and retrieved in a constant time, regardless of its physical loca
: [http://lwn.net/Articles/255364/ Memory part 5: What programmers can do]
52 KB (7,240 words) - 22:33, 16 May 2023
...OM|ROM]] or [https://en.wikipedia.org/wiki/Lookup_table#Hardware_LUTs LUT] can act as combinatorial logic. The inputs are the address, while one output is
...on of [[General Setwise Operations#DeMorganslaws|De Morgan's laws]] a NAND can also be interpreted as OR of inverted inputs, and NOR as AND of inverted in
19 KB (2,346 words) - 00:12, 1 January 2021
...hough not perfect, it is the best approximation available. Using this, how can we measure the quality of knowledge in the program?
...he other hand, represents the inaccuracies in the program' s knowledge. It can be introduced by several things, including knowledge that is missing, over-
43 KB (6,026 words) - 22:39, 18 November 2021
...the c file is [[Open File|open]] and so you give rooks a big bonus if they can get to the c file. Once you make this decision it doesn't change during the
* Can put huge amounts of knowledge in chess program with essentially no slowdown
24 KB (3,789 words) - 12:11, 9 December 2019
...Number Seven, Plus or Minus Two], where he researched how many numbers we can reliably remember a few minutes after we've been told them only once.
22 KB (2,972 words) - 13:20, 22 November 2020
...ing|beginning of the game]] in an '''Opening Book'''. The opening database can then be used as long as the opponent plays a new move from the database, so
...next move, but as this is quite time-consuming. In contrast, opening books can play opening moves almost instantly without searching nor heavy computing a
33 KB (4,574 words) - 04:04, 11 September 2021
* [http://dbacl.sourceforge.net/spam_chess-1.html Can a Bayesian spam filter play chess?] by [http://www.lbreyer.com/ Laird A. Br
22 KB (2,952 words) - 14:37, 17 July 2020
After (or during) learning, CHUMP can use its discrimination nets to suggests moves in certain positions. Again,
8 KB (1,121 words) - 16:11, 7 May 2020
...lo Brum]] ('''2009'''). ''[http://www.ncbi.nlm.nih.gov/pubmed/21585485 How Can Experts See the Invisible? Reply to Bilalic and Gobet]''. Cognitive Science
59 KB (8,002 words) - 09:43, 5 July 2021
...ecognizing]] a specific [[Material|material composition]], a chess program can probe, or in principle compute these tables to determine the outcome of pos
...ndgame by continuing searching, applying some endgame rules. Even the game can finish in this way but it is not in a perfect way: it takes time to compute
75 KB (10,498 words) - 05:16, 28 September 2022
* [[Michael Schlosser]] ('''1991'''). ''Can a Computer Compose Chess Problems?'' [[Advances in Computer Chess 6]]
...7/978-3-540-75538-8_13 A Retrograde Approximation Algorithm for One-Player Can’t Stop]''. [[CG 2006]]
32 KB (4,448 words) - 11:56, 4 April 2022
...intz.com/ccc/index.php?id=370997 Any programs besides Yace and Patzer that can use bitbase files] by [[Dann Corbit]], [[CCC]], June 17, 2004 » [[Patzer]
7 KB (1,010 words) - 11:44, 26 June 2021
...o the next [[Captures|capture]] or [[Pawn Push|pawn move]] by either side) can be very unnatural, it might be desirable to let the engine search on the wi
* Support [[Endgame Tablebases#DTZ50|DTZ50]] metric. That metric can help engines to have better results than [[Endgame Tablebases#DTM|DTM]] whi
40 KB (5,678 words) - 13:35, 7 December 2023
...SJE's]] generator). But if that piece happens to be on a1-d4 diagonal, one can restrict other piece to 'large' a1-h1-h8 triangle (exploit one more symmetr
# If there are two identical pieces (e.g. as in knnkp), one can order their locations - e.g. force second piece to occupy square with small
14 KB (1,987 words) - 11:18, 22 April 2021
...to use with some distance to the horizon. The up to 5-men tablebase files can be generated <ref>[https://sites.google.com/site/gaviotachessengine/Home/en
9 KB (1,130 words) - 18:53, 16 November 2020
* [http://en.chessbase.com/post/can-you-play-this-endgame- Can you play this endgame?], [[ChessBase|ChessBase News]], December 07, 2001
* [http://rjlipton.wordpress.com/2010/05/12/can-we-solve-chess-one-day/ Can We Solve Chess One Day? | Gödel's Lost Letter and P=NP] by [[Mathematician
9 KB (1,303 words) - 10:47, 30 December 2019
...count all the [[Leaf Node|leaf nodes]] of a certain [[Depth|depth]], which can be compared to [[Perft Results|predetermined values]] and used to isolate [
...move generator speed (versus move generator + make/unmake). However, this can cause some confusion when comparing Perft values and may make the task of c
30 KB (4,128 words) - 05:07, 16 March 2024
...hers Wait Concept''. Internal report, [[University of Alberta]]</ref> . It can be explained by the fact that within high-level languages and their compile
14 KB (1,962 words) - 23:31, 2 November 2019
...mory area, becoming a so called "split block". Owner and helper processors can now extract moves from this shared data to search in parallel <ref>[http://
20 KB (2,160 words) - 09:44, 7 October 2021
...alkchess.com/forum/viewtopic.php?t=65844 Lazy SMP >4 Thread Slowdown] by [[Can Cetin]], [[CCC]], November 29, 2017 » [[Thread]]
18 KB (2,492 words) - 21:16, 28 March 2022
The keyword "'''cilk'''" defines a function which can [https://en.wikipedia.org/wiki/Spawn_%28computing%29 spawned] as a new [htt
...mand for something is that it must work both in windows and linux before i can use it; interface is of course something different) otherwise i might have
11 KB (1,549 words) - 14:23, 9 December 2020
...al transposition table distributed across the processors. We found that we can use the critical path C and the total work W to predict the performance of
...he Cilk project has achieved more than I ever expected. Charles' influence can also be seen in this write-up itself. He has helped me turn this thesis int
10 KB (1,555 words) - 11:46, 15 September 2020
The total size of the triangular array in moves can be calculated by the [https://en.wikipedia.org/wiki/Triangular_number Trian
10 KB (1,366 words) - 15:38, 24 June 2021
...king, and for each [[Squares|square]], search for a [[Pieces|piece]] that can get there and [[Check|check]] (one-many), or converge from the squares alon
16 KB (2,452 words) - 12:55, 25 April 2019
...If in a line the side to move must be mated in the next move, prune if it can check the attacker and so that there is no way to avoid the check and mate
...to move. Very stringent parameters can lead to solutions very quickly and can be extended gradually.
6 KB (907 words) - 19:51, 14 November 2020
...ves yields in the values of ''false'', ''true'' or ''unknown'', the latter can be expanded to become a [[Frontier Nodes|frontier node]]. For backpropagati
...s by using a second PNS instead of calling ''evaluate'', which child-nodes can be discarded afterwards <ref>[[Dennis Breuker]] ('''1998'''). ''[http://www
32 KB (4,387 words) - 22:29, 17 June 2021
...more step toward the goal of eventually obtaining computer programs which can solve intellectually difficult problems.
...mputer experiments in the artificial intelligence field, these experiments can perhaps serve as a model for future work.
16 KB (2,311 words) - 17:10, 16 November 2020
...l game tree has been analyzed, it will appear to the system that the event can be avoided when in fact this is not the case. Beside obligatory [[Quiescenc
>not much you can do... horizon effect happens anytime you stop the search
14 KB (2,095 words) - 10:28, 11 September 2020
...and''' [[Unmake Move|unmake]]. Irreversible aspects of the position, which can not generally restored from a child-position by unmaking a move, need to be
4 KB (617 words) - 11:34, 21 June 2020
...square. In case of disambiguating moves if two (or more) identical pieces can move to the same square, the file of departure, or if files are identical a
This method can be refined if variable-length encoding is allowed. This is especially usefu
26 KB (3,551 words) - 10:32, 4 November 2021
...de on the internal board. In unmake move, reversible aspects of a position can be [[Incremental Updates|incrementally updated]] by the [https://en.wikiped
5 KB (696 words) - 11:33, 21 June 2020
..., which decreases their individual influence accordantly. King and knights can reach every square on the otherwise empty board, but may take more time wit
25 KB (2,755 words) - 17:33, 2 July 2021
'''En prise''' (from French "can be taken") <ref>[http://www.chesshistory.com/winter/extra/earliest.html Ear
2 KB (327 words) - 19:56, 15 July 2019
...e phase]], an exposed [[King|king]] and the presence of the opponent queen can be considered as well in that evaluation term.
3 KB (470 words) - 10:12, 28 June 2020
...e phase]], an exposed [[King|king]] and the presence of the opponent queen can be considered as well in that evaluation term.
975 bytes (141 words) - 20:00, 15 July 2019
* [[Cameron Browne]], ''What Can Game AI Teach Us''?
* [[Dap Hartmann]], ''How can Humans learn from Computers?'' Search and Knowledge for Human and Machine P
173 KB (22,418 words) - 20:37, 6 April 2022
...ur queen, it's phenomenally brilliant. You are winning the game. So if you can find a way to get your queen out there and sacrifice her, well, you've won.
13 KB (1,851 words) - 23:00, 8 July 2019
...ld defend my thesis by teleconference. Though that proved unnecessary, you can imagine how much that meant to me. We continued to correspond and occasiona
8 KB (1,282 words) - 20:36, 5 December 2019
...method, it is doubtful anyone will ever try it. The fact that neural nets can be the difference is documented by the success of [[Gerald Tesauro|Tesauro'
...ld defend my thesis by teleconference. Though that proved unnecessary, you can imagine how much that meant to me. We continued to correspond and occasiona
32 KB (4,861 words) - 17:13, 16 November 2020
...//www.tandfonline.com/doi/abs/10.1080/0161-110191889897 Genetic Algorithms Can be Used to Obtain Good Linear Congruential Generators]''. [https://en.wikip
32 KB (4,470 words) - 18:52, 30 June 2021
...also useful for things like opening books, where the positions in the book can be stored by hash key and be used portably across machines, considering [[E
...or-operation is [https://en.wikipedia.org/wiki/Involution own inverse] and can be undone by using the same xor-operation again, is often used by chess eng
24 KB (3,625 words) - 19:48, 7 February 2021
...symmetric evaluation in relation to the [[Side to move|side to move]]. We can see that one must not score the move per se – but the result of the move
Here, we can see that the [[Score|score]] is returned as a result of subtracting the cur
36 KB (4,737 words) - 09:34, 9 September 2021
...he less time you have to search, and therefore, the less deep your program can see.
5 KB (777 words) - 00:37, 16 October 2020
The inverse relationship can be given as
...hip between the equivalent Elo rating advantage R and the pawn advantage P can be given as
8 KB (1,023 words) - 10:05, 11 April 2021
...the rook pawns and increasing the value of the central pawns (though this can be done in the [[Piece-Square Tables|piece-square tables]] as well)
Using values like these blindly can lead to bad play. Most programs uses special code or tables to detect drawn
16 KB (2,238 words) - 10:38, 22 April 2021
...his scheme is fast, since the evaluation term from the piece square tables can be [[Incremental Updates|incrementally updated]] as [[Moves|moves]] are [[M
The same technique can be used for a more subtle evaluation terms, instead of one fixed value for,
17 KB (2,340 words) - 21:03, 28 March 2022
...rate for such table is typically above 95%. Anything strictly pawn related can be stored in this hash table, including [[King Safety#PawnShield|pawn shiel
6 KB (800 words) - 23:51, 6 July 2020
...of detailed knowledge about doubled pawns, which rarely gets implemented, can be found in the article ''All About Doubled Pawns'' by [[Larry Kaufman]] <
5 KB (726 words) - 20:29, 27 June 2020
...n isolated pawn in the [[Center|center]] as weaker than on the wing, as it can be attacked from more directions <ref> [https://www.stmintz.com/ccc/index.p
...n IQP gets greater [[Mobility|mobility]], therefore this kind of positions can be used for balancing the evaluation functions parameters.
2 KB (311 words) - 18:45, 25 February 2021
* [http://mlwi.magix.net/bg/sentrychess.htm Sentry Chess - the pawn can sometimes capture northward]
1 KB (188 words) - 18:45, 25 February 2021
...6486-6</ref> , a '''stop square''' of a [[Pawn|pawn]] is a square where it can arrive in one non-capturing move, a [[Pawn Push|pawn push]]. <span id="Tele
1 KB (193 words) - 10:31, 25 July 2020
...en, assuming non-capturing [[Pawn Push|pawn pushes]]. The promotion square can easily calculated from the pawn [[Origin Square|origin]] and [[Color|color]
1 KB (136 words) - 13:48, 15 May 2018
Coding pawn center evaluation routine, one can
5 KB (704 words) - 18:50, 25 February 2021
...y|trajectory]] analysis to determine (advanced) passers are unstoppable or can be blocked or captured in time.
4 KB (488 words) - 00:00, 21 January 2020
...ppable Passer|unstoppable passed pawns]]. A good example of pawn race code can be found in the sources of [[Crafty]].
* Can the opponent king use the [[Rule of the Square|rule of the square]] to its
3 KB (386 words) - 18:46, 25 February 2021
...by a bishop blocking or controlling their stop squares. The opponent king can also hold the chain on both [[Stop Square|stop squares]], but is often obli
2 KB (256 words) - 22:42, 4 May 2020
pawn can safely promote
7 KB (1,075 words) - 09:26, 3 April 2020
...edia]</ref>, demonstrates how a king can make multiple threats, and how it can take more than one path to a given location with the same number of moves.
3 KB (480 words) - 20:18, 15 May 2018
...hich we do not have a [[Pawn|pawn]], but the opponent has at least one. It can be used to increase the vertical [[Mobility|mobility]] of the major [[Piece
632 bytes (99 words) - 22:11, 15 May 2018
...g two unopposed major pieces on it with the king trapped on the 8th rank - can have a devastating effect.
1 KB (212 words) - 18:47, 25 February 2021
...hange sacrifice much less profitable) or if opponent has no minors that he can exchange for an outpost piece.
4 KB (552 words) - 18:50, 25 February 2021
* the side with a knight can defend by the means of blockade on the squares that are out of reach for th
12 KB (1,294 words) - 12:20, 24 December 2019
...vertical mobility gets priority over horizontal mobility. Also, if a piece can move to the square of another friendly piece, sometimes that move is also c
...luates so-called '''safe mobility''' - counting only squares where a piece can move without being [[En prise]]. This might be quite expensive, unless a pr
20 KB (2,851 words) - 19:42, 2 July 2021
...Slav_formation Slav formations] it is undesirable to play c4-c5 (such code can be found in [[Phalanx]])
2 KB (246 words) - 21:03, 29 June 2020
...ily pushed over the horizon. Most of the time the best thing such a bishop can do is to [[Sacrifice|sacrifice]] itself for a (second) pawn, so its value s
1 KB (241 words) - 13:29, 16 May 2018
...ilar to the one described in [[Toga Log#UserManual|Toga log user manual]], can work as follows: we have two variables, '''attackingPiecesCount''' and '''v
...of such approach is twofold. '''(1)''' other factors beside these attacks can be counted. For example, Stockfish adds 6 attack units for a safe queen con
13 KB (1,795 words) - 22:20, 29 March 2021
...surface contains closed timelike curves circling the x1 axis, though these can be eliminated by "unrolling" the embedding (more precisely, by taking the [
8 KB (1,057 words) - 18:47, 25 February 2021
...That bonus is useful mainly in the opening and middle game positions, but can be counterproductive in the [[Endgame|endgame]].
5 KB (710 words) - 21:20, 15 August 2018
Some endgames are extensively covered by theory, and for that reason one can supply a vast number of heuristics for playing them. Typical examples inclu
...e to win/lose assuming perfect play. With the help of those, chess engines can simply lookup, if it is advisable to do a certain exchange or not, as well
16 KB (2,179 words) - 22:04, 30 November 2021
...side has a [[Pawn|pawn]] on the "a" or "h" file and the [[Bishop|bishop]] can never cover the [[Promotion Square|promotion square]] because of its "wrong
4 KB (661 words) - 11:13, 22 September 2018
...is page is devoted to listing some of them. More of that kind of knowledge can be found in the [[KPK]] section.
...roduce another class of drawn positions: those that cannot be claimed, but can be evaluated as draws:
6 KB (939 words) - 11:50, 26 June 2021
...nts and performs the evaluation of a [[Chess Position|position]]. The name can be quite misleading, as sometimes different functions, called from within t
741 bytes (103 words) - 16:19, 16 May 2018
...urs when two positions are assessed as markedly different, even though one can be reached from the other by a short sequence of reasonable moves. This usu
2 KB (315 words) - 10:23, 1 September 2018
Tapered Eval is done as follows in [[Fruit]] (similar implementations can be found in engines like [[Crafty]] and [[Stockfish]] etc.). The scaling lo
10 KB (1,347 words) - 13:56, 24 June 2021
...ctronics/comments/217j2u/how_can_you_create_an_analog_sigmoid_voltage/ How can you create an analog sigmoid voltage transfer function (from simple parts)?
8 KB (1,084 words) - 21:41, 21 May 2019
* [[Alexis Drogoul]] ('''1993, 1995'''). ''When Ants Play Chess (Or Can Strategies Emerge From Tactical Behaviors?)'' [http://www.informatik.uni-tr
10 KB (1,440 words) - 14:19, 7 December 2019
* When asked, it can return the position of either king
* When asked, it can return the number of white/black pawns, bishops, knights or rooks
5 KB (727 words) - 13:38, 25 April 2019
...n with looking at pawns' constellation is called for, but at this stage we can't afford this.
Additionally we can see that they satisfy another relationship:
11 KB (1,941 words) - 22:15, 23 February 2021
...ablation study they considerably improve performance. Their final networks can consistently defeat [[Gnu Go]], indicating it is state of the art among pro
4 KB (591 words) - 11:23, 16 November 2019
This can be further reduced by mirroring the board, considering symmetric positions
8 KB (1,205 words) - 11:40, 15 June 2021
