...bit word]] or register covers the whole board. Even more bitboard friendly is [[Checkers]] with 32-bit bitboards and less [[Pieces#PieceTypeCoding|piece-
Of course bitboards are not only about the existence of pieces - it is a general purpose, '''set-wise''' data-structure fitting in one 64-bit regi
26 KB (3,485 words) - 18:37, 12 March 2022
Computer chess is actively discussed in several Discord channels:
* [https://groups.google.com/forum/#!forum/shogi-l SHOGI-L]
7 KB (997 words) - 10:20, 22 February 2024
Several lists of computer chess programs or '''Chess engines''', which is the chess playing part of the chess program, relying on proprietary or [[Pr
* [[:Category:Shogi]]
33 KB (3,508 words) - 02:43, 20 October 2022
A '''Protocol''' is a [https://en.wikipedia.org/wiki/Formal_methods formal description] of [htt
The aim of computer chess protocols is to define a standard to let a chess engine communicate with [[User Interfac
9 KB (1,194 words) - 09:29, 3 July 2021
...he latter situation might indicate that some kind of merging or re-editing is necessary.
* [[CSA]] - Computer Shogi Association
10 KB (1,192 words) - 22:14, 18 November 2020
...[Marco Costalba]], [[CCC]], October 02, 2011</ref>. From that, the project is being developed and maintained by the [[:Category:Stockfish Contributor|Sto
A synergy effect with the [[Shogi]] community led to the promising branch of [[Stockfish NNUE]], courtesy of
65 KB (8,362 words) - 13:19, 1 March 2024
* [[World Computer Shogi Championship]]
* [http://www.talkchess.com/forum/viewtopic.php?t=65061 What is a Match?] by [[Henk van den Belt]], [[CCC]], September 01, 2017
9 KB (1,042 words) - 14:09, 11 October 2023
...fish#TestingFramework|Testing Framework]] called ''Fishtest''. Leela Chess is [[:Category:Open Source|open source]], released under the terms of [[Free S
The goal is to build a strong chess playing entity following the same type of [[Deep Le
35 KB (4,831 words) - 15:09, 10 August 2023
Don Beal is author and co-author of following chess programs <ref>[https://www.game-ai-
...with the Null Move.'' [[Advances in Computer Chess 5]], a revised version is published ('''1990''') under the title ''A Generalized Quiescence Search Al
14 KB (1,937 words) - 17:07, 16 November 2020
...ary Games''. [[Advances in Computer Games 9]], pp. 157-174. [http://www.ru.is/faculty/yngvi/pdf/BjornssonM01b.pdf pdf]</ref>, with the aim to improve the
...h"></span>A difficulty in tuning and automated tuning of engine parameters is measuring [[Playing Strength|playing strength]]. Using small sets of [[Tes
91 KB (12,241 words) - 21:01, 28 March 2022
...e which is presumed to be the common ancestor of the games of [[Chess]], [[Shogi]] and [[Chinese Chess]] <ref>[https://en.wikipedia.org/wiki/Origins_of_ches
3 KB (396 words) - 11:20, 14 December 2019
...nd the value of White's position after each is calculated; the move played is that which maximizes this value. In calculating the value of a position, th
...squares to which that piece might legally move (whether or not that square is occupied by a piece) added up. Thus an opening move of e4 increases the val
14 KB (2,114 words) - 20:50, 8 December 2019
...[[Karen Simonyan]], [[Demis Hassabis]] ('''2017'''). ''Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm''. [https://ar
MCTS is based on randomized explorations of the [[Search Space|search space]]. Usin
76 KB (10,188 words) - 16:36, 1 December 2021
...zing player is assured of and the maximum score that the minimizing player is assured of respectively. Consider the following example...
...lower bound]]. We know that we can achieve at least that, so anything that is clearly worse can be ignored.
37 KB (5,099 words) - 16:20, 1 December 2021
...nstance as history score chart indexed by ply. Related to Machine learning is [https://en.wikipedia.org/wiki/Evolutionary_computation evolutionary comput
...rol in Adversary Games''. [[Advances in Computer Games 9]], [http://www.ru.is/faculty/yngvi/pdf/BjornssonM01b.pdf pdf]</ref> or [[Time Management|time us
137 KB (18,484 words) - 00:18, 19 December 2021
...But what if you were to search one move deeper and find that the next move is PxQ? You didn't win a pawn, you actually lost a queen. Hence the need to ma
...rches are typically very short, about 50%-90% nodes are spent there, so it is worthwhile to apply some [[Pruning|pruning]] there. Apart from not trying m
25 KB (3,459 words) - 10:30, 15 June 2021
...[[Upper Bound|upper bound]]. The none [[Recursion|recursive]] [[ProbCut]] is applied at both types of none [[Node Types#PV|PV-nodes]]. Rather than immed
...ory Pruning <ref>[https://www.stmintz.com/ccc/index.php?id=434817 Re: What is History Pruning?] by [[Tord Romstad]], [[CCC]], July 03, 2005</ref>
16 KB (2,174 words) - 11:35, 16 June 2021
...th]] of the subtree under the null move. The value of this depth reduction is known as [[Depth Reduction R|R]].
...It determines the answer by assuming Black does nothing on his turn, that is, by playing a "No Move" and then seeing if White can enforce an immediate c
40 KB (5,641 words) - 18:55, 25 December 2020
...not show an escape. ProbCut is a generalization of this method in that it is game independent. It was tested by incorporating it in Buro's already stron
...of a deeper search with depth ''d > d'''. A way to model this relationship is by means of a [https://en.wikipedia.org/wiki/Linear_model linear model]:
17 KB (2,330 words) - 12:12, 2 May 2020
...current position. If this does not exceed alpha then the futility pruning is triggered to skip this move (which further means setting a flag like ''f_pr
Futility pruning is not used when the [[Side to move|side to move]] is in [[Check|check]] , or when either [[Alpha|alpha]] or [[Beta|beta]] are cl
15 KB (2,022 words) - 09:48, 8 July 2021
...93e071c2b739f164ae5ffa6c Efficiency of three Forward-Pruning Techniques in Shogi: Futility Pruning, Null-move Pruning, and Late Move Reduction (LMR)]''. [ht
* [https://www.stmintz.com/ccc/index.php?id=434809 What is History Pruning?] by [[David Dahlem]], [[CCC]], July 03, 2005
17 KB (2,291 words) - 11:20, 4 April 2022
...termine if a move is worth searching and do not need the actual value. SEE is useful in [[Move Ordering|move ordering]], [[Futility Pruning|futility prun
...2009</ref> . In most programs, however, an [[Iteration|iterative]] version is used, as demonstrated in [[SEE - The Swap Algorithm]] with [[Bitboards|bitb
20 KB (2,822 words) - 10:43, 1 August 2022
...ption, "With the Vigilance Committee in the East End". This specific image is entitled "A Suspicious Character", [https://en.wikipedia.org/wiki/Jack_the_
...[Fail-High|fails high]], a [[Quiet Moves|quiet move]] that caused a cutoff is stored in a table indexed by [[Ply|ply]], typically containing two or three
11 KB (1,583 words) - 09:01, 20 July 2021
...move in the game tree. This move will not obtain a high history score and is therefore ranked quite low in the move ordering.
The idea is to make the history scores (<span style="background-color: #d2d2d2">hhScore
6 KB (851 words) - 17:48, 19 December 2018
...04 Jaap van den Herik's ICGA Tournaments]</ref> . Since the early 90s Jaap is Tournament director, organizer and arbiter of [[ICCA]] and [[ICGA]] compute
...computer%20van%20de%20toekomst.pdf pdf] hosted by [[Hein Veldhuis]]</ref>, is it [[Gambiet]]?
62 KB (8,279 words) - 13:30, 17 November 2021
...xity] of 10<span style="font-size: 80%; vertical-align: super;">123</span> is based on an [[Branching Factor|average branching factor]] of 35 and an aver
This page is about the basic chess items, [[Chessboard|chessboard]], [[Pieces|pieces]] a
40 KB (5,362 words) - 20:47, 22 November 2023
'''Castling''' is a composite [[Moves|move]] of [[King]] and [[Rook]] at the same time. In st
While castling is [[Irreversible Moves|irreversible]] with respect to the [[Castling Rights|c
5 KB (734 words) - 00:33, 19 August 2022
'''Generation''' of [[Moves|moves]] is a basic part of a chess engine with many variations concerning a [https://e
...left up to the [[Make Move|move-making function]] to test the move, or it is even possible to let the king remain in check and only test for the capture
26 KB (3,630 words) - 18:39, 12 March 2022
...fects a small fraction of the complete board structure and the update cost is small compared to a copy of the whole board. Also one usually doesn't need
It is a good idea to compare incremental updated stuff like zobrist keys with its
7 KB (985 words) - 19:21, 25 February 2021
...ocessors is an interesting domain of research, as traversing a search tree is inherently serial. Several approaches have been devised, with the most popu
...le entries. Many programs used this if a "quick and dirty" approach to SMP is needed. It had the reputation of little speedup on a mere 2 processors, and
86 KB (11,607 words) - 18:34, 11 November 2021
.../en.wikipedia.org/wiki/Semantics semantic] unit, a meaningful pattern that is recognized at a glance by a chess master. Reasoning about a position in ter
* [[Herbert Simon]] ('''1974'''). ''How big is a chunk''? [https://en.wikipedia.org/wiki/Science_%28journal%29 Science], V
22 KB (2,972 words) - 13:20, 22 November 2020
...ский район - «Plan is law, fulfillment is duty, over-fulfillment is honor!» Building Olkhovskaya Batkovsky - peat enterprise [http://www.stad.
Long-range planning by human chess players is usually made on the basis of [https://en.wikipedia.org/wiki/Reason reasonin
25 KB (3,365 words) - 11:19, 6 August 2021
is used to assign a label to an input value <ref>[https://en.wikipedia.org/wik
...96'''). ''Using Pattern Recognition and Selective Deepening to Solve Tsume Shogi''. [[Conferences#GPW|3rd Game Programming Workshop]], [http://citeseerx.ist
22 KB (2,952 words) - 14:37, 17 July 2020
...org/wiki/Appleton-Century-Crofts Appleton-Century-Crofts], New York</ref>, is the study of how people or [https://en.wikipedia.org/wiki/Intelligent_agent
* [[Herbert Simon]] ('''1974'''). ''How big is a chunk''? [https://en.wikipedia.org/wiki/Science_%28journal%29 Science], V
59 KB (8,002 words) - 09:43, 5 July 2021
...e [https://en.wikipedia.org/wiki/Proof_game proof game] whether a position is legal in the sense that it could be reached by a series of [[Legal Move|leg
...White the winning side. Files of sets of chess positions, where a one-bit is associated with the Gödel number of a position, are successively manipulat
32 KB (4,448 words) - 11:56, 4 April 2022
...e|makemove]]/[[Unmake Move|undomove]], which gives much faster results and is a better indicator of the raw move generator speed (versus move generator +
...]] node counts, with a small chance for inaccurate results. Sometimes this is used as a sanity check to make sure the hash table and keys are working cor
30 KB (4,128 words) - 05:07, 16 March 2024
A '''Move List''' is a data structure inside a chess program with the aim to collect, administra
...and played after search, or a move was entered by the opponent player, it is stored under the [http://en.wiktionary.org/wiki/post-increment post increme
11 KB (1,559 words) - 11:14, 31 May 2021
...al, Vol. 35, No. 3]]</ref> <ref>[[Jaap van den Herik]] ('''2012'''). ''All is Proof Numbers''. [[ICGA Journal#35_3|ICGA Journal, Vol. 35, No. 3]] (editor
...if at least one child is ''false'', else ''unknown'' if at least one child is ''unknown'', otherwise ''true''. At OR-nodes, ''false'' and ''true'' are in
32 KB (4,387 words) - 22:29, 17 June 2021
...ance of [[Material|material]], the aggregated point values for both sides, is usually the most influential term.
...and '''40'''. These values are good, but this modification of the argument is artificial.
18 KB (2,432 words) - 20:40, 25 May 2021
The '''ICGA Journal''', formerly, until 1999, the ICCA Journal is the quarterly published magazine, received by all [[ICGA]] members <ref>[ht
* [[Monroe Newborn|Monty Newborn]], ''The laughing is over''.
173 KB (22,418 words) - 20:37, 6 April 2022
.../en.wikipedia.org/wiki/Probability probability] W and the pawn advantage P is
...s taken. This was considered reasonable because the material configuration is the most important quantity that affects the result of a game.
8 KB (1,023 words) - 10:05, 11 April 2021
...e of each [[Color|color]], and values assigned to each square. This scheme is fast, since the evaluation term from the piece square tables can be [[Incre
...nstead of one fixed value for, say, an [[Isolated Pawn|isolated pawn]]. It is also possible to use piece-square tables for [[Move Ordering|move ordering]
17 KB (2,340 words) - 21:03, 28 March 2022
...Trail]] of the [https://en.wikipedia.org/wiki/Ruhr Ruhr area], "The dragon is a symbol of physical strength and intelligence with respect to the snake th
...ves Observation'' ('''WMO'''), which states the practical playing strength is not primarily determined by the quality of the players best moves nor avera
54 KB (7,310 words) - 11:16, 4 April 2022
'''XBoard''' is a graphical user interface for the [[Chess Engine Communication Protocol]]
...Pettus]], [[Computer Chess Forums|Winboard Forum]], October 19, 2013 » [[Shogi]]
12 KB (1,656 words) - 05:19, 23 July 2022
...on protocol] for chess engines to play [[Games|games]] automatically, that is to communicate with other programs including [[GUI|Graphical User Interface
...but also keeps the Model with its internal [[Chess Game|game states]]. It is also an "arbiter" instance to decide about the outcome of the game, for ins
25 KB (3,536 words) - 05:36, 9 September 2021
...notion of cumulative [https://en.wikipedia.org/wiki/Reward_system reward] is maximized. In computer games, reinforcement learning deals with adjusting f
...to get more information about the expected payoffs of the other machines - is also faced in reinforcement learning.
54 KB (7,025 words) - 12:47, 14 March 2022
...ia]</ref>. In the domain of computer games and computer chess, TD learning is applied through self play, subsequently predicting the [https://en.wikipedi
...ost simply a single neuron [[Neural Networks#Perceptron|perceptron]], that is a linear [[Evaluation|evaluation]] function ...
46 KB (6,248 words) - 13:59, 23 May 2021
...s, whose dot-product activates or controls the post-synaptic output, which is the base of Neural network learning <ref>[https://en.wikipedia.org/wiki/Bio
...[https://en.wikipedia.org/wiki/Loss_function cost or loss function], which is a task in [https://en.wikipedia.org/wiki/Mathematical_optimization mathemat
156 KB (21,084 words) - 18:34, 12 March 2022
...i/Netherlands Netherlands], on June 27 and 28, [[Timeline#1996|1996]]. ACC is the conference of the [[ICCA]]. Invited speaker [[Ken Thompson]] talked abo
...'). ''Diminishing Returns for Additional Search in Chess.'' [http://www.ru.is/faculty/yngvi/pdf/JunghannsSBBM97.pdf pdf]
6 KB (863 words) - 14:04, 28 January 2020
...[Heinz Nixdorf MuseumsForum]] (HNF), Fürstenallee 7, 33102 Paderborn. ACC is the conference of the [[ICCA]]. 14-15 accepted papers and 5 invited papers
...'Variable-Depth Search.'' [[Advances in Computer Games 9]], [http://www.ru.is/faculty/yngvi/pdf/MarslandB01.pdf pdf]
5 KB (625 words) - 14:04, 28 January 2020
