...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>
7 KB (1,048 words) - 13:54, 7 December 2019
...score changes, which was OK. The next round, our Univac developed a memory problem and I switched back to the vax and had a few exciting moments when we came
28 KB (3,999 words) - 00:15, 1 February 2022
...frm/thread/77ec7b3a94555fb4/d8019f5c3716cd1a hash table fail high/fail low problem] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], November 26, 1996
* [https://www.stmintz.com/ccc/index.php?id=72221 Problem with draws by rep and hash table] by [[James Robertson]], [[CCC]], October
60 KB (8,162 words) - 21:35, 28 April 2022
* [http://www.talkchess.com/forum/viewtopic.php?t=65589 Aspiration window problem] by [[Sander Maassen vd Brink]], [[CCC]], October 30, 2017
9 KB (1,262 words) - 00:12, 1 February 2022
* [https://www.stmintz.com/ccc/index.php?id=303131 Problem with extending to maxdepth] by [[Albert Bertilsson]], [[CCC]], June 26, 200
* [http://www.talkchess.com/forum/viewtopic.php?t=31220 Stupid Extension Problem/Question] by [[John Merlino]], [[CCC]], December 23, 2009 » [[Repetitions]
14 KB (1,884 words) - 21:12, 20 November 2020
...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003</ref>, inspired by [[Mikh
...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003, introducing the extensio
2 KB (270 words) - 22:06, 27 April 2018
* [http://www.talkchess.com/forum/viewtopic.php?t=31505 Problem with exploding tree because of extensions] by [[Oliver Brausch]], [[CCC]],
5 KB (739 words) - 23:34, 29 July 2019
...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003
6 KB (836 words) - 22:12, 27 April 2018
...]], if one move seems to be a lot better than all of the alternatives. The problem is that one does not know in advance, and therefore has to perform a reduce
...lines. The singular extension heuristic can be seen as a solution to this problem.
16 KB (2,280 words) - 17:09, 16 November 2020
We overcome this problem in the SEX algorithm by using two separate values of SEX, one for each side
11 KB (1,590 words) - 23:56, 27 December 2018
...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003</ref> .
...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003 » [[Botvinnik-Markoff Ex
40 KB (5,641 words) - 18:55, 25 December 2020
To somewhat alleviate this problem so-called speculative-pruning methods are used to cut off less interesting
7 KB (1,046 words) - 13:55, 28 December 2019
.../ref> <ref>[https://www.stmintz.com/ccc/index.php?id=339076 Re: Unexpected problem with futility pruning?] by [[Tord Romstad]], [[CCC]], December 29, 2003</re
* [https://www.stmintz.com/ccc/index.php?id=339041 Unexpected problem with futility pruning ?] by Geoff, [[CCC]], December 29, 2003
15 KB (2,022 words) - 09:48, 8 July 2021
* [http://www.talkchess.com/forum/viewtopic.php?t=31494 The problem with LMR in suprtactical positions] by [[Oliver Brausch]], [[CCC]], January
17 KB (2,291 words) - 11:20, 4 April 2022
...en more with exact hits, there are other solutions to address the short PV problem, which looses the information of the path that leads to that score, in con
* [https://www.stmintz.com/ccc/index.php?id=207580 Problem with short PV] by [[Benny Antonsson]], [[CCC]], January 15, 2002
16 KB (2,278 words) - 16:45, 3 November 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=64912 What is causing this problem?] by [[Michael Sherwin]], [[CCC]], August 16, 2017 » [[RomiChess]]
31 KB (4,202 words) - 18:27, 12 March 2022
* [http://www.talkchess.com/forum/viewtopic.php?t=20646 SEE problem] by [[Tord Romstad]], [[CCC]], April 13, 2008
20 KB (2,822 words) - 10:43, 1 August 2022
* [https://www.talkchess.com/forum3/viewtopic.php?f=7&t=76255 Problem with counter move heuristic] by John Garrison, [[CCC]], January 08, 2021
5 KB (732 words) - 10:47, 16 February 2022
...Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.'' [[ICGA Journal#10_1|ICCA
...Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.'' [[ICGA Journal#10_1|ICCA
5 KB (651 words) - 20:24, 29 June 2018
...chess program, then the experience-based approach has probably solved the problem already, as the best programs are now better or at least equal to the best
11 KB (1,358 words) - 23:25, 5 February 2020
