...). ''[http://www.eecs.berkeley.edu/Pubs/TechRpts/2006/EECS-2006-1.html The Problem with Threads]''. Technical Report No. UCB/EECS-2006-1, [[University of Cali
25 KB (3,329 words) - 21:14, 28 March 2022
...ackup an uncertain Monte Carlo score. This was solved. For chess this same problem was solved around the time [[Quiescence Search|quiescent search]] was devel
* [[Marvin Minsky]] ('''1954'''). ''Neural Nets and the Brain Model Problem''. Ph.D. dissertation, [https://en.wikipedia.org/wiki/Princeton_University
76 KB (10,439 words) - 14:01, 10 August 2023
...isc.edu/%7Efinton/qcontroller.html Q-Learning Controller for the Cart-Pole Problem]</ref> , but was soon employed industrially to evolve strategies for automa
...]] ('''1977'''). ''King and Rook Against King: Historical Background and a Problem on the Infinite Board''. [[Advances in Computer Chess 1]]</ref> , Donald Mi
24 KB (3,641 words) - 21:59, 3 July 2021
* [http://chesspuzzles.com/mate-in-two Mate in Two Problem | Chess Puzzles!]
8 KB (1,005 words) - 17:35, 23 April 2018
...two moves away from [[Checkmate|checkmate]], known as the [[Mate-in-two]] problem.
9 KB (1,246 words) - 17:43, 23 April 2018
Turing addressed the problem of [[Artificial Intelligence|artificial intelligence]], and proposed an exp
28 KB (4,173 words) - 09:54, 14 November 2020
The supervised problem of regression applied to [[Automated Tuning#MoveAdaption|move adaptation]]
...Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.'' [[ICGA Journal#10_1|ICCA
91 KB (12,241 words) - 21:01, 28 March 2022
...ion is similar to what would happen if you solved a weighted least squares problem where the weights are determined by how often a particular type of position
28 KB (4,063 words) - 21:06, 28 March 2022
...sporadically ad hoc and seriously thought about how to improve it. One big problem was that none of us was (or is) a good chess player and by then the program
14 KB (2,124 words) - 17:07, 16 November 2020
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]
38 KB (4,367 words) - 09:31, 28 March 2021
* [https://groups.google.com/d/msg/fishcooking/0uRw0Zila0M/s2siUjVzFFwJ Problem with CLOP and clop-cutechess-cli.py? (long post)] by joster, [[Computer Che
6 KB (884 words) - 23:12, 21 January 2020
...N [[Iteration|iterations]] regardless of the dimension of the optimization problem - opposed to FDSA, which needs p + 1 objective function measurements or sim
18 KB (2,427 words) - 16:42, 2 June 2021
...rg/wiki/Dancing_Links Dancing Links] finds all solutions to an exact cover problem. Backtracking is further applied to solving [https://en.wikipedia.org/wiki/
...atician#RGeist|Robert Geist]] ('''1984'''). ''The Crippled Queen Placement Problem''. [https://dblp.uni-trier.de/db/journals/scp/scp4.html Science of Computer
23 KB (3,095 words) - 10:16, 26 June 2021
...le/10.1007%2FBF00940812 Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm]''. [http://www.springer.com/mathematics
...ps://en.wikipedia.org/wiki/Travelling_salesman_problem Travelling salesman problem], in [[Learning|machine learning]], in training of [[Neural Networks|neural
30 KB (4,044 words) - 13:16, 18 September 2020
...data words <ref>[https://www.stmintz.com/ccc/index.php?id=191935 Re: Chess problem solving] by [[Timo Saari]], [[CCC]], October 05, 2001</ref>, optimized for
5 KB (808 words) - 10:10, 29 February 2020
.... They would divide up the work, and each computer would solve part of the problem. In effect, the program was like a small business organization, with a mana
12 KB (1,783 words) - 17:57, 26 December 2019
...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
...Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows''. Evostar 2011, [http://www.lamsade.dauphine.fr/~cazenav
76 KB (10,188 words) - 16:36, 1 December 2021
...f Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp
...ps://en.wikipedia.org/wiki/Homicidal_chauffeur_problem Homicidal chauffeur problem - Wikipedia]</ref>
37 KB (5,099 words) - 16:20, 1 December 2021
...h actions yield the most reward by trying them. The reinforcement learning problem is deeply indebted to the idea of [https://en.wikipedia.org/wiki/Markov_dec
* [[Marvin Minsky]] ('''1954'''). ''Neural Nets and the Brain Model Problem''. Ph.D. dissertation, [https://en.wikipedia.org/wiki/Princeton_University
137 KB (18,484 words) - 00:18, 19 December 2021
...e also pondering chess-playing machines. Alex Bernstein only knew that the problem was hot ...
Bernstein also mentioned that he was working on the problem to [https://en.wikipedia.org/wiki/Edward_Lasker Dr. Edward Lasker], a well-
11 KB (1,607 words) - 18:38, 25 February 2021
...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
...://link.springer.com/chapter/10.1007/3-540-48957-6_3 A Solution to the GHI Problem for Best-First Search]''. [[CG 1998]]
...[[Jos Uiterwijk]], [[Victor Allis]] ('''2001'''). ''A Solution to the GHI Problem for Best-First Search''. [https://en.wikipedia.org/wiki/Theoretical_Compute
62 KB (8,279 words) - 13:30, 17 November 2021
...whether it satisfies the [https://en.wikipedia.org/wiki/Problem_statement problem statement]. Brute-force algorithms are conceptually simple, but usually suf
8 KB (1,101 words) - 14:03, 24 November 2018
...://link.springer.com/chapter/10.1007/3-540-48957-6_3 A Solution to the GHI Problem for Best-First Search]''. [[CG 1998]]
...ller]] ('''2004'''). ''A General Solution to the Graph History Interaction Problem''. American Association for Artificial Intelligence (AAAI) National Confere
4 KB (541 words) - 20:03, 17 June 2021
...since it could belong to a line being searched by another processor. This problem sounds complicated to solve.
...[[Jos Uiterwijk]], [[Victor Allis]] ('''1999'''). ''A Solution to the GHI Problem for Best-First Search''. [[CG 1998]] » [[Graph History Interaction]], [[Be
34 KB (4,898 words) - 12:51, 21 August 2022
...f Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp
40 KB (5,362 words) - 20:47, 22 November 2023
...('''2015'''). ''Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search''. Australasian Conference on Artificial Intelligence,
...('''2015'''). ''Analytical Results on the BFS vs. DFS Algorithm Selection Problem: Part II: Graph Search''. Australasian Conference on Artificial Intelligenc
7 KB (955 words) - 23:55, 9 March 2019
...l]] ('''1984'''). ''Heuristics: Intelligent Search Strategies for Computer Problem Solving''. [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley]
...('''2015'''). ''Analytical Results on the BFS vs. DFS Algorithm Selection Problem. Part I: Tree Search''. Australasian Conference on Artificial Intelligence,
11 KB (1,526 words) - 14:42, 18 November 2021
...org/xpl/freeabs_all.jsp?isnumber=4767384&arnumber=4767391&count=16&index=6 Problem Reduction Representation for the Linguistic Analysis of Waveforms]''. [[IEE
...arl]] ('''1984'''). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishers Co., Reading, MA. ISBN 0-201-05594-5.</r
18 KB (2,480 words) - 23:49, 9 March 2019
...etely, but as long as certain very basic techniques are used, it will be a problem. I think that the solution is to defend against crashes and bad behavior, t
7 KB (952 words) - 13:56, 7 December 2019
* [http://www.talkchess.com/forum/viewtopic.php?t=31505 Problem with exploding tree because of extensions] by [[Oliver Brausch]], [[CCC]],
6 KB (802 words) - 20:06, 5 July 2020
