...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
