.../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
