* [[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [h
26 KB (3,485 words) - 18:37, 12 March 2022
* [[:Category:Problem]]
33 KB (3,508 words) - 02:43, 20 October 2022
* [https://www.stmintz.com/ccc/index.php?id=352371 about a possible problem with movei's logfiles(also for other programs)] by [[Uri Blass]], [[CCC]],
8 KB (1,143 words) - 19:56, 6 July 2019
...]] ('''1977'''). ''King and Rook Against King: Historical Background and a Problem on the Infinite Board''. [[Advances in Computer Chess 1]]
20 KB (2,969 words) - 14:19, 14 August 2020
...shed a paper about "The calculation of the tournament results as a maximum problem of the probability calculus" in 1929 <ref>Ernst Zermelo ('''1929'''). ''Die
9 KB (1,273 words) - 22:10, 1 October 2018
in mathematics and computer science, methods for solving a problem expressed as a finite sequence of instructions. The term “algorithm” is
* [https://en.wikipedia.org/wiki/Problem_solving Problem solving from Wikipedia] » [[Artificial Intelligence]]
22 KB (2,849 words) - 10:34, 5 April 2021
* [http://www.talkchess.com/forum/viewtopic.php?t=55846 Problem with SF6 and Syzygy TB] by Forrest Hoch, [[CCC]], April 01, 2015 » [[Syzyg
...ess.com/forum/viewtopic.php?t=59407 Stockfish 7 and partial 6 piece syzygy problem?] by [[Jouni Uski]], [[CCC]], March 01, 2016
65 KB (8,362 words) - 13:19, 1 March 2024
...rams. Game in chess has ceased to be considered as an artificial intellect problem, having given way to expert systems. As a result today in the field of an a
Thus the problem arises - how to evaluate these new leaf positions. These evaluations should
54 KB (7,939 words) - 06:55, 24 September 2023
...n early 60's, consisting of just a few pages. Besides solving an important problem, it presented a bright approach to data structure maintenance. While this a
23 KB (3,163 words) - 17:06, 21 March 2021
...er created numerous [https://en.wikipedia.org/wiki/Packing_problem packing problem] puzzles such as the ''Twubblesome Twelve'' <ref>[http://gosper.org/ Twubbl
HAKMEM 70, A neat chess problem, swiped from ''Chess for Fun and Chess for Blood'', by [https://en.wikipedi
9 KB (1,338 words) - 23:30, 10 July 2020
...'[https://backscattering.de/chess/hashtable-packing/ The Hashtable Packing Problem]''. (Draft)
3 KB (375 words) - 14:31, 27 June 2020
....org/wiki/Vector_space vector space] of a [[Chessboard|chessboard]] to the problem of chess [[Attacks|attacks]], including [[Static Exchange Evaluation|static
* [[Paul Wiereyn]] ('''1985'''). ''Inventive Problem Solving''. [[ICGA Journal#8_4|ICCA Journal, Vol. 8, No. 4]]
25 KB (2,238 words) - 16:19, 25 December 2020
* [https://www.stmintz.com/ccc/index.php?id=191460 Re: A math problem for the experts...] by Teerapong Tovirat, [[CCC]], October 02, 2001
2 KB (321 words) - 17:50, 31 October 2018
...ne [[Pin|pinned pieces]] and [[Discovered Check|discovered checks]] in his problem solving program:
* [[Paul Wiereyn]] ('''1985'''). ''Inventive Problem Solving''. [[ICGA Journal#8_4|ICCA Journal, Vol. 8, No. 4]]
18 KB (2,661 words) - 17:16, 1 October 2020
...ttps://en.wikipedia.org/wiki/Hexagonal_tortoise_problem Hexagonal tortoise problem - Wikipedia]</ref>
...ds_solving_a_Problem_in_the_Doctrine_of_Chances An Essay towards solving a Problem in the Doctrine of Chances - Wikipedia]</ref>)
805 KB (106,796 words) - 11:23, 6 August 2021
...Truscott and Wright examined what had happened and they observed that the problem was not with their program, but rather with a bug in the [https://en.wikipe
14 KB (1,990 words) - 11:52, 28 January 2020
...Herik]] to do a lot of hard work and decisions almost each round. Another problem was the missing ability to produce valid [[Portable Game Notation|PGN]] by
39 KB (5,028 words) - 11:25, 7 June 2020
...ery well. In one second, they can examine thousands of possible moves. The problem is, they stop to consider lousy moves that a human player wouldn't waste a
13 KB (1,864 words) - 14:31, 7 December 2019
...ece-development, Centre control and King safety are stressed. A persistent problem which many programs still have is the too early development of the [[Queen|
10 KB (1,446 words) - 15:21, 23 January 2020
...ttps://en.wikipedia.org/wiki/Houston,_we_have_a_problem Houston, we have a problem from Wikipedia]</ref>
1 KB (173 words) - 21:37, 2 September 2018
...). ''[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
...<ref>[http://www.talkchess.com/forum/viewtopic.php?t=39073 EBF definition problem in chess wiki] by [[Daniel Shawul]], [[CCC]], May 13, 2011</ref>.
* [http://www.talkchess.com/forum/viewtopic.php?t=39073 EBF definition problem in chess wiki] by [[Daniel Shawul]], [[CCC]], May 13, 2011
9 KB (1,311 words) - 18:22, 12 March 2021
* [https://www.stmintz.com/ccc/index.php?id=281989 Re: Chezzz 1.0.1 - problem solved - for David Rasmussen] by [[David Rasmussen]], [[CCC]], February 05,
39 KB (5,372 words) - 19:58, 16 November 2020
With bitboard serialization one minor problem is the relative order in [[Move Generation|move generation]] considering [[
...ubsets are, the less efficient this hashing technique. This might become a problem since bitboard move-generation is essentially about subsets of moves with c
14 KB (2,006 words) - 10:30, 11 April 2020
* [[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [
14 KB (1,553 words) - 10:05, 4 November 2021
* [[Hans Berliner]] ('''1974'''). ''Chess as Problem Solving: The Development of a Tactics Analyser''. '''Ph.D. thesis''', [[Car
...Hans Berliner]] ('''1977'''). ''A Representation and Some Mechanisms for a Problem-Solving Chess Program.'' [[Advances in Computer Chess 1]]
15 KB (1,973 words) - 22:14, 30 November 2021
* [[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [h
...''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
16 KB (2,217 words) - 21:27, 5 August 2021
...talkchess.com/forum/viewtopic.php?t=60193 Surprisingly difficult stalemate problem (for some engines)] by Juha Nieminen, [[CCC]], May 16, 2016
12 KB (1,753 words) - 21:35, 23 February 2021
* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=41542 Problem with bitboard knight attack generator] by [[Matthew R. Brades|ZirconiumX]],
11 KB (1,309 words) - 18:16, 27 June 2020
...://en.wikipedia.org/wiki/Wheat_and_chessboard_problem Wheat and chessboard problem]
3 KB (469 words) - 22:50, 8 March 2019
...treet-Fighting Mathematics: The Art of Educated Guessing and Opportunistic Problem Solving]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press]
6 KB (896 words) - 09:22, 23 May 2018
...g-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]]
9 KB (1,205 words) - 16:17, 10 May 2018
...forum.net/cgi-bin/rybkaforum/topic_show.pl?pid=552902 Final Report on Draw Problem in Correspondence Chess] by [[Arno Nickel|Ciron]], [[Computer Chess Forums|
...forum.net/cgi-bin/rybkaforum/topic_show.pl?pid=552902 Final Report on Draw Problem in Correspondence Chess] by [[Arno Nickel|Ciron]], [[Computer Chess Forums|
11 KB (1,553 words) - 08:27, 3 December 2023
* Editor ('''1979'''). ''Chess Ratings from Problem Solving''. [[Personal Computing#3_12|Personal Computing, Vol. 3, No. 12]],
* [http://www.talkchess.com/forum/viewtopic.php?t=21348 Problem suite testing - how to extract a useful number] by [[Don Dailey]] from [[CC
20 KB (2,671 words) - 21:31, 5 August 2021
* [http://www.jimloy.com/chess/mirror1.htm A "Mirror" Chess Problem] from [http://www.jimloy.com/chess/chess.htm Jim Loy's Chess Pages]
9 KB (1,354 words) - 21:37, 15 May 2018
Decoding Gray code is a parallel prefix problem similar to the ring-wise operations of the [[#ParityWords|Parity words]]. F
A '''parallel prefix''' problem is of the sort:
19 KB (2,539 words) - 00:13, 12 April 2021
...ook at the way computer chess programs operate today. The most significant problem with PC-oriented (non 64-bit) programs is the lack of speed associated with
The real problem comes in trying to combine the forward and '''reverse bitboards''' - there
13 KB (2,038 words) - 09:02, 11 May 2018
...2003 <ref>[https://www.stmintz.com/ccc/index.php?id=339076 Re: Unexpected problem with futility pruning?] by [[Tord Romstad]], [[CCC]], December 29, 2003</re
4 KB (600 words) - 21:05, 9 September 2020
...olution to a problem depends on solutions to smaller instances of the same problem.
17 KB (2,415 words) - 12:56, 19 November 2021
...). ''[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
* [http://www.talkchess.com/forum/viewtopic.php?t=26208 SMP hashing problem] by [[Robert Hyatt]], [[CCC]], January 24, 2009 » [[Shared Hash Table#Lock
86 KB (11,607 words) - 18:34, 11 November 2021
...ps://en.wikipedia.org/wiki/Dining_philosophers_problem Dining philosophers problem from Wikipedia]</ref> ]]
* [http://www.talkchess.com/forum/viewtopic.php?t=26208 SMP hashing problem] by [[Robert Hyatt]], [[CCC]], January 24, 2009
26 KB (3,729 words) - 09:42, 7 October 2021
...ng.org.uk/acl/literature/reports/p008.htm A Solution to the table overflow problem for Hash Tables]''. [http://www.chilton-computing.org.uk/acl/literature/rep
...'[https://backscattering.de/chess/hashtable-packing/ The Hashtable Packing Problem]''. (Draft)
24 KB (3,307 words) - 21:17, 7 October 2020
...erception and Memory versus Thought: Some Old Ideas and Recent Findings''. Problem Solving: Research, Method, and Theory (ed. B. Kleinmuntz), pp. 19-50. John
52 KB (7,240 words) - 22:33, 16 May 2023
...ts 13-15 plies in the middle game and the horizon effect which was a major problem at 5 Mhz slowly was fading away.
* [[Matej Guid]] ('''2010'''). ''Search and Knowledge for Human and Machine Problem Solving'', Ph.D. thesis, [[University of Ljubljana]], [http://eprints.fri.u
43 KB (6,026 words) - 22:39, 18 November 2021
...hash table]] aging because it affects the hash tables in strange ways. The problem is that 2 identical positions can have different scores if they are descend
...d Pawn|passers]] you can easily do [[Incremental Updates|incremental]], no problem.
24 KB (3,789 words) - 12:11, 9 December 2019
...erception and Memory versus Thought: Some Old Ideas and Recent Findings''. Problem Solving: Research, Method, and Theory (ed. B. Kleinmuntz), pp. 19-50. John
...problem-solving Information-processing analysis of perceptual processes in problem solving]''. Psychological Review, Vol. 76, No. 5
22 KB (2,972 words) - 13:20, 22 November 2020
...w.talkchess.com/forum/viewtopic.php?t=52661 UCI, ownbooks, and a potential problem] by [[Miguel A. Ballicora]], [[CCC]], June 16, 2014 » [[UCI]]
33 KB (4,574 words) - 04:04, 11 September 2021
...g-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]] » [[CC Sapiens]]
25 KB (3,365 words) - 11:19, 6 August 2021
...гард]</ref> ('''1967'''). ''Проблема Узнавания''. The Problem of Recognition, Nauka Press, Moscow, appeared as ''Pattern Recognition'' in
* [https://en.wikipedia.org/wiki/Bongard_problem Bongard problem from Wikipedia]
22 KB (2,952 words) - 14:37, 17 July 2020
...d Gobet]] ('''1997'''). ''A Pattern-Recognition Theory of Search in Expert Problem Solving.'' Thinking and Reasoning, Vol. 3, No. 4</ref>.
8 KB (1,121 words) - 16:11, 7 May 2020
* [[Marvin Minsky]] ('''1954'''). ''Neural Nets and the Brain Model Problem''. Ph.D. dissertation, [https://en.wikipedia.org/wiki/Princeton_University
...erception and Memory versus Thought: Some Old Ideas and Recent Findings''. Problem Solving: Research, Method, and Theory (ed. B. Kleinmuntz), pp. 19-50. John
59 KB (8,002 words) - 09:43, 5 July 2021
.../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
...Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.'' [[ICGA Journal#10_1|ICCA
36 KB (4,737 words) - 09:34, 9 September 2021
...cribed by [[Paul Wiereyn]] <ref>[[Paul Wiereyn]] ('''1985'''). ''Inventive Problem Solving''. [[ICGA Journal#8_4|ICCA Journal, Vol. 8, No. 4]]</ref> and, acco
2 KB (303 words) - 17:03, 11 February 2021
...between the root and leaf position may be very big. There also might be a problem with re-using hash scores from the previous entries. About the only recent
17 KB (2,340 words) - 21:03, 28 March 2022
* [https://www.stmintz.com/ccc/index.php?id=29767 Minority attack: a problem even for new programs?] by [[Dirk Frickenschmidt]], [[CCC]], October 17, 19
2 KB (329 words) - 18:49, 25 February 2021
...ly we try to discourage the engine from leaving central pawns unmoved. The problem I could see here is that this is contradictory to keeping pawns in front of
11 KB (1,941 words) - 22:15, 23 February 2021
...1977'''). ''[http://dl.acm.org/citation.cfm?id=1624529 EG: a case study in problem solving with king and pawn endings]''. [http://www.sigmod.org/dblp/db/conf/
10 KB (1,342 words) - 10:40, 14 August 2020
...]] ('''1977'''). ''King and Rook Against King: Historical Background and a Problem on the Infinite Board''. [[Advances in Computer Chess 1]]</ref>.
...]] ('''1977'''). ''King and Rook Against King: Historical Background and a Problem on the Infinite Board''. [[Advances in Computer Chess 1]]
14 KB (1,839 words) - 19:32, 27 May 2021
* [https://www.stmintz.com/ccc/index.php?id=305906 Problem with TT] by [[Grzegorz Sidorowicz]], [[CCC]], July 11, 2003
5 KB (707 words) - 21:18, 2 March 2020
* Editor ('''1979'''). ''Chess Ratings from Problem Solving''. [[Personal Computing#3_12|Personal Computing, Vol. 3, No. 12]],
* [[Matej Guid]] ('''2010'''). ''Search and Knowledge for Human and Machine Problem Solving''. Ph.D. thesis, [[University of Ljubljana]]
54 KB (7,310 words) - 11:16, 4 April 2022
...//openlibrary.org/b/OL2405839M/problem_of_The_reign_of_King_Edward_III The problem of The reign of King Edward III - a statistical approach]'' </ref>. He was
8 KB (1,184 words) - 00:50, 9 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
...256-264 <ref>[https://en.wikipedia.org/wiki/General_Problem_Solver General Problem Solver from Wikipedia]</ref>
3 KB (373 words) - 11:19, 9 June 2019
...opment of a Tactics Analyser'' <ref>Hans Berliner ('''1974'''). ''Chess as Problem Solving: The Development of a Tactics Analyser''. Ph.D. thesis, [[Carnegie
...o are new to the subject, the people who say, It sounds like a fascinating problem and I'd like to know what's going on.
22 KB (3,113 words) - 18:54, 25 February 2021
'''CAPS''', (Chess as Problem Solving, CAPS-II)<br/>
...Hans Berliner]] ('''1977'''). ''A Representation and Some Mechanisms for a Problem-Solving Chess Program.'' [[Advances in Computer Chess 1]]</ref>, and, along
13 KB (2,088 words) - 14:21, 7 December 2019
...ogram is able to solve the most difficult problem of its present domain (a problem that would require 45 ply of search and on the order of 1013 years of CPU t
6 KB (916 words) - 23:34, 25 July 2020
...rogram and forgetting some backing. It wasn’t impossible to work on this problem oneself, but one did need computer time and computer time is very expensive
16 KB (2,465 words) - 18:54, 25 February 2021
...://www.talkchess.com/forum/viewtopic.php?t=34051 Ponder console input move problem] by [[Vlad Stamate]], [[CCC]], April 28, 2010 » [[Pondering]]
10 KB (1,401 words) - 20:33, 9 November 2020
* [http://talkchess.com/forum3/viewtopic.php?t=46586 Problem with UCI engines hash in Arena] by carldaman, [[CCC]], December 27, 2012
21 KB (3,097 words) - 04:02, 7 June 2022
* [http://www.talkchess.com/forum/viewtopic.php?t=61823 ChessGUI Timer Problem] by [[Dennis Sceviour]], [[CCC]], October 24, 2016 » [[ChessGUI]]
16 KB (2,296 words) - 09:30, 3 July 2021
* [http://www.talkchess.com/forum/viewtopic.php?t=36722 Problem using XBoard + Polyglot + Zippy on FICS] by [[Ben-Hur Carlos Vieira Langoni
12 KB (1,656 words) - 05:19, 23 July 2022
unlike [[First Rank Attacks|rank attacks]], the problem arises for [[Files|files]] and [[Diagonals|diagonals]] how to get scattered
6 KB (813 words) - 22:23, 16 June 2021
* [http://www.talkchess.com/forum/viewtopic.php?t=18854 Problem with Transposition Table and Repitition-Draw] by [[Oliver Brausch]], [[CCC]
* [http://www.talkchess.com/forum/viewtopic.php?t=31505 Problem with exploding tree because of extensions] by [[Oliver Brausch]], [[CCC]],
19 KB (2,525 words) - 12:46, 7 June 2021
...'[https://backscattering.de/chess/hashtable-packing/ The Hashtable Packing Problem]''. (Draft)
44 KB (5,711 words) - 13:58, 8 July 2021
...sliding pieces instead on individual pieces, whose ranks to be masked. The problem arising, when not masking the rank of the piece is that attacks wrap around
17 KB (2,047 words) - 21:03, 19 July 2019
...the communication unnecessarily verbose, but w.r.t. clocks there is a real problem: in classical TC the timing info accompanying the 'go' command does not spe
* [http://www.talkchess.com/forum/viewtopic.php?t=46586 Problem with UCI engines hash in Arena] by Carl Langan, [[CCC]], December 26, 2012
25 KB (3,536 words) - 05:36, 9 September 2021
...l and Error''' is a general [https://en.wikipedia.org/wiki/Problem_solving problem solving] method in contrast of an approach using [https://en.wikipedia.org/
* [http://www.teachervision.fen.com/math/problem-solving/48896.html Problem Solving: Guess and Check - TeacherVision.com]
4 KB (558 words) - 21:07, 29 June 2018
...ion space of the system it is monitoring/controlling. One solution to this problem is to use an (adapted) [[Neural Networks|artificial neural network]] as a f
54 KB (7,025 words) - 12:47, 14 March 2022
...the application of [[Retrograde Analysis|retrograde analysis]], to solve a problem by solving subproblems in bottom-up manner starting from terminal nodes <re
...ion.cfm?id=321111 Dynamic Programming Treatment of the Travelling Salesman Problem]''. [[ACM#Journal|Journal of the ACM]], Vol. 9, No. 1, [http://www.akira.ru
13 KB (1,788 words) - 11:19, 20 July 2019
...ion.cfm?id=321111 Dynamic Programming Treatment of the Travelling Salesman Problem]''. [[ACM#Journal|Journal of the ACM]], Vol. 9, No. 1, [http://www.akira.ru
11 KB (1,609 words) - 17:21, 4 September 2018
...nature, [[Search|deep searches]] are necessary for expert performance. The problem has already been recognized and solved by [[Arthur Samuel]] but seemed to h
The other problem is learning weights for terms which only occur rarely. Then the learning pr
46 KB (6,248 words) - 13:59, 23 May 2021
* [[Marvin Minsky]] ('''1954'''). ''Neural Nets and the Brain Model Problem''. Ph.D. dissertation, [https://en.wikipedia.org/wiki/Princeton_University
...mentaldeeplearningproblem.html Sepp Hochreiter's Fundamental Deep Learning Problem (1991)] by [[Jürgen Schmidhuber]], 2013</ref>
156 KB (21,084 words) - 18:34, 12 March 2022
...://www.talkchess.com/forum/viewtopic.php?t=34051 Ponder console input move problem] by [[Vlad Stamate]], [[CCC]], April 28, 2010 » [[Command Line Interface]]
11 KB (1,465 words) - 21:17, 20 April 2021
...d Kozdrowicki|Kozdrowicki]] have remarked that chess will persist, for the problem is so exciting that once a programmer gets involved there is virtually no w
10 KB (1,465 words) - 14:24, 7 December 2019
...Hans Berliner]] ('''1977'''). ''A Representation and Some Mechanisms for a Problem-Solving Chess Program.''
...]] ('''1977'''). ''King and Rook Against King: Historical Background and a Problem on the Infinite Board''.
14 KB (2,246 words) - 21:35, 26 September 2020
# [[László Lindner]] ('''1986'''). ''Problem Solving: The Present and Possibilities for Development''.
The art of problem solving (including phenomena such as self-mates and help-mates) with result
10 KB (1,411 words) - 21:37, 26 September 2020
...was realised, but the resulting knowledge gained from trying to solve the problem is all the greater. In this volume, the keynote paper identifies difference
# [[László Lindner]] ('''1989'''). ''Performance Improvements in Problem-Solving Programs since 1984''.
6 KB (839 words) - 10:31, 12 February 2021
# [[László Lindner]], [[Michael Schlosser]] ('''1991'''). ''New Ideas in Problem Solving and Composing Programs''.
4 KB (505 words) - 21:38, 26 September 2020
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''.
5 KB (620 words) - 21:39, 26 September 2020
...rtin Müller]]. ('''2003'''). ''Df-pn in Go: An Application to the One-Eye Problem''. [http://www.fun.ac.jp/%7Ekishi/pdf_file/acg_kishimoto_mueller.pdf pdf].
6 KB (793 words) - 14:04, 28 January 2020
...ink.springer.com/chapter/10.1007/11922155_13 The Graph-History Interaction Problem in Chinese Chess]''. [[Advances in Computer Games 11]]
8 KB (1,125 words) - 14:04, 28 January 2020
....com/chapter/10.1007/978-3-540-40031-8_22 Tackling Post’s Correspondence Problem]''. [[CG 2002]]
...Special Announcements], [[Elwyn Berlekamp|Elwyn Berlekamp's]] [[Clobber]] problem composition contest
7 KB (926 words) - 14:08, 28 January 2020
...7/3-540-45579-5_14 Creating Difficult Instances of the Post Correspondence Problem]''. [[CG 2000]]
8 KB (1,044 words) - 14:08, 28 January 2020
...://link.springer.com/chapter/10.1007/3-540-48957-6_3 A Solution to the GHI Problem for Best-First Search]''. [[CG 1998]]
5 KB (758 words) - 14:08, 28 January 2020
# [[David Levy]] ('''1989'''). ''The Million Pound Bridge Problem''. [[1st Computer Olympiad#Workshop|Heuristic Programming in AI 1]]
27 KB (3,287 words) - 17:15, 16 November 2020
...''A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem''.
...l]], [[Cliff Shaw]], [[Herbert Simon]] ('''1959'''). ''Report on a general problem-solving program''. Proceedings of the International Conference on Informati
68 KB (9,325 words) - 19:50, 4 April 2022
...in Hsu]], [[Tsan-sheng Hsu]] ('''2006'''). ''The Graph-History Interaction Problem in Chinese Chess.'' [[Advances in Computer Games 11]]
29 KB (3,949 words) - 06:57, 28 September 2022
* [http://www.talkchess.com/forum/viewtopic.php?t=42984 Xboard crazyhouse problem] by [[Steven Atkinson]], [[CCC]], March 23, 2012
8 KB (1,117 words) - 20:53, 23 May 2021
* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=164 8 Queens Problem] by [[Johan de Koning]]
15 KB (1,991 words) - 17:50, 5 October 2019
...G'02 Special Announcements], [[Elwyn Berlekamp|Elwyn Berlekamp's]] Clobber problem composition contest, [[CG 2002]]
6 KB (793 words) - 16:57, 13 January 2021
...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
...eitman]], [[Bruce Wilcox]] ('''1979'''). ''Modelling Tactical Analysis and Problem Solving in Go''. Proceedings of the Tenth Annual Pittsburgh Conference on M
97 KB (13,316 words) - 20:49, 18 March 2022
...ematician#CBerge|Claude Berge]] ('''1981'''). ''Some remarks about the Hex problem''. in [http://www.plambeck.org/oldhtml/mathematics/klarner/ David A. Klarne
27 KB (3,617 words) - 16:26, 1 December 2021
...sus_Machine_Problem-Solving_Winning_Openings_in_Dakon Human versus Machine Problem Solving: Winning Openings in Dakon]''. [https://en.wikipedia.org/wiki/Inter
9 KB (1,152 words) - 00:43, 7 January 2020
...ogram puzzles is a [https://en.wikipedia.org/wiki/NP-complete NP-complete] problem <ref>[https://en.wikipedia.org/wiki/Nonogram Nonogram from Wikipedia]</ref>
6 KB (681 words) - 16:35, 1 December 2021
...[[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2002'''). ''Pattern Selection Problem for Automatically Generating Evaluation Functions For General Game Player''
21 KB (2,723 words) - 12:54, 14 March 2022
* [[Backtracking#8QinBitboards|Eight Queens Problem]]
5 KB (704 words) - 16:34, 27 June 2021
...nting the ideas in a computer, are enormous and, as yet, unsolved. Another problem was that not a single person in the audience was sufficiently competent to
17 KB (2,580 words) - 17:16, 16 November 2020
...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
3 KB (393 words) - 14:34, 7 December 2019
...a solution in a fixed number of moves. Dedicated [[:Category:Problem|chess problem and composition software]] is used as composition tool, and to prove correc
* [[:Category:Problem|Chess Problem Solving Engines]]
21 KB (2,769 words) - 14:23, 7 April 2021
* [[Nicolaas de Bruijn]] ('''1946'''). ''A Combinatorial Problem''. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764.
26 KB (2,459 words) - 21:00, 26 January 2021
* [[Nicolaas de Bruijn]] ('''1946'''). ''A Combinatorial Problem''. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764.
5 KB (659 words) - 17:57, 4 September 2018
* [http://www.talkchess.com/forum/viewtopic.php?t=21348 Problem suite testing - how to extract a useful number] by [[Don Dailey]], [[CCC]],
19 KB (2,659 words) - 17:19, 16 November 2020
* [[Tony Marsland]] ('''1967'''). ''Adaptive Computer Programs: An Aid in Problem Analysis''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Wash
28 KB (3,765 words) - 16:01, 16 November 2020
: [https://en.wikipedia.org/wiki/Counting_problem_%28complexity%29 Counting problem (complexity) from Wikipedia]
9 KB (1,299 words) - 12:44, 16 January 2020
...ery well. In one second, they can examine thousands of possible moves. The problem is, they stop to consider lousy moves that a human player wouldn't waste a
3 KB (515 words) - 14:42, 7 December 2019
* [[Steven M. Bellovin]] ('''1996'''). ''Problem areas for the IP security protocols''. In Proceedings of the Sixth Usenix U
9 KB (1,333 words) - 15:57, 16 November 2020
* [[Richard K. Guy]] ('''1960'''). ''A combinatorial problem''. [http://www.worldcat.org/title/nabla/oclc/243874131 Nabla], Vol. 7 <ref>
...culty/patrick-kelly Patrick A. Kelly] ('''1968'''). ''The no-three-in-line problem''. [https://en.wikipedia.org/wiki/Canadian_Mathematical_Bulletin Canadian M
16 KB (2,229 words) - 18:24, 1 December 2021
...July 11–21, 1994 <ref>[https://en.wikipedia.org/wiki/Angel_problem Angel problem from Wikipedia]</ref>
* [https://en.wikipedia.org/wiki/Angel_problem Angel problem from Wikipedia]
11 KB (1,569 words) - 15:47, 21 April 2020
...t was saying “Okay this is what I'm going to do,” and so I treated the problem that way and looked at okay, how do you store the [[Board Representation|po
13 KB (1,808 words) - 10:45, 11 October 2020
...n Wu]] ('''2011'''). ''An Efficient Approach to Solving the Minimum Sudoku Problem''. [[ICGA Journal#34_4|ICGA Journal, Vol. 34, No. 4]] <ref>[https://en.wiki
..., [[I-Chen Wu]], [[Der-Johng Sun]] ('''2012'''). ''Solving the Slitherlink Problem''. [[TAAI 2012]] <ref>[https://en.wikipedia.org/wiki/Slitherlink Slitherlin
19 KB (2,462 words) - 19:19, 4 April 2022
* [[Tristan Cazenave]] ('''1995'''). ''Learning and Problem Solving in Gogol, a Go playing program''. [http://www.lamsade.dauphine.fr/%
...Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows''. Evostar 2011, [http://www.lamsade.dauphine.fr/%7Ecazen
22 KB (2,874 words) - 12:30, 14 March 2022
...al reasoning steps regarding single rows and columns, the general Nonogram problem is [https://en.wikipedia.org/wiki/NP-hard NP-hard].
7 KB (908 words) - 18:50, 6 October 2020
...as a [https://en.wikipedia.org/wiki/Multi-armed_bandit multi-armed bandit problem], where the crucial tradeoff the [https://en.wikipedia.org/wiki/Gambling ga
...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
25 KB (3,413 words) - 12:36, 23 October 2020
...ink.springer.com/chapter/10.1007/11922155_13 The Graph-History Interaction Problem in Chinese Chess]''. [[Advances in Computer Games 11]]
10 KB (1,261 words) - 21:25, 30 November 2021
...9/11606?locale=en Shape-Keeping Technique and Its Application to Checkmate Problem Composition]''. [http://tr.aiide.org/ 2013 AIIDE Workshop]
20 KB (2,668 words) - 19:20, 4 April 2022
...artin Müller]] ('''2003'''). ''Df-pn in Go: An Application to the One-Eye Problem''. [[Advances in Computer Games 10]]
...ler]] ('''2004'''). ''A General Solution to the Graph History Interaction Problem''. [[AAAI]] National Conference, [http://webdocs.cs.ualberta.ca/~mmueller/p
9 KB (1,169 words) - 17:20, 16 November 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
...Schaeffer]] ('''2000'''). ''[[Sokoban]]: A Challenging Single-Agent Search Problem.'' Games in AI Research
47 KB (6,253 words) - 19:20, 4 April 2022
...://link.springer.com/chapter/10.1007/3-540-48957-6_3 A Solution to the GHI Problem for Best-First Search]''. [[CG 1998]]
...[[Alex de Voogt]], [[Jos Uiterwijk]] ('''2000'''). ''Human versus Machine Problem Solving: Winning Openings in Dakon.'' Accepted for publication in Board Gam
32 KB (4,247 words) - 12:36, 14 March 2022
...7/3-540-45579-5_14 Creating Difficult Instances of the Post Correspondence Problem]''. [[CG 2000]]
7 KB (949 words) - 18:38, 13 March 2019
* [https://www.stmintz.com/ccc/index.php?id=407134 Subject: Problem (small bug?) with Nalimov TBs] by [[Dieter Bürßner]], [[CCC]], January 23
8 KB (1,100 words) - 11:05, 22 September 2018
Problem is, no one else has stepped forward. I was there when Barend Swets (Believ
6 KB (805 words) - 14:50, 7 December 2019
...yer, member of the German [[Chess Problems, Compositions and Studies|chess problem]] association [https://en.wikipedia.org/wiki/Die_Schwalbe Die Schwalbe] <re
4 KB (498 words) - 17:21, 16 November 2020
...ing chess.'' Symposium on theory and computing methods in the upper mantle problem, [https://stacks.stanford.edu/file/tn736hy2288/tn736hy2288.pdf pdf]
7 KB (818 words) - 10:42, 25 January 2020
...y end games. It was a research project on translating book descriptions of problem solving methods into program heuristics. It is well known that the followin
...ess the actual mating can take up to forty moves. Huberman's model for the problem was a forcing tree co-ordinated with two functions (better and worse) which
5 KB (754 words) - 15:01, 7 December 2019
...tps://en.wikipedia.org/wiki/Excelsior_%28chess_problem%29 Excelsior (chess problem) from Wikipedia]</ref>
...base.com/post/a-chess-problem-holds-the-key-to-human-consciousness A chess problem holds the key to human consciousness?] by [[Frederic Friedel]], [[ChessBase
19 KB (2,253 words) - 23:28, 31 January 2022
...zle]]</ref>. László Lindner was a proponent of computer chess as a chess problem-solving tool. He organized the [[WMCCC 1983]] in [https://en.wikipedia.org/
...szló Lindner]] ('''1983'''). ''Experience with the Second Human-Computer Problem Test''. [[ICGA Journal#6_3|ICCA Journal, Vol. 6, No. 3]]
8 KB (1,111 words) - 17:22, 16 November 2020
...y before you did... software engineering wants to avoid that 'reinvention' problem...
...m/group/rec.games.chess.computer/msg/db825bdc948464b6 Re: crafty copyright problem] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], February 17, 1999</re
41 KB (6,029 words) - 08:36, 1 May 2021
* [[Ivan Bratko]] ('''1982'''). ''Knowledge-Based Problem-Solving in AL3.'' [http://www.doc.ic.ac.uk/~shm/MI/mi10.html Machine Intell
...inger.com/chapter/10.1007/978-3-642-39112-5_131 Search-Based Estimation of Problem Difficulty for Humans]''. [http://dblp.uni-trier.de/db/conf/aied/aied2013.h
19 KB (2,644 words) - 22:30, 23 May 2021
...>[[Matej Guid]] ('''2010'''). ''Search and Knowledge for Human and Machine Problem Solving''. Ph.D. thesis, [[University of Ljubljana]], [http://eprints.fri.u
...inger.com/chapter/10.1007/978-3-642-39112-5_131 Search-Based Estimation of Problem Difficulty for Humans]''. [http://dblp.uni-trier.de/db/conf/aied/aied2013.h
11 KB (1,445 words) - 21:42, 30 November 2021
.../Kitsune Kitsune from Wikipedia]</ref>, a software aiming at solving digit problem of a famous [http://simple.wikipedia.org/wiki/Countdown_%28game_show%29 tel
6 KB (896 words) - 18:55, 7 March 2019
...mentaldeeplearningproblem.html Sepp Hochreiter's Fundamental Deep Learning Problem (1991)] by [[Jürgen Schmidhuber]], 2013</ref>
...Yoshua Bengio]] ('''2014'''). ''Identifying and attacking the saddle point problem in high-dimensional non-convex optimization''. [https://arxiv.org/abs/1406.
73 KB (9,313 words) - 12:30, 14 March 2022
...Bruno Bouzy]] ('''2015'''). ''An Experimental Investigation on the Pancake Problem''. [[Conferences#IJCAI2015|IJCAI Computer Games Workshop]], [http://www.mi.
8 KB (1,040 words) - 14:24, 19 February 2019
...Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.'' [[ICGA Journal#10_1|ICCA
...Humans learn from Computers?'' Search and Knowledge for Human and Machine Problem Solving, [[Matej Guid]], [[Matej Guid#PHDthesis|Ph.D. thesis]], [[ICGA Jour
19 KB (2,508 words) - 16:59, 13 January 2021
...arrangierte Match gegen den Computer:Schach-Mikro für Boris Spasskij kein Problem], April 24, 1981, [[#Woche|Computerwoche]] 17/1981 » [[Rook (Program)|Rook
13 KB (1,335 words) - 17:42, 4 June 2018
Bob Herschberg was fully dedicated to science, language, literature, and problem solving. He was not a chess-player himself, but his father was, and in the
17 KB (2,407 words) - 17:24, 16 November 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=46586 Problem with UCI engines hash in Arena] by Carl Langan, [[CCC]], December 26, 2012
16 KB (2,396 words) - 09:48, 3 July 2021
...orum.net/cgi-bin/rybkaforum/topic_show.pl?pid=494867 Re: Lomonosov tables: problem with en-passant?] by [[Victor Zakharov]], [[Computer Chess Forums|Rybka Aqu
3 KB (421 words) - 12:05, 2 June 2018
: ''Computer Problem Solving''. pp. 86
4 KB (627 words) - 21:33, 26 September 2020
* [[Tihamér Nemes]] ('''1950 apr'''). ''An electronic problem solver''. The Fairy Chess Review, p. 101.
4 KB (612 words) - 19:44, 7 October 2021
...d [[Ken Thompson]], already working on a chess hardware for [[Belle]], the problem with CHEOPS was the lack of positional [[Evaluation|evaluation]] support <r
6 KB (834 words) - 13:24, 28 July 2018
| [[NSS|Chess Playing Programs and the Problem of Complexity]]<br/>(excerpt)
9 KB (1,047 words) - 21:47, 26 September 2020
...'s Zugzwang. Nevertheless Computers also have some disadvantages. The main problem is the point where the chess engine has to decide whether to enter a certai
13 KB (1,924 words) - 12:07, 7 November 2018
[[Category:Problem]]
5 KB (726 words) - 20:25, 17 June 2021
...achine_Learning_%28journal%29 Machine Learning], Vol. 19, No. 1</ref>, and problem representation. He received his Ph.D. in 1984 from [https://en.wikipedia.or
7 KB (1,019 words) - 16:10, 3 June 2018
...n/chess/queue.pdf pdf], [https://en.wikipedia.org/wiki/Chess_problem Chess problem] related <ref>[http://www-math.mit.edu/~rstan/chess/ Chess Problems]</ref>
12 KB (1,820 words) - 17:10, 3 June 2018
* [http://www.talkchess.com/forum/viewtopic.php?t=28823 Crafty problem with cutechess-cli] by [[Gian-Carlo Pascutto]], [[CCC]], July 07, 2009 » [
5 KB (699 words) - 15:43, 18 May 2019
...('''2010'''). ''On the power of nodes of degree four in the local max-cut problem''. CIAC'10, Rome, early version was published as a technical report in 2009
7 KB (918 words) - 17:27, 16 November 2020
...ink.springer.com/chapter/10.1007/11922155_13 The Graph-History Interaction Problem in Chinese Chess]''. [[Advances in Computer Games 11]]
...Yang]], [[Jr-Chang Chen]], [[Shun-Chin Hsu]] ('''2007'''). ''Study on loop problem in opening database for chinese chess programs''. [http://www.informatik.un
11 KB (1,443 words) - 17:29, 16 November 2020
...] ('''2007'''). ''[http://dl.acm.org/citation.cfm?id=1770082 Study on loop problem in opening database for chinese chess programs]''. [http://www.informatik.u
12 KB (1,508 words) - 15:29, 29 June 2020
...'''). ''Improving Human Players’ T-Spin Skills in Tetris with Procedural Problem Generation''. [[Advances in Computer Games 16]]
4 KB (474 words) - 16:21, 1 December 2021
...n Wu]] ('''2011'''). ''An Efficient Approach to Solving the Minimum Sudoku Problem''. [[ICGA Journal#34_4|ICGA Journal, Vol. 34, No. 4]] <ref>[https://en.wik
4 KB (482 words) - 12:55, 16 January 2021
..., [[I-Chen Wu]], [[Der-Johng Sun]] ('''2012'''). ''Solving the Slitherlink Problem''. [http://idb.csie.ncku.edu.tw/taai2012conference/ TAAI 2012], [https://en
3 KB (395 words) - 12:46, 7 June 2018
...ink.springer.com/chapter/10.1007/11922155_13 The Graph-History Interaction Problem in Chinese Chess]''. [[Advances in Computer Games 11]]
2 KB (263 words) - 23:58, 28 November 2018
...Yang]], [[Jr-Chang Chen]], [[Shun-Chin Hsu]] ('''2007'''). ''Study on loop problem in opening database for chinese chess programs''. [http://www.informatik.un
20 KB (2,569 words) - 12:33, 14 March 2022
...o maximize a numeric reward over time. While a general formulation of this problem in terms of
5 KB (648 words) - 23:46, 28 November 2018
.../10.1023%2FA%3A1013689704352 Finite-time Analysis of the Multiarmed Bandit Problem]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine L
...'1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html N
10 KB (1,271 words) - 11:25, 1 May 2020
.../10.1023%2FA%3A1013689704352 Finite-time Analysis of the Multiarmed Bandit Problem]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine L
...'1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html N
9 KB (1,263 words) - 16:08, 5 September 2018
...('''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
9 KB (1,282 words) - 21:58, 3 November 2020
...research is in the areas of [https://en.wikipedia.org/wiki/Problem_solving problem-solving], heuristic [[Search|search]], and [[Planning|planning]] in [[Artif
...Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem''. [http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai2007.html IJ
10 KB (1,348 words) - 17:30, 16 November 2020
...ttp://hiarcs.net/forums/viewtopic.php?t=7026& Mephisto Vancouver Exclusive Problem] by BlackSails911, [[Computer Chess Forums|Hiarcs Forum]], January 27, 2015
6 KB (744 words) - 18:25, 10 April 2020
...https://www.game-ai-forum.org/icga-tournaments/program.php?id=164 8 Queens Problem] and his [[Clobber]] program [https://www.game-ai-forum.org/icga-tournament
6 KB (819 words) - 18:49, 13 March 2019
...n's]] mate finding program <ref>[[Paul Wiereyn]] ('''1985'''). ''Inventive Problem Solving''. [[ICGA Journal#8_4|ICCA Journal, Vol. 8, No. 4]]</ref>. The expe
6 KB (829 words) - 17:31, 16 November 2020
...2/17x17-problem-solved-also-18x18.html Computational Complexity: The 17x17 problem SOLVED! (also 18x18)] by [http://www.cs.umd.edu/~gasarch/ Bill Gasarch], Fe
...2/17x17-problem-solved-also-18x18.html Computational Complexity: The 17x17 problem SOLVED! (also 18x18)] by [http://www.cs.umd.edu/~gasarch/ Bill Gasarch], Fe
12 KB (1,535 words) - 17:08, 16 November 2020
...2/17x17-problem-solved-also-18x18.html Computational Complexity: The 17x17 problem SOLVED! (also 18x18)] by [http://www.cs.umd.edu/~gasarch/ Bill Gasarch], Fe
...2/17x17-problem-solved-also-18x18.html Computational Complexity: The 17x17 problem SOLVED! (also 18x18)] by [http://www.cs.umd.edu/~gasarch/ Bill Gasarch], Fe
7 KB (901 words) - 09:27, 16 June 2018
* [[Michael Schlosser]] ('''1988'''). ''Computers and Chess-Problem Composition.'' [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]]
* [[László Lindner]], [[Michael Schlosser]] ('''1991'''). ''New Ideas in Problem Solving and Composing Programs''. [[Advances in Computer Chess 6]]
7 KB (875 words) - 17:31, 16 November 2020
...han Schaeffer]] ('''2000'''). ''Sokoban: A Challenging Single-Agent Search Problem.'' Games in AI Research (eds. [[Jaap van den Herik]] and [[Hiroyuki Iida]])
5 KB (725 words) - 17:32, 16 November 2020
...tps://en.wikipedia.org/wiki/Travelling_salesman_problem Traveling Salesman Problem]'' under the supervision of [[Monroe Newborn]] <ref>[http://www.cs.mcgill.c
8 KB (1,153 words) - 17:34, 16 November 2020
...ck]]. Rookie started its life in the early 90s, evolved from a mate-in-two problem solver, and was entirely written in [[68000]] [[Assembly|assembly]] <ref>[[
12 KB (1,671 words) - 02:08, 25 October 2022
...uy]] <ref>[https://en.wikipedia.org/wiki/Zarankiewicz_problem Zarankiewicz problem from Wikipedia]</ref>
5 KB (639 words) - 12:10, 20 June 2018
...3Pasta%E2%80%93Ulam%E2%80%93Tsingou_problem Fermi–Pasta–Ulam–Tsingou problem from Wikipedia]
11 KB (1,611 words) - 16:06, 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, Re
11 KB (1,628 words) - 22:59, 20 January 2020
...3Pasta%E2%80%93Ulam%E2%80%93Tsingou_problem Fermi–Pasta–Ulam–Tsingou problem from Wikipedia]
2 KB (329 words) - 16:04, 7 December 2019
