Search results

Jump to: navigation, search
  • '''[[Main Page|Home]] * [[Engines]] * Kaissa''' ...roblems and Methods of Search Reduction for them''. [[Advances in Computer Chess 1]].</ref>.
    54 KB (7,939 words) - 06:55, 24 September 2023
  • '''[[Main Page|Home]] * [[Engines]] * Mate-in-two''' ...] from [http://www.computerhistory.org/chess/index.php History of Computer Chess], [[The Computer History Museum]]</ref> ]]
    8 KB (1,005 words) - 17:35, 23 April 2018
  • ...f>, with the aim to improve the [[Playing Strength|playing strength]] of a chess engine or game playing program. Evaluation tuning can be applied by [[Autom ...cks adequate diversity for a reliable strength predication. In particular, solving test-positions does not necessarily correlate with practical playing streng
    91 KB (12,241 words) - 21:01, 28 March 2022
  • '''[[Main Page|Home]] * [[Engines]] * Pioneer''' ...eer was never completed in a way that it could play a [[Chess Game|game of chess]] in public under tournament conditions <ref>[https://www.stmintz.com/ccc/i
    38 KB (4,367 words) - 09:31, 28 March 2021
  • '''[[Main Page|Home]] * [[Engines]] * Shy''' ..., Shy and the Austrian [[Merlin]] were based on the [[Pascal]] source of [[Chess 0.5]] by [[Larry Atkin]] and [[Peter W. Frey]] as published 1978 in [[Byte
    5 KB (808 words) - 10:10, 29 February 2020
  • ...''[http://www.ke.tu-darmstadt.de/bibtex/publications/show/2321 Monte Carlo Chess]''. B.Sc. thesis, [[Darmstadt University of Technology]], advisor [[Johann ...as a {https://en.wikipedia.org/wiki/Multi-armed_bandit multi-armed bandit] problem. [[Christopher D. Rosin#PUCT|PUCT]] modifies the original policy by approxi
    76 KB (10,188 words) - 16:36, 1 December 2021
  • ...m to change its behavior based on data, which for instance occurs during [[Chess Game|game playing]] against a variety of opponents considering the final ou =Learning inside a Chess Program=
    137 KB (18,484 words) - 00:18, 19 December 2021
  • '''[[Main Page|Home]] * [[Engines]] * NSS Chess Program''' ...71221115817/http://classicchess.googlepages.com/Chess.htm Classic Computer Chess - ... The programs of yesteryear] by [[Carey Bloodworth|Carey]], hosted by
    7 KB (1,048 words) - 13:54, 7 December 2019
  • Modern engines, like [[RobboLito]] or [[Stockfish]], start with a rather small aspiration ...frm/thread/8ad0cbc2b137dbf3 Aspiration Rules...] by Chris Pile, [[Computer Chess Forums|rgcc]], February 5, 1999
    9 KB (1,262 words) - 00:12, 1 February 2022
  • '''[[Main Page|Home]] * Chess''' [[FILE:Breaking Point 1.png|border|right|thumb|Chess <ref>An [https://commons.wikimedia.org/wiki/File:Breaking_Point_1.png illus
    40 KB (5,362 words) - 20:47, 22 November 2023
  • '''[[Main Page|Home]] * [[Chess]] * Checkmate''' ...ve it from attack on the next move. Checkmate is the object of the game of chess, it ends with the mate giving player as the winner, and the mated player th
    16 KB (2,217 words) - 21:27, 5 August 2021
  • ...y [[Dann Corbit]] that is designed to help [[Automated Tuning|tune]] chess engines (2008) * [[Win at Chess]]
    20 KB (2,671 words) - 21:31, 5 August 2021
  • ....umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bc6 Chess in the Art of Samuel Bak], [http://www.chgs.umn.edu/ Center for Holocaust & ...by [[Search]]. However, the Search versus Knowledge trade-off in computer chess and games refers heuristic or perfect knowledge.
    43 KB (6,026 words) - 22:39, 18 November 2021
  • '''[[Main Page|Home]] * [[Engines]] * CHUMP''' ...a Chess Program Based on a Model of Human Memory.'' [[Advances in Computer Chess 7]]</ref>.
    8 KB (1,121 words) - 16:11, 7 May 2020
  • ...sub-genre of solving certain [https://en.wikipedia.org/wiki/Chess_problem chess problems] uses retrograde analysis to determine which [[Moves|moves]] were ...Endgames'' <ref>[[Lewis Stiller]] ('''1996'''). ''Multilinear Algebra and Chess Endgames''. [http://library.msri.org/books/Book29/index.html Games of No Ch
    32 KB (4,448 words) - 11:56, 4 April 2022
  • ...puter_Conference Joint Computer Conferences], reprinted 1988 in [[Computer Chess Compendium]]</ref> . ...ouldn't have influenced the final result anyway. Similar to standard chess engines mate searchers also use mate-distance-pruning. In its basic form all moves
    6 KB (907 words) - 19:51, 14 November 2020
  • * [[Monroe Newborn|Monty Newborn]], ''Mad Monty Chess''. ...ew Sadler]], ''Chess960 Superhumans''! [https://matthewsadler.me.uk/engine-chess/chess960-superhumans/ online]
    173 KB (22,418 words) - 20:37, 6 April 2022
  • ...' [[Chess Skill in Man and Machine]], reprinted ('''1988''') in [[Computer Chess Compendium]]</ref>, only considering [[Center Manhattan-Distance|Center Man Despite todays engines have no difficulty to win this easily even without [[Endgame Tablebases|tab
    14 KB (1,839 words) - 19:32, 27 May 2021
  • '''[[Main Page|Home]] * [[Chess]] * Playing Strength''' of a chess player, or chess playing entity, program or engine, reflects the ability to win against othe
    54 KB (7,310 words) - 11:16, 4 April 2022
  • '''[[Main Page|Home]] * [[Engines]] * CAPS''' '''CAPS''', (Chess as Problem Solving, CAPS-II)<br/>
    13 KB (2,088 words) - 14:21, 7 December 2019

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