.../www.stmintz.com/ccc/index.php?id=42184 Interesting endgame database probe problem] by [[Robert Hyatt]], [[CCC]], February 04, 1999
* [http://www.talkchess.com/forum/viewtopic.php?t=59237 Nalimov EGTB problem related to DTM?] by [[Kai Laskos]], [[CCC]], February 14, 2016 » [[Nalimov
75 KB (10,498 words) - 05:16, 28 September 2022
* [[:Category:Problem|Chess Problem Solving Engines]]
...oogle.com/d/msg/rec.games.chess.computer/MyFmpXxqccg/Z6WgNuoF-hcJ Smullyan Problem in Sherlock Holmes book] by Christopher Heckman, [[Computer Chess Forums|rg
32 KB (4,448 words) - 11:56, 4 April 2022
* [http://www.talkchess.com/forum/viewtopic.php?t=50337 Problem with 6-piece syzygy-bases using wine] by [[Bernhard Bauer]], [[CCC]], Decem
* [http://www.talkchess.com/forum/viewtopic.php?t=51134 problem with syzygy tablebases] by [[Youri Matiounine]], [[CCC]], February 01, 2014
40 KB (5,678 words) - 13:35, 7 December 2023
* [https://www.stmintz.com/ccc/index.php?id=407134 Subject: Problem (small bug?) with Nalimov TBs] by [[Dieter Bürßner]], [[CCC]], January 23
* [http://www.talkchess.com/forum/viewtopic.php?t=59237 Nalimov EGTB problem related to DTM?] by [[Kai Laskos]], [[CCC]], February 14, 2016 » [[Endgame
14 KB (1,987 words) - 11:18, 22 April 2021
* [http://www.talkchess.com/forum/viewtopic.php?t=52836 En passant problem in gaviota tablebases] by [[Peter Österlund]], [[CCC]], July 02, 2014 » [
9 KB (1,130 words) - 18:53, 16 November 2020
...tion to make and undo moves twice for all moves. Below code can avoid that problem and run much faster:
30 KB (4,128 words) - 05:07, 16 March 2024
* [http://www.talkchess.com/forum/viewtopic.php?t=26208 SMP hashing problem] by [[Robert Hyatt]], [[CCC]], January 24, 2009 » [[Shared Hash Table#Lock
...chess.com/forum/viewtopic.php?t=38655 AMD Phenom Hex core (SMP performance problem)] by [[Miguel A. Ballicora]], [[CCC]], April 04, 2011
12 KB (1,619 words) - 11:29, 31 May 2021
...] (8 [https://en.wikipedia.org/wiki/Gibibyte gibibytes]).DTS overcomes one problem of [[Parallel Search#PrincipalVariationSplitting|principle variation splitt
20 KB (2,160 words) - 09:44, 7 October 2021
...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003 » [[Botvinnik-Markoff Ex
2 KB (238 words) - 12:23, 12 May 2018
...''2007'''). ''Evolution of an Efficient Search Algorithm for the Mate-In-N Problem in Chess''. [http://www.informatik.uni-trier.de/~%20LEY/db/conf/eurogp/euro
6 KB (907 words) - 19:51, 14 November 2020
...artin Müller]] ('''2003'''). ''Df-pn in Go: An Application to the One-Eye Problem''. [[Advances in Computer Games 10]], [http://www.fun.ac.jp/%7Ekishi/pdf_fi
...artin Müller]] ('''2003'''). ''Df-pn in Go: An Application to the One-Eye Problem''. [[Advances in Computer Games 10]], [http://www.fun.ac.jp/%7Ekishi/pdf_fi
32 KB (4,387 words) - 22:29, 17 June 2021
...oblem is pushed beyond the horizon, so far as the search is concerned, the problem no longer exists.
...the queen was going to be lost eventually anyway. I see this as not just a problem of "artificial" intelligence but human thinking in general, especially of p
14 KB (2,095 words) - 10:28, 11 September 2020
* [[Klaus Kirchhof]], ''A Diagonal English Peg Solitaire Problem: from 32 to 9 Pegs''.
...in]], [[I-Chen Wu]], ''An Efficient Approach to Solving the Minimum Sudoku Problem''.
173 KB (22,418 words) - 20:37, 6 April 2022
* [[Donald Michie]] ('''1979'''). ''The Computer Attacks Moravec Problem''. [[Personal Computing#3_10|Personal Computing, Vol. 3, No. 10]], pp. 73 <
* Editor ('''1979'''). ''Chess Ratings from Problem Solving''. [[Personal Computing#3_12|Personal Computing, Vol. 3, No. 12]],
30 KB (3,549 words) - 11:21, 6 September 2019
...g-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]]</ref>. For his publica
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]
19 KB (2,465 words) - 09:33, 28 March 2021
...d been gathered around [[Max Euwe]] (former world champion) to work on the problem of the simulation of the play of the failures. One found there the encyclop
19 KB (2,855 words) - 17:13, 16 November 2020
...chess piece. The participants were usually required to solve a given chess problem correctly under the supervision of an experimenter and represent their thou
...d been gathered around [[Max Euwe]] (former world champion) to work on the problem of the simulation of the play of the failures. One found there the encyclop
13 KB (1,869 words) - 14:10, 7 December 2019
...f Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp
...f Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp
9 KB (1,221 words) - 17:13, 16 November 2020
...f Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp
...256-264 <ref>[https://en.wikipedia.org/wiki/General_Problem_Solver General Problem Solver from Wikipedia]</ref>
32 KB (4,861 words) - 17:13, 16 November 2020
...''A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem''. in
13 KB (1,916 words) - 20:42, 13 May 2018
