Search results

Jump to: navigation, search
  • ...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

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)