...p://www.sciencedirect.com/science/article/pii/0022247X72901035 The Riemann problem for materials with nonconvex equations of state I: Isentropic Flow]''. [htt
...p://www.sciencedirect.com/science/article/pii/0022247X72900753 The Riemann problem for materials with nonconvex equations of state II: General Flow]''. [https
5 KB (717 words) - 17:35, 16 November 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=66804 Problem position using Scorpio Egbbs] by [[Ross Boyd]], [[CCC]], March 11, 2018
7 KB (972 words) - 16:06, 25 December 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=41744 NebiyuReversi problem] by [[Harm Geert Muller]], [[CCC]], January 02, 2012
4 KB (470 words) - 16:41, 27 June 2021
...://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''. Theoretical Computer Science, Vol. 252, Nos. 1-2,
5 KB (744 words) - 17:36, 16 November 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''. Theoretical Computer Science, Vol. 252, Nos. 1-2
7 KB (1,013 words) - 17:36, 16 November 2020
...a.org/wiki/Cognitive_architecture cognitive architecture] for learning and problem solving inspired by [[Herbert Simon|Herbert A. Simon's]] ideas of [https://
5 KB (736 words) - 11:24, 21 June 2018
...g/doi/abs/10.1162/089976600300014700#.VfGbP5dpluM Evolution of Cooperative Problem Solving in an Artificial Economy]''. [https://en.wikipedia.org/wiki/Neural_
7 KB (949 words) - 22:24, 14 June 2021
* [https://www.stmintz.com/ccc/index.php?id=72221 Problem with draws by rep and hash table] by [[James Robertson]], [[CCC]], October
3 KB (399 words) - 14:10, 26 September 2019
...llon with the thesis ''Learning by Analogical Reasoning in General Purpose Problem Solving'' under advisor [[Jaime Carbonell]] in 1992. Her [https://en.wikipe
...u/vufind/Record/421096 Learning by Analogical Reasoning in General Purpose Problem Solving]''. Ph.D. thesis, [[Carnegie Mellon University]], advisor [[Jaime C
5 KB (748 words) - 20:31, 23 June 2018
* [https://www.stmintz.com/ccc/index.php?id=458853 Problem with PolyGlot 1.3] by [[Álvaro Begué]], [[CCC]], October 30, 2005
* [http://www.talkchess.com/forum/viewtopic.php?t=36722 Problem using XBoard + Polyglot + Zippy on FICS] by [[Ben-Hur Carlos Vieira Langoni
15 KB (1,925 words) - 01:55, 15 December 2022
...n.wikipedia.org/wiki/Boolean_satisfiability_problem Boolean satisfiability problem], [https://en.wikipedia.org/wiki/Horn-satisfiability Horn-satisfiability],
...wald Speckenmeyer]] ('''1983'''). ''Untersuchungen zum Feedback Vertex Set Problem in ungerichteten Graphen''. [[Paderborn University|Universität-GH Paderbor
6 KB (698 words) - 16:54, 26 June 2018
...com/ccc/index.php?id=258554 well knowned ( or maybe not so knowned ) chess problem from 1906] by [[Michael Byrne|Mike Byrne]], [[CCC]], October 11, 2002
...s://www.stmintz.com/ccc/index.php?id=258556 Re: CORRECT position for chess problem from 1906] by [[Michael Byrne|Mike Byrne]], [[CCC]], October 11, 2002
2 KB (294 words) - 14:21, 31 October 2018
...m/forum/viewtopic.php?t=66143 Need help to solve TLCV broadcast connection problem] by [[Sven Schüle]], [[CCC]], December 26, 2017
9 KB (1,200 words) - 12:14, 22 September 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=61823 ChessGUI Timer Problem] by [[Dennis Sceviour]], [[CCC]], October 24, 2016 » [[Chess Engine Commun
12 KB (1,617 words) - 08:00, 16 December 2022
...t and I'd kept it and I'd look at it from time to time and think about the problem, and around that time with the [[8080]], and of course there were lots of a
6 KB (964 words) - 21:22, 27 June 2018
...search.pdb?expression=A=%27Seret%27%20and%20FIRSTNAME=%27Jean_Luc%27 Chess Problem Database Serve]</ref>, strong [[Bridge]] and [[Backgammon]] player, and res
3 KB (378 words) - 13:44, 9 September 2019
* [http://www.talkchess.com/forum/viewtopic.php?t=20646 SEE problem] by [[Tord Romstad]], [[CCC]], April 13, 2008 » [[Static Exchange Evaluati
7 KB (897 words) - 15:52, 29 June 2021
...'t converge and it needs to be stopped at "suitable moment". This is a big problem as well as manual selection of deltas (or standard deviation of delta).
7 KB (1,030 words) - 17:02, 1 July 2018
...n having only a few minutes to make a decision. To somewhat alleviate this problem so-called speculative-pruning methods are used to cut off less interesting
...n of a non-linear assignment problem, there is already a linear assignment problem such that ¶ is the unique optimum.
20 KB (2,917 words) - 08:57, 2 July 2018
...a] et al. ('''1999'''). ''Genetic Programming III: Darwinian Invention and Problem Solving''. [https://en.wikipedia.org/wiki/Morgan_Kaufmann_Publishers Morgan
...''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
54 KB (7,205 words) - 01:06, 8 December 2020
...tml The tree representation for the pickup and delivery traveling salesman problem with LIFO loading]''. [https://en.wikipedia.org/wiki/European_Journal_of_Op
...0.1007/s10589-015-9780-2 A fast implementation for the 2D/3D box placement problem]''. [https://link.springer.com/journal/10589/63/2 Computational Optimizatio
4 KB (603 words) - 20:48, 23 May 2019
* [http://www.talkchess.com/forum/viewtopic.php?t=64912 What is causing this problem?] by [[Michael Sherwin]], [[CCC]], August 16, 2017 » [[Move Ordering]]
11 KB (1,559 words) - 21:01, 4 March 2019
* [http://www.talkchess.com/forum/viewtopic.php?t=31220 Stupid Extension Problem/Question] by [[John Merlino]], [[CCC]], December 23, 2009 » [[Extensions]]
10 KB (1,347 words) - 20:30, 10 November 2021
...[Search|search algorithms]], game playing and cognitive modelling of human problem solving. He has also built his own shogi program called [[Spear]] and is co
8 KB (1,068 words) - 17:41, 16 November 2020
...[[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2002'''). ''Pattern Selection Problem for Automatically Generating Evaluation Functions For General Game Player''
9 KB (1,162 words) - 21:35, 30 November 2021
...[[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2002'''). ''Pattern Selection Problem for Automatically Generating Evaluation Functions For General Game Player''
5 KB (571 words) - 00:00, 29 November 2018
...[[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2002'''). ''Pattern Selection Problem for Automatically Generating Evaluation Functions For General Game Player''
4 KB (559 words) - 22:01, 3 November 2020
* [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,
9 KB (1,326 words) - 11:06, 9 August 2018
* [http://www.talkchess.com/forum/viewtopic.php?t=30471 Problem with functions not inlining] by [[Gregory Strong]], [[CCC]], November 04, 2
20 KB (3,065 words) - 14:10, 18 November 2020
Multiple accumulators can help avoid this problem, as well as finding other ways to hide the latency.
9 KB (1,224 words) - 13:34, 9 August 2018
...d Gobet]] ('''1997'''). ''A Pattern-Recognition Theory of Search in Expert Problem Solving.'' Thinking and Reasoning, Vol. 3, No. 4
...expert_chess_players Specialization effect and its influence on memory and problem solving in expert chess players]''. Cognitive Science, Vol. 33, No. 6
18 KB (2,408 words) - 17:42, 16 November 2020
...g]], [[Memory|memory]], and [https://en.wikipedia.org/wiki/Problem_solving problem solving]. It is distinctive in its emphasis on the importance of perception
...('''1969'''). ''Information-processing analysis of perceptual processes in problem solving''. [https://en.wikipedia.org/wiki/Psychological_Review Psychologica
8 KB (1,188 words) - 15:24, 15 August 2018
...curately, their conceptual approach of “experience-recognition”-driven problem solving points to the need to incorporate analogical reasoning mechanisms i
14 KB (1,961 words) - 17:42, 16 November 2020
...the late 60s, he worked with [[Herbert Simon]] on perceptual processes in problem solving, and developed a program dubbed [[Perceiver]] based on previously d
.../1970-01781-001 Information-processing analysis of perceptual processes in problem solving]''. [https://en.wikipedia.org/wiki/Psychological_Review Psychologic
3 KB (362 words) - 17:42, 16 November 2020
...on perceptual processes] in [https://en.wikipedia.org/wiki/Problem_solving problem solving]. Perceiver was able to duplicate the [[Eye Movements|eye movements
.../1970-01781-001 Information-processing analysis of perceptual processes in problem solving]''. [https://en.wikipedia.org/wiki/Psychological_Review Psychologic
7 KB (959 words) - 16:52, 15 August 2018
...problem-solving Information-processing analysis of perceptual processes in problem solving]''. Psychological Review, Vol. 76, No. 5</ref>, further extended by
Explanations in terms of heuristic search postulate that problem solving, and cognition generally, is a serial, one-thing-at-a-time process.
16 KB (2,309 words) - 16:02, 2 May 2019
...i/Data_mining data mining], [https://en.wikipedia.org/wiki/Problem_solving problem solving], [https://en.wikipedia.org/wiki/Experimental_music experimental mu
8 KB (1,006 words) - 10:37, 3 September 2018
...w.talkchess.com/forum/viewtopic.php?t=52661 UCI, ownbooks, and a potential problem] by [[Miguel A. Ballicora]], [[CCC]], June 16, 2014 » [[UCI]], [[Opening B
8 KB (1,144 words) - 10:31, 3 September 2018
...a between processors could change as needed depending on the nature of the problem. This meant the mutability of the connections between processors were more
15 KB (2,109 words) - 20:05, 14 September 2020
...(Dynamic Neural Nets and the Fundamental Spatio-Temporal Credit Assignment Problem). Ph.D. thesis
11 KB (1,521 words) - 20:26, 13 July 2020
...Vol. 3, No. 2, pp. 13-15</ref> <ref>[[Larry Kaufman]] ('''1993'''). ''CCR Problem Set Vol. 3 No 1 and Vol. 3 No 2''. Vol. 4, No. 1, pp. 30-31</ref>.
* [[Larry Kaufman]] ('''1993'''). ''CCR Problem Set Vol. 3 No 1 and Vol. 3 No 2''. Vol. 4, No. 1, pp. 30-31
3 KB (717 words) - 16:11, 25 August 2018
* [http://www.talkchess.com/forum/viewtopic.php?t=51134 problem with syzygy tablebases] by [[Youri Matiounine]], [[CCC]], February 01, 2014
3 KB (437 words) - 22:00, 6 October 2019
* [https://www.stmintz.com/ccc/index.php?id=312449 Winboard problem (maybe Delphi only )] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], Aug
2 KB (320 words) - 10:02, 1 November 2018
...ddies: A Deep Neural Network-Based Estimation Metric for the Jigsaw Puzzle Problem''. [http://icann2016.org/ ICAAN 2016], [https://en.wikipedia.org/wiki/Lectu
8 KB (1,074 words) - 17:44, 16 November 2020
...ddies: A Deep Neural Network-Based Estimation Metric for the Jigsaw Puzzle Problem''. [http://icann2016.org/ ICAAN 2016], [https://en.wikipedia.org/wiki/Lectu
8 KB (1,056 words) - 17:44, 16 November 2020
* [[Albrecht Heeffer]] ('''2008'''). ''From Problem Solving to Argumentation: Pacioli’s Appropriation of Abbacus Algebra''. [
* [[Albrecht Heeffer]] ('''2011'''). ''From problem solving to the teaching of algebra: the genesis of the algebra textbook''.
17 KB (2,280 words) - 18:49, 24 September 2019
...Vučković]] ('''2001'''). ''Decision Trees and Search Strategies in Chess Problem Solving Applications'', Proceedings of a Workshop on Computational Intellig
6 KB (787 words) - 10:38, 3 September 2018
...alkchess.com/forum/viewtopic.php?t=61346 Cfish solves the dreaded URI hard problem] by [[Dann Corbit]], [[CCC]], September 05, 2016
7 KB (933 words) - 13:58, 7 November 2021
* FIX: nodes per second calculation overflow problem fixed
7 KB (997 words) - 13:29, 3 September 2018
...be, which gives you an idea of how much time you should spend to solve the problem...
...[[Crafty]], having tried (1) in the past. What I saw often enough to be a problem was the case where your opponent makes a deep move, that does not lose mate
3 KB (454 words) - 14:40, 12 September 2018
...tp://www.open-aurec.com/wbforum/viewtopic.php?f=18&t=46805&p=177043 Pepito problem] by [[Tord Romstad]], [[Computer Chess Forums|Winboard Forum]], March 10, 2
10 KB (1,298 words) - 16:51, 29 January 2021
* [https://www.stmintz.com/ccc/index.php?id=319788 Problem ending for Yace] by [[Jouni Uski]], [[CCC]], October 06, 2003
9 KB (1,364 words) - 22:56, 29 January 2021
* [https://www.stmintz.com/ccc/index.php?id=407134 Subject: Problem (small bug?) with Nalimov TBs] by [[Dieter Bürßner]], [[CCC]], January 23
7 KB (1,013 words) - 22:57, 29 January 2021
...g processor captures such a request, it distributes part of his own (sub-) problem. Using a tricky [https://en.wikipedia.org/wiki/Message_passing messaging sy
19 KB (2,692 words) - 20:59, 7 February 2021
...?id=318833 The "same threat extension" as effective way to resolve horizon problem], Sergei Markoff introduced the extension, [[CCC]], October 01, 2003</ref>.
...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], October 01, 2003 » [[Bo
6 KB (867 words) - 00:24, 13 June 2019
...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003</ref>, later dubbed [[Bot
...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003
10 KB (1,328 words) - 10:48, 19 October 2018
* [[Thomas Philip Runarsson]] ('''2000'''). ''Evolutionary Problem Solving''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Icela
...n]] ('''2011'''). ''Learning Heuristic Policies - A Reinforcement Learning Problem''. LION 2011, [https://notendur.hi.is/tpr/papers/Ru11lion.pdf pdf]
6 KB (734 words) - 17:30, 23 October 2018
...n Macukow] ('''1992'''). ''A Neural Network designed to solve the N-Queens Problem''. [http://www.informatik.uni-trier.de/~ley/db/journals/bc/bc72.html#Mandzi
* [[Jacek Mańdziuk]] ('''1995'''). ''Solving the N-Queens Problem with a Binary Hopfield-type Network. Synchronous and asynchronous model''.
9 KB (1,285 words) - 17:32, 23 October 2018
=Problem Statement=
Now we are ready to formulate the problem of optimizing the evaluation function in terms of [https://en.wikipedia.org
32 KB (4,725 words) - 08:55, 3 October 2020
...ps://en.wikipedia.org/wiki/Travelling_salesman_problem Travelling salesman problem from Wikipedia]</ref>
...''. [https://dl.acm.org/citation.cfm?id=207712 High performance computing: problem solving with parallel and vector architectures]
7 KB (1,036 words) - 22:21, 31 October 2018
...ps://en.wikipedia.org/wiki/Travelling_salesman_problem Travelling salesman problem from Wikipedia]</ref>
...''. [https://dl.acm.org/citation.cfm?id=207712 High performance computing: problem solving with parallel and vector architectures]
4 KB (535 words) - 22:21, 31 October 2018
...[Nodes per Second|nodes per second]] increase with Lazy evaluation but the problem is that we get a big increase in [[Node|nodes]]. It is this way because we
How you approach a problem is strongly related to how you DEFINE a problem or task. The goal of MP is to make the program play as well as possible usi
59 KB (8,113 words) - 11:58, 26 February 2021
...rtin Müller]]. ('''2003'''). ''Df-pn in Go: An Application to the One-Eye Problem''. [[Advances in Computer Games 10]]
...]] ('''2004'''). ''A General Solution to the [[Graph History Interaction]] Problem''. [[Conferences#AAAI-2004|AAAI 2004]]
15 KB (2,037 words) - 21:26, 30 November 2021
...[ICD Corporation|ICD's]] [[Computer Chess Reports]], Kaufman proposed a 25 problem [[Kaufman Test|test suite]] for chessplaying programs <ref>[https://groups.
* [[Larry Kaufman]] ('''1993'''). ''CCR Problem Set Vol. 3 No 1 and Vol. 3 No 2''. [[Computer Chess Reports]], Vol. 4, No.
17 KB (2,300 words) - 03:05, 16 August 2022
* [http://www.talkchess.com/forum/viewtopic.php?t=61823 ChessGUI Timer Problem] by [[Dennis Sceviour]], [[CCC]], October 24, 2016 » [[ChessGUI]]
4 KB (519 words) - 14:45, 7 September 2020
...reyn|Paul Wiereyn's]] [[Windows]] [[GUI]] [[APwin]]. It comes with a large problem collection and features quality printing supporting [https://en.wikipedia.o
[[Category:Problem]]
3 KB (457 words) - 11:41, 11 April 2021
...tps://www.stmintz.com/ccc/index.php?id=282362 endgame position - null move problem] by [[Jon Dart]], [[CCC]], February 06, 2003
* [https://www.stmintz.com/ccc/index.php?id=335956 interesting evaluation problem] by [[Jon Dart]], [[CCC]], December 14, 2003
7 KB (911 words) - 11:05, 13 February 2021
* [[Marvin Minsky]] ('''1954'''). ''Neural Nets and the Brain Model Problem''. Ph.D. dissertation, [https://en.wikipedia.org/wiki/Princeton_University
9 KB (1,182 words) - 11:30, 7 January 2020
* [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=31494 The problem with LMR in suprtactical positions] by [[Oliver Brausch]], [[CCC]], January
6 KB (819 words) - 21:53, 3 November 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=35206 Compiler Problem] by [[Fritz Reul]], [[CCC]], June 29, 2010
7 KB (952 words) - 10:44, 16 November 2018
* [[Ryan Rifkin]] ('''1998'''). ''The Static Stochastic Ground-Holding Problem''. Master's thesis, [[Massachusetts Institute of Technology|MIT]]
6 KB (815 words) - 15:46, 7 December 2019
...ye]] ('''2004'''). ''Information Flow and Computation in the Maxwell Demon Problem''. Complexica Report 031128, [https://arxiv.org/abs/physics/0401002 arXiv:p
5 KB (684 words) - 21:14, 19 November 2018
...icial Life to Work]''. [https://dl.acm.org/citation.cfm?id=573321 Parallel Problem Solving from Nature 2], [https://en.wikipedia.org/wiki/Elsevier North-Holla
6 KB (778 words) - 23:19, 19 November 2018
...ps://en.wikipedia.org/wiki/Travelling_salesman_problem Travelling salesman problem from Wikipedia]</ref>
...ps://link.springer.com/article/10.1007%2FBF01584070 The traveling-salesman problem and minimum spanning trees: Part II'']. [https://en.wikipedia.org/wiki/Math
12 KB (1,563 words) - 12:46, 21 November 2018
...l]] ('''1984'''). ''Heuristics: Intelligent Search Strategies for Computer Problem Solving''. [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley]
11 KB (1,576 words) - 19:35, 7 October 2020
..., the [https://en.wikipedia.org/wiki/Multi-armed_bandit multi-armed bandit problem] faces the tradeoff between [https://en.wikipedia.org/wiki/Exploitation_%28
.../10.1023%2FA%3A1013689704352 Finite-time Analysis of the Multiarmed Bandit Problem]''. [https://en.wikipedia.org/wiki/Machine_Learning_%28journal%29 Machine L
7 KB (1,028 words) - 10:04, 23 November 2018
...ity, and can therefore be computed directly from a model of the base-level problem-solver. We develop a formula for the expected value of a search step in a g
11 KB (1,567 words) - 17:46, 16 November 2020
...your project from [[RobboLito|Robbolito]] codebase... Personally I see no problem with that (other than you not telling the truth).
31 KB (4,126 words) - 19:21, 24 July 2021
...oogle.com/d/msg/rec.games.chess.computer/MyFmpXxqccg/Z6WgNuoF-hcJ Smullyan Problem in Sherlock Holmes book] by Christopher Heckman, [[Computer Chess Forums|rg
* [[Raymond Smullyan]] ('''1996'''). ''Set Theory and the Continuum Problem''. [https://en.wikipedia.org/wiki/Oxford_University_Press Oxford University
16 KB (2,122 words) - 17:28, 9 October 2019
...essvibes.com/?q=columns/lewis-carrolls-chess-problem Lewis Carroll's chess problem | ChessVibes], July 14, 2008</ref>
7 KB (909 words) - 16:14, 28 November 2018
...f Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp
5 KB (732 words) - 17:47, 16 November 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=36722 Problem using XBoard + Polyglot + Zippy on FICS] by [[Ben-Hur Carlos Vieira Langoni
3 KB (345 words) - 14:26, 5 December 2018
: [https://en.wikipedia.org/wiki/Optimization_problem Optimization problem from Wikipedia]
4 KB (531 words) - 23:41, 26 October 2020
...VoPGSRksC A parallel memetic algorithm on GPU to solve the task scheduling problem in heterogeneous environments]''. [http://www.sigevo.org/gecco-2013/program
63 KB (8,627 words) - 10:34, 24 January 2024
...reduced integer range of effectively one bit less, which is most often no problem for 32-bit integers in chess programs, like scores and that like: <span sty
...reduced integer range of effectively one bit less, which is most often no problem for 32-bit integers in chess programs, like scores and that like: <span sty
10 KB (1,510 words) - 10:50, 12 April 2020
* [[Hagen Huwig]] ('''1980'''). ''Das P=NP-Problem in der Kategorie der partiellen Ordnungen mit 2-stelligen Suprema''. [https
* [[Hagen Huwig]] ('''1981'''). ''A Definition of the P=NP-Problem in Categories''. [http://www.informatik.uni-trier.de/~ley/db/conf/fct/fct81
6 KB (751 words) - 14:08, 13 December 2018
...tp://www.britannica.com/EBchecked/topic/264261/heterodox-problem heterodox problem | chess composition | Encyclopedia Britannica]</ref> [[Chess Problems, Comp
....com/thomas-maeder/popeye GitHub - thomas-maeder/popeye: Popeye is a chess problem solving and testing software with strong support for fairy chess and hetero
4 KB (563 words) - 11:28, 31 January 2020
The first problem is how to enumerate features. In general, anything that affects the overall
6 KB (1,013 words) - 15:07, 17 December 2018
...Fruit/Rybka relationship, but this is not so. Strelka did not look like a problem because I assumed it was free.
4 KB (653 words) - 15:57, 17 December 2018
...laiming to have written their own. I stopped doing this years ago once the problem of plagiarism was shown to be one that would not go away no matter what the
32 KB (5,514 words) - 16:40, 17 December 2018
...n-aurec.com/wbforum/viewtopic.php?f=18&t=47667 Amundsen 0.3 and his book : problem ?] by Claude Dubois, [[Computer Chess Forums|Winboard Forum]], May 24, 2004
8 KB (1,094 words) - 11:05, 27 February 2019
* [https://www.stmintz.com/ccc/index.php?id=303131 Problem with extending to maxdepth] by [[Albert Bertilsson]], [[CCC]], June 26, 200
9 KB (1,110 words) - 13:55, 22 November 2020
* [https://www.stmintz.com/ccc/index.php?id=303131 Problem with extending to maxdepth] by [[Albert Bertilsson]], [[CCC]], June 26, 200
5 KB (691 words) - 12:55, 27 December 2018
...tps://en.wikipedia.org/wiki/Memory_bandwidth memory-bandwidth] is the real problem. Since Gromit's [[Evaluation|evaluation]] and [[Search|search heuristics]]
9 KB (1,211 words) - 14:27, 19 December 2019
* [http://www.talkchess.com/forum/viewtopic.php?t=22015 64-bit PGO problem?] by [[Martin Bryant]], [[CCC]], June 27, 2008
10 KB (1,433 words) - 09:09, 30 April 2021
...pan>[https://www.youtube.com/watch?v=PNKj529yY5c Reasoning: Goal Trees and Problem Solving]
9 KB (1,266 words) - 20:36, 7 January 2019
...tps://www.stmintz.com/ccc/index.php?id=282362 endgame position - null move problem] by [[Jon Dart]], [[CCC]], February 06, 2003
1 KB (219 words) - 11:40, 24 September 2019
...apture extensions]] is considered to be optimal by other programmers. This problem is not simple at all. I am considering for now recapture extensions of equa
7 KB (1,138 words) - 10:07, 27 January 2019
...time a little non-deterministic. But this is mostly not regarded as a real problem for chess developers.
...n id="9"></span>[http://www.talkchess.com/forum/viewtopic.php?t=65718 Java problem!] by [[Günther Simon]], [[CCC]], November 13, 2017
14 KB (2,039 words) - 20:19, 22 June 2020
...i/S0305054810001504 An exact bit-parallel algorithm for the maximum clique problem]''. [https://dblp.uni-trier.de/db/journals/cor/cor38.html Computers & Opera
...i/S0305054810001504 An exact bit-parallel algorithm for the maximum clique problem]''. [https://dblp.uni-trier.de/db/journals/cor/cor38.html Computers & Opera
9 KB (1,379 words) - 17:22, 6 February 2019
...e Vol. 32 No. 3] <ref>[https://en.wikipedia.org/wiki/Clique_problem Clique problem from Wikipedia]</ref>
5 KB (690 words) - 21:41, 6 February 2019
...bit-parallel [https://en.wikipedia.org/wiki/Clique_problem Maximum clique problem] solver <ref>[[Pablo San Segundo]], [[Diego Rodríguez-Losada]], [[Fernando
...e Vol. 32 No. 3] <ref>[https://en.wikipedia.org/wiki/Clique_problem Clique problem from Wikipedia]</ref>
6 KB (838 words) - 22:19, 7 February 2019
...bit-parallel [https://en.wikipedia.org/wiki/Clique_problem maximum clique problem] solver
...e Vol. 32 No. 3] <ref>[https://en.wikipedia.org/wiki/Clique_problem Clique problem from Wikipedia]</ref>
6 KB (878 words) - 21:40, 6 February 2019
...i/S0305054810001504 An exact bit-parallel algorithm for the maximum clique problem]''. [https://dblp.uni-trier.de/db/journals/cor/cor38.html Computers & Opera
5 KB (663 words) - 22:47, 7 February 2019
...roach is empirically evaluated on the standard Inductive Logic Programming problem of learning classification rules for the [[KRK]] chess endgame.
7 KB (959 words) - 22:32, 23 May 2021
* [[Simona Tancig]] ('''2009'''). ''Expert Team Decision Making and Problem Solving: Development and Learning''. in Interdisciplinary Description of Co
8 KB (1,150 words) - 08:56, 7 April 2019
* [http://www.talkchess.com/forum/viewtopic.php?t=64912 What is causing this problem?] by [[Michael Sherwin]], [[CCC]], August 16, 2017 » [[Move Ordering]]
11 KB (1,508 words) - 08:46, 30 April 2021
...'1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html N
...'1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html N
16 KB (2,103 words) - 22:41, 23 May 2019
...VoPGSRksC A parallel memetic algorithm on GPU to solve the task scheduling problem in heterogeneous environments]''. [http://www.sigevo.org/gecco-2013/program
7 KB (926 words) - 22:31, 5 March 2019
...polyominoes] <ref>[http://www2.stetson.edu/%7Eefriedma/mathmagic/0500.html Problem of the Month (May 2000)] from [http://www2.stetson.edu/%7Eefriedma/mathmagi
...a]], [[Yoshiyuki Kotani]] ('''2006'''). ''A New Method of Dealing with GHI Problem for Proving Draw and Application to 3x4 Boards of Shogi''. IPSJ Transaction
9 KB (1,141 words) - 17:50, 16 November 2020
...a]], [[Yoshiyuki Kotani]] ('''2006'''). ''A New Method of Dealing with GHI Problem for Proving Draw and Application to 3x4 Boards of Shogi''. IPSJ Transaction
3 KB (432 words) - 17:51, 16 November 2020
...a]], [[Yoshiyuki Kotani]] ('''2006'''). ''A New Method of Dealing with GHI Problem for Proving Draw and Application to 3x4 Boards of Shogi''. IPSJ Transaction
3 KB (364 words) - 19:51, 30 September 2020
...ompare the win probabilities between the different engines and resolve the problem in the optimistic voting with a heterogeneous system. We performed the tour
...performance, it requires enormous computation resources. To alleviate the problem, this paper proposes to incorporate a checkmate solver in self-play. We sho
8 KB (1,195 words) - 14:09, 28 January 2020
...'''). ''Improving Human Players’ T-Spin Skills in Tetris with Procedural Problem Generation''. [[Advances in Computer Games 16]]
7 KB (1,015 words) - 16:43, 1 December 2021
* [[Laveen Kanal|Laveen N. Kanal]] ('''1979'''). ''Problem-Solving Models and Search Strategies for Pattern Recognition''. [[IEEE#TPAM
..._Problem_Reduction_Representation_for_the_Linguistic_Analysis_of_Waveforms Problem Reduction Representation for the Linguistic Analysis of Waveforms]''. [[IEE
11 KB (1,478 words) - 12:08, 10 March 2019
..._Problem_Reduction_Representation_for_the_Linguistic_Analysis_of_Waveforms Problem Reduction Representation for the Linguistic Analysis of Waveforms]''. [[IEE
2 KB (322 words) - 20:30, 9 March 2019
...://link.springer.com/book/10.1007/b107306 Metaheuristics: Progress as Real Problem Solvers]''. [https://link.springer.com/bookseries/6375 Operations Research
8 KB (1,010 words) - 17:51, 16 November 2020
...ity, and can therefore be computed directly from a model of the base-level problem-solver. We develop a formula for the value of a search step in a game-playi
...ity, and can therefore be computed directly from a model of the base-level problem-solver. We develop a formula for the expected value of a search step in a g
5 KB (768 words) - 15:08, 10 March 2019
...). ''[https://pub.uni-bielefeld.de/publication/1775100 Note on an extremal problem arising for unreliable networks in parallel computing]''. [https://en.wikip
...ience/article/pii/009731659390079N A New Upper Bound for the Football Pool Problem for Nine Matches]''. [https://en.wikipedia.org/wiki/Journal_of_Combinatoria
4 KB (578 words) - 14:34, 11 March 2019
* [[Jaime Carbonell]] ('''1980'''). ''Learning and Problem Solving by Analogy''. Preprints of the CMU Machine Learning Workshop-Sympos
...ng|Dawn Song]], [[Jaime Carbonell]] ('''2017'''). ''The exploding gradient problem demystified - definition, prevalence, impact, origin, tradeoffs, and soluti
9 KB (1,156 words) - 23:05, 11 March 2019
...e d'Orsay], [http://da.wikipedia.org/wiki/Psykofysisk_problem Psykofysisk problem from Wikipedia.da] (Danish), [http://commons.wikimedia.org/wiki/Category:Le
8 KB (1,193 words) - 15:44, 25 December 2020
* [https://www.stmintz.com/ccc/index.php?id=305906 Problem with TT] by [[Grzegorz Sidorowicz]], [[CCC]], July 11, 2003 » [[Transposit
1 KB (164 words) - 13:06, 17 March 2019
...000|2000]] <ref>[https://en.wikipedia.org/wiki/Year_2000_problem Year 2000 problem from Wikipedia]</ref> .
* [https://en.wikipedia.org/wiki/Y1C_Problem Y1C Problem from Wikipedia]
5 KB (684 words) - 23:30, 8 July 2019
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=2&t=5317 Problem with new Gosu] Postby Tony Thomas, [[Computer Chess Forums|Winboard Forum]]
6 KB (801 words) - 20:56, 9 September 2020
...attention may lose a chess game, whereas a single successful approach to a problem, among many which have been relegated to the wastebasket, will make a mathe
8 KB (1,184 words) - 15:50, 7 December 2019
...). ''[https://ieeexplore.ieee.org/document/4503295 Programming Intelligent Problem Solvers]''. [[IEEE#SMC|IRE Transactions on Human Factors in Electronics]],
...eitman]], [[Bruce Wilcox]] ('''1979'''). ''Modelling Tactical Analysis and Problem Solving in Go''. Proceedings of the Tenth Annual Pittsburgh Conference on M
8 KB (1,172 words) - 21:28, 7 April 2019
.../1970-01781-001 Information-processing analysis of perceptual processes in problem solving]''. [https://en.wikipedia.org/wiki/Psychological_Review Psychologic
4 KB (583 words) - 17:52, 16 November 2020
* [[Azlan Iqbal]] ('''2017'''). ''A Computer Composes A Fabled Problem: Four Knights vs. Queen''. [https://arxiv.org/abs/1709.00931 arXiv:1709.009
* Computer Generated Chess Problem 00146, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
10 KB (1,263 words) - 20:41, 13 April 2019
=Solving Shannon's Problem=
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]</ref> <ref>[[Claude Sha
12 KB (1,781 words) - 17:53, 16 November 2020
...also referred to as [http://catb.org/jargon/html/N/NUXI-problem.html NUXI problem]. The related term [[Big-endian|big-endian]] (as opposed to [[Little-endian
8 KB (1,314 words) - 20:34, 26 April 2019
* [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,
4 KB (478 words) - 12:20, 28 April 2019
...n <ref>[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,
* [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,
10 KB (1,462 words) - 13:00, 28 April 2019
* [[Alan H. Bond]] ('''2002'''). ''Problem-solving behavior in a system model of the primate neocortex''. [https://www
7 KB (949 words) - 22:06, 3 November 2020
...-aurec.com/wbforum/viewtopic.php?f=4&t=4038&p=20576 Help! SnailChess Debug problem] by [[Rasjid Chan]], [[Computer Chess Forums|Winboard Forum]], December 28,
6 KB (790 words) - 20:55, 2 May 2019
* [http://www.talkchess.com/forum/viewtopic.php?t=34365 A hashing problem] by [[Rasjid Chan]], [[CCC]], May 18, 2010
4 KB (504 words) - 09:34, 3 May 2019
a [[:Category:Problem|program for solving]] orthodox [[Chess Problems, Compositions and Studies|c
...load and save [[Forsyth-Edwards Notation|FEN]] or proprietary GST-files of problem collections, and to control the search.
3 KB (445 words) - 12:04, 16 May 2019
...is author of the Orthodox [[Chess Problems, Compositions and Studies|Chess Problem]] solving program [[Gustav]], initially developed from 1990 until 1993 unde
2 KB (266 words) - 12:15, 16 May 2019
* [https://www.stmintz.com/ccc/index.php?id=312449 Winboard problem (maybe Delphi only )] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], Aug
* [https://www.stmintz.com/ccc/index.php?id=388903 A Delphi - WinBoard problem] by [[Martin Giepmans]], [[CCC]], September 24, 2004
7 KB (989 words) - 16:48, 16 May 2019
* [https://www.stmintz.com/ccc/index.php?id=388903 A Delphi - WinBoard problem] by [[Martin Giepmans]], [[CCC]], September 24, 2004
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=18&t=49085 A problem with my delphi engine in Windows XP] by [[Martin Giepmans]], [[Computer Che
5 KB (732 words) - 00:29, 25 December 2019
* [https://www.stmintz.com/ccc/index.php?id=388903 A Delphi - WinBoard problem] by [[Martin Giepmans]], [[CCC]], September 24, 2004 » [[Delphi]], [[WinBo
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=18&t=49085 A problem with my delphi engine in Windows XP] by [[Martin Giepmans]], [[Computer Che
2 KB (212 words) - 09:20, 18 May 2019
...problem. Bye the way in two years Delfi improved more than 150 ELO, so the problem is now real. For this reason the latest version with source code available
3 KB (381 words) - 20:58, 19 May 2019
...with [https://en.wikipedia.org/wiki/Multi-armed_bandit multi-armed bandit] problem, already introducing [[Temporal Difference Learning#TDLamba|TD(0)]] in 1977
...flict between identification and control: a survey of the two-armed bandit problem''. [https://en.wikipedia.org/wiki/Franklin_Institute#The_Journal_of_The_Fra
13 KB (1,915 words) - 10:26, 27 May 2019
...treet-Fighting Mathematics: The Art of Educated Guessing and Opportunistic Problem Solving]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press]</ref> and '
...treet-Fighting Mathematics: The Art of Educated Guessing and Opportunistic Problem Solving]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press] <ref>[http:
9 KB (1,276 words) - 22:06, 3 November 2020
...1467-8640.1993.tb00310.x Hybrid Algorithms for the Constraint Satisfaction Problem]''. [https://en.wikipedia.org/wiki/Computational_Intelligence_(journal) Com
4 KB (597 words) - 17:54, 16 November 2020
...://en.wikipedia.org/wiki/Problem_solving#Computer_Science_and_Algorithmics problem solving], he is co-developer of the [https://en.wikipedia.org/wiki/STRIPS S
...971'''). ''STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving''. [[Conferences#IJCAI|IJCAI 1971]]
6 KB (826 words) - 19:39, 4 October 2019
...kchess.com/forum/viewtopic.php?t=31767 Another Crafty-23.1 Nehalem scaling problem] by [[Louis Zulli]], [[CCC]], January 16, 2010
9 KB (1,265 words) - 16:11, 30 June 2019
....apa.org/record/2008-13026-000 Concept Learning: An Information Processing Problem]''. [https://en.wikipedia.org/wiki/Wiley_(publisher) Wiley]</ref>
...'1968'''). ''[https://dl.acm.org/citation.cfm?id=321487 A Formal Deductive Problem-Solving System]''. [[ACM#Journal|Journal of the ACM]], Vol. 15, No. 4
7 KB (1,026 words) - 17:55, 16 November 2020
a Dutch [[:Category:Chess Composer|chess problem composer]] and [[:Category:Problem|chess solving engine]] and [[GUI]] programmer.
...Sudoku Sudoku] program and the [[Windows]] [[GUI]] [[APwin]] for the chess problem solving programs [[Alybadix]] and [[Popeye]].
2 KB (342 words) - 17:56, 16 November 2020
...face by [[Paul Wiereyn]] which supports the free [[:Category:Problem|chess problem solving engines]] [[Alybadix]] and [[Popeye]].
...p://www.talkchess.com/forum/viewtopic.php?t=57106 For those who like chess problem solving...] by [[Dann Corbit]], [[CCC]], July 28, 2015
1 KB (149 words) - 15:40, 10 July 2019
* [https://www.stmintz.com/ccc/index.php?id=29767 Minority attack: a problem even for new programs?] by [[Dirk Frickenschmidt]], [[CCC]], October 17, 19
4 KB (496 words) - 14:38, 26 September 2019
...ion.cfm?id=123465.123497 Viewing Instruction Set Design as an Optimization Problem]''. [https://dblp.uni-trier.de/db/conf/micro/micro91.html MICRO 1991]
8 KB (1,180 words) - 16:31, 18 July 2019
...[Maurizio Monge]] ('''2010'''). ''The 3-dimensional searchlight scheduling problem''. [https://dblp.uni-trier.de/db/conf/cccg/cccg2010.html CCCG 2010], [https
8 KB (1,121 words) - 10:58, 24 July 2019
...6ee708360f2e3dbd519eb The multiple resource-constrained project scheduling problem: A breadth-first approach]''. [https://en.wikipedia.org/wiki/European_Jour
...rative Search Using Agents for Cardinality Constrained Portfolio Selection Problem]''. [[IEEE#SMC|IEEE Transactions on Systems, Man, and Cybernetics]], Part C
5 KB (716 words) - 17:58, 16 November 2020
...6ee708360f2e3dbd519eb The multiple resource-constrained project scheduling problem: A breadth-first approach]''. [https://en.wikipedia.org/wiki/European_Jour
9 KB (1,136 words) - 17:58, 16 November 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=28823 Crafty problem with cutechess-cli] by [[Gian-Carlo Pascutto]], [[CCC]], July 07, 2009 » [
12 KB (1,556 words) - 22:44, 19 January 2021
...kchess.com/forum/viewtopic.php?t=58730 LittleBlitzer question and possible problem] by [[Jouni Uski]], [[CCC]], December 29, 2015
3 KB (393 words) - 10:15, 10 September 2019
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=2&t=5113 AtlanChess problem/bug finally found?] by [[Günther Simon]], [[Computer Chess Forums|Winboard
3 KB (390 words) - 16:50, 23 July 2019
* [https://www.stmintz.com/ccc/index.php?id=207580 Problem with short PV] by [[Benny Antonsson]], [[CCC]], January 15, 2002
3 KB (368 words) - 12:51, 5 January 2020
...61?lang=en Spacetime Holism - A Fundamental Approach to the Representation Problem in Cognitive Science]''. Ph.D. thesis, [[Vienna University of Technology]],
...-Günter Winkler]] ('''1999'''). ''Space-Time Unity and the Representation Problem''. [https://www.semanticscholar.org/paper/Computing-anticipatory-systems-%3
5 KB (754 words) - 22:09, 3 November 2020
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69024 Java problem] by [[Gabor Szots]], [[CCC]], November 24, 2018 » [[Java]]
4 KB (532 words) - 21:06, 11 February 2021
...s://en.wikipedia.org/wiki/Fred_Reinfeld Reinfeld's] [[Win at Chess]] (WAC) problem set is 274/300,
8 KB (1,195 words) - 17:58, 16 November 2020
...itecture search], automated [https://en.wikipedia.org/wiki/Problem_solving problem solving], [https://en.wikipedia.org/wiki/Stochastic_optimization stochastic
...4'''). ''Stochastic Local Search for Solving the Most Probable Explanation Problem in Bayesian Networks''. Diploma thesis (M.Sc.), [[Darmstadt University of T
11 KB (1,520 words) - 10:09, 5 July 2021
...endall]] ('''2001'''). ''Applying Meta-Heuristic Algorithms to the Nesting Problem Utilising the No Fit Polygon''. Ph.D. thesis, [https://en.wikipedia.org/wik
6 KB (885 words) - 09:35, 12 July 2020
...arrangierte Match gegen den Computer:Schach-Mikro für Boris Spasskij kein Problem], April 24, 1981, [[Computerworld#Woche|Computerwoche]] 17/1981 (German)</r
...arrangierte Match gegen den Computer:Schach-Mikro für Boris Spasskij kein Problem], April 24, 1981, [[Computerworld#Woche|Computerwoche]] 17/1981 (German)
5 KB (733 words) - 16:52, 27 September 2019
...arrangierte Match gegen den Computer:Schach-Mikro für Boris Spasskij kein Problem], April 24, 1981, [[Computerworld#Woche|Computerwoche]] 17/1981 (German)</r
5 KB (764 words) - 17:09, 27 September 2019
...ion.cfm?id=1624689 TULIPS: Teachable, Understanding Natural Language Input Problem-Solver]''. [[Conferences#IJCAI1975|IJCAI 1975]], [https://www.ijcai.org/Pro
5 KB (691 words) - 07:14, 1 October 2019
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]</ref>.
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]
2 KB (264 words) - 11:44, 3 October 2019
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]</ref>.
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]
5 KB (595 words) - 20:09, 3 October 2019
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]</ref>.
...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]
3 KB (490 words) - 20:20, 3 October 2019
...ician#IRNourbakhsh|Illah Nourbakhsh]] ('''1993'''). ''Time-Saving Tips for Problem Solving with Incomplete Information''. [[Conferences#AAAI-93|AAAI 1993]]
6 KB (790 words) - 21:31, 4 October 2019
...wikipedia.org/wiki/Constraint_satisfaction_problem constraint satisfaction problem] and then attempting to maximize the probability that the fill is correct <
10 KB (1,347 words) - 12:08, 26 February 2021
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=18&t=34204#p129309 Re: Problem with Knightx1.71 under Chessbase-GUI] by [[Christophe Jolly]], [[Computer C
4 KB (492 words) - 15:05, 8 October 2019
adressing the average reward problem in sudden death games (such as [https://en.wikipedia.org/wiki/Connection_ga
1 KB (155 words) - 16:42, 15 October 2019
...g programs <ref>[https://www.stmintz.com/ccc/index.php?id=191935 Re: Chess problem solving] by [[Timo Saari]], [[CCC]], October 05, 2001</ref>.
* [https://www.stmintz.com/ccc/index.php?id=191675 Chess problem solving] by [[Timo Saari]], [[CCC]], October 04, 2001
1 KB (214 words) - 19:29, 28 February 2020
...omposer|chess composer]] <ref>[https://pdb.dieschwalbe.de/search.jsp Chess Problem Database Server] - [https://en.wikipedia.org/wiki/Die_Schwalbe Die Schwalbe
3 KB (524 words) - 16:54, 17 October 2019
He is author of one of the world's first [[:Category:Problem|chess problem solving]] programs, [[Mika's Mate]] for the [[Apple II]],
* [https://www.yacpdb.org/#13100 Yet another chess problem database - Problem 13100, Korhonen, Mika, 2nd WCCT, 1980, 5th Place, 1980-1983]
1 KB (181 words) - 19:44, 20 September 2020
...('''1970''').''[https://repository.upenn.edu/cis_reports/824/ Man-Computer Problem Solving in Real-Time Naval Duels]''. [https://en.wikipedia.org/wiki/Univers
4 KB (539 words) - 17:20, 22 October 2019
...oogle.com/d/msg/rec.games.chess.computer/MyFmpXxqccg/Z6WgNuoF-hcJ Smullyan Problem in Sherlock Holmes book] by Christopher Heckman, [[Computer Chess Forums|rg
5 KB (750 words) - 23:57, 4 November 2019
a chess program with focus on [[:Category:Problem|solving]] [[Checkmate|mates]], written by [[Leonid Liberman]] in [[x86]] [[
[[Category:Problem]]
3 KB (395 words) - 18:22, 6 November 2019
...ps://en.wikipedia.org/wiki/Homicidal_chauffeur_problem Homicidal chauffeur problem - Wikipedia]</ref>
5 KB (758 words) - 21:47, 14 November 2019
...onship world champion] in [[Chess Problems, Compositions and Studies|chess problem solving]], chess writer, publisher and director of [https://en.wikipedia.or
* [https://en.chessbase.com/post/the-draw-problem-a-simple-solution The draw problem – a simple solution] by [[John Nunn]], [[ChessBase|ChessBase News]], Octo
17 KB (2,337 words) - 18:08, 3 July 2020
...ess.com/forum/viewtopic.php?t=59407 Stockfish 7 and partial 6 piece syzygy problem?] by [[Jouni Uski]], [[CCC]], March 01, 2016 » [[Stockfish]]
9 KB (1,231 words) - 22:09, 4 August 2020
...the [https://en.wikipedia.org/wiki/Helpmate helpmate] [[:Category:Problem|problem solving program]] [[Brutalis]] <ref>[http://www.jens-musik.dk/brutalis.htm
6 KB (887 words) - 12:01, 22 September 2020
4 KB (515 words) - 22:36, 28 November 2019
...tions, one is led to huge programs that solve only a small part of a chess problem. It seems that an optimistic approach is to look for a conceptionally simpl
7 KB (914 words) - 17:01, 6 December 2019
...://www.talkchess.com/forum3/viewtopic.php?f=7&t=22726 reading in strings - problem with "\n"] by [[Richard Allbert]], [[CCC]], July 31, 2008
6 KB (850 words) - 22:14, 8 November 2021
...rg/wiki/Non-maskable_interrupt non-maskable interrupts] solved the flicker problem of the [https://en.wikipedia.org/wiki/ZX80 ZX80] and gave the ZX81 a "multi
6 KB (892 words) - 12:47, 4 July 2021
...'2014'''). ''One-loop vacuum polarization at mα7 order for the two center problem''. [https://arxiv.org/abs/1411.1894 arXiv:1411.1894]
6 KB (861 words) - 22:11, 3 November 2020
...bolic_computation symbolic] [https://en.wikipedia.org/wiki/Problem_solving problem-solving] systems and [https://en.wikipedia.org/wiki/Natural_language_proces
9 KB (891 words) - 19:04, 25 February 2021
...erformance characteristics of the Alpha-Beta procedure within the specific problem domain of this study.
6 KB (805 words) - 19:04, 25 February 2021
...ps://en.wikipedia.org/wiki/Travelling_salesman_problem Travelling salesman problem from Wikipedia]</ref>
3 KB (470 words) - 13:20, 23 January 2020
...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
5 KB (741 words) - 22:11, 3 November 2020
As a chess composer, he founded the German Chess problem magazine ''Harmonie'' in 1987 and is again its publisher since 2013 <ref>[h
...buted to [[Popeye]], the [[:Category:Open Source|open source]] [[:Category:Problem|program for solving]] orthodox and heterodox chess problems <ref>[https://e
6 KB (767 words) - 17:50, 31 January 2020
* [http://www.open-aurec.com/wbforum/viewtopic.php?f=18&t=32320 Nejmet v2.56 problem] by [[George Lyapko]], [[Computer Chess Forums|Winboard Forum]], August 31,
...rec.com/wbforum/viewtopic.php?f=18&t=44701 Re: Nejmet 3.07 Time Management Problem?] by [[Robert Allgeuer]], [[Computer Chess Forums|Winboard Forum]], October
10 KB (1,419 words) - 20:01, 18 February 2020
...ps://en.wikipedia.org/wiki/Travelling_salesman_problem travelling salesman problem], covering [https://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_algor
5 KB (665 words) - 22:12, 3 November 2020
...pdf] <ref>[https://en.wikipedia.org/wiki/Steiner_tree_problem Steiner tree problem from Wikipedia]</ref>
...a.org/wiki/String-to-string_correction_problem String-to-string correction problem from Wikipedia]</ref>
6 KB (834 words) - 08:39, 16 November 2020
...ing Time Efficiently: Genetic-Evolutionary Algorithms and the Continuation Problem]''. [https://dblp.uni-trier.de/db/conf/gecco/gecco1999.html GECCO 1999]
7 KB (900 words) - 15:08, 29 March 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=30471 Problem with functions not inlining] by [[Gregory Strong]], [[CCC]], November 04, 2
3 KB (395 words) - 11:08, 3 April 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=66804 Problem position using Scorpio Egbbs] by [[Ross Boyd]], [[CCC]], March 11, 2018 »
2 KB (331 words) - 15:28, 15 April 2020
...Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem''. [[Conferences#IJCAI2007|IJCAI 2007]], [https://www.aaai.org/Papers/IJCAI
...17'''). ''Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants''. [https://arxiv.org/abs/1707.00228 arXiv:1707.0022
14 KB (1,819 words) - 12:19, 7 April 2021
...d the [https://en.wikipedia.org/wiki/Assignment_problem general assignment problem] (GAP).
4 KB (592 words) - 09:49, 2 May 2020
...f>[https://en.wikipedia.org/wiki/Hamiltonian_path_problem Hamiltonian path problem from Wikipedia]</ref>
...wikipedia.org/wiki/Constraint_satisfaction_problem Constraint satisfaction problem from Wikipedia]</ref>
8 KB (1,139 words) - 11:49, 2 May 2020
...2-6 <ref>[https://en.wikipedia.org/wiki/Steiner_tree_problem Steiner tree problem from Wikipedia]</ref> <ref>[https://en.wikipedia.org/wiki/Euclidean_space E
....org/WarrenSmithPages/homepage/church.sue Church's thesis meets the N-body problem]''. [https://www.journals.elsevier.com/applied-mathematics-and-computation
18 KB (2,460 words) - 22:23, 14 June 2021
...wikipedia.org/wiki/Constraint_satisfaction_problem Constraint satisfaction problem (CSP) from Wikipedia]</ref>
8 KB (1,020 words) - 12:26, 15 May 2020
...://www.talkchess.com/forum/viewtopic.php?t=34051 Ponder console input move problem] by [[Vlad Stamate]], [[CCC]], April 28, 2010 » [[Pondering]]
6 KB (835 words) - 10:38, 28 May 2020
* The problem of research is that someone, somewhere, has already done what you are propo
5 KB (634 words) - 11:49, 21 June 2020
...ve to move the horizon a little father down the road. The solution to this problem is also beyond the scope of this project.
5 KB (813 words) - 11:35, 21 June 2020
...sus_Machine_Problem-Solving_Winning_Openings_in_Dakon Human versus Machine Problem Solving: Winning Openings in Dakon''. Journal of Board Game Studies, Vol. 3
10 KB (1,419 words) - 21:44, 26 June 2020
...-of-War algorithms for exploration-exploitation dilemma in extended Bandit Problem]''. [http://www.journals.elsevier.com/biosystems/ Biosystems] 117, 1-9, [ht
8 KB (1,061 words) - 19:56, 3 July 2020
* [[Göran Grottling]] ('''1985'''). ''Problem-Solving Ability Tested''. [[ICGA Journal#8_2|ICCA Journal, Vol. 8, No. 2]]
5 KB (711 words) - 14:35, 18 July 2020
...). ''[https://ieeexplore.ieee.org/document/5392646 Intelligent Behavior in Problem-Solving Machines]''. [https://dblp.org/db/journals/ibmrd/ibmrd2.html IBM Jo
...). ''[https://ieeexplore.ieee.org/document/5392646 Intelligent Behavior in Problem-Solving Machines]''. [https://dblp.org/db/journals/ibmrd/ibmrd2.html IBM Jo
8 KB (1,094 words) - 23:17, 23 July 2020
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=74666 SF NNUE Problem] by [[Stephen Ham]], [[CCC]], August 03, 2020
32 KB (4,435 words) - 00:03, 21 December 2022
...yaka Yaji], [[Shalabh Bhatnagar]] ('''2015'''). ''A bi-convex optimization problem to compute Nash equilibrium in n-player games and an algorithm''. [https://
7 KB (888 words) - 13:55, 12 April 2021
Crystal focuses on better [[Chess Problems, Compositions and Studies|problem solving]] abilities, and includes [[Fortress|fortress]] detection code.
4 KB (466 words) - 23:29, 25 December 2021
...e which contains a collection of information relating to chess, computers, problem solving, [[Artificial Intelligence|artificial intelligence]] and other subj
4 KB (524 words) - 16:15, 28 September 2020
the general Nonogram problem is [https://en.wikipedia.org/wiki/NP-hard NP-hard].
7 KB (989 words) - 22:19, 5 October 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=65718 Java problem!] by [[Günther Simon]], [[CCC]], November 13, 2017 » [[Java]]
4 KB (581 words) - 19:24, 1 November 2020
...tps://en.wikipedia.org/wiki/Excelsior_%28chess_problem%29 Excelsior (chess problem) from Wikipedia]
...3 <ref>[https://www.stmintz.com/ccc/index.php?id=144445 Original Excelsior problem] by [[Frederic Friedel]], [[CCC]], December 11, 2000</ref>
4 KB (603 words) - 21:48, 12 November 2020
'''Chest''', (CHEST, CHEss problem analyST)<br/>
a [[:Category:Problem|program for solving]] orthodox [[Chess Problems, Compositions and Studies|c
8 KB (1,102 words) - 20:06, 14 November 2020
...the topic of [[Parallel Search|parallel heuristics search]] applied to the problem of chess.
3 KB (411 words) - 00:02, 30 January 2021
...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|
7 KB (860 words) - 15:41, 4 December 2020
...dl.acm.org/doi/10.1145/225058.225075 Approximations for the disjoint paths problem in high-diameter planar networks]''. [https://dblp.org/db/conf/stoc/stoc199
...10.1007/BF01585867 An improved approximation ratio for the minimum latency problem]''. [https://en.wikipedia.org/wiki/Mathematical_Programming Mathematical Pr
12 KB (1,557 words) - 00:07, 8 December 2020
* [http://www.talkchess.com/forum/viewtopic.php?t=46151 Problem with Win7 and turning HT off] by [[Dragan Zdravkovic]], [[CCC]], November 2
3 KB (369 words) - 21:39, 21 December 2020
...iling: a heuristic search for the Pattern self-Assembly Tile-set Synthesis problem). Bachelor's thesis, [https://en.wikipedia.org/wiki/Aalto_University Aalto
5 KB (671 words) - 20:56, 25 December 2020
* [[Dominik Klein]] ('''2019'''). ''The Stroke Correspondence Problem, Revisited''. [https://arxiv.org/abs/1909.11995 arXiv:1909.11995]
5 KB (668 words) - 18:55, 11 November 2021
...Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows''. [https://dblp.org/db/conf/evoW/evoappl2011-2.html#Rimm
7 KB (916 words) - 12:31, 14 March 2022
* [http://www.talkchess.com/forum/viewtopic.php?t=28807 Problem with pipe inheritance... ] by [[Stephan Vermeire]], [[CCC]], July 06, 2009
1 KB (187 words) - 10:47, 24 October 2022
...m/g/rec.games.chess.computer/c/zIUg9A3GkZg/m/D7OvJBESxiMJ crafty copyright problem] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], February 17, 1999
3 KB (478 words) - 13:20, 30 January 2021
...c.games.chess.computer/browse_frm/thread/cc8520f40dc69198 crafty copyright problem] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], February 17, 1999</re
...y before you did... software engineering wants to avoid that 'reinvention' problem...
5 KB (744 words) - 13:26, 30 January 2021
...m/g/rec.games.chess.computer/c/zIUg9A3GkZg/m/D7OvJBESxiMJ crafty copyright problem] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], February 17, 1999</re
2 KB (284 words) - 18:37, 30 January 2021
...m/g/rec.games.chess.computer/c/zIUg9A3GkZg/m/D7OvJBESxiMJ crafty copyright problem] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], February 17, 1999</re
2 KB (349 words) - 18:38, 30 January 2021
...i/NP-complete NP-complete] [https://en.wikipedia.org/wiki/Decision_problem problem] arising in [https://en.wikipedia.org/wiki/Optical_character_recognition op
5 KB (605 words) - 11:42, 21 March 2021
...l form (CNF)] [https://en.wikipedia.org/wiki/Satisfiability satisfiability problem], [[Backtracking|backtracking]], [[Search|game tree search]] along with pro
...//dblp.uni-trier.de/db/conf/dimacs/dimacs35.html#PurdomH96 Satisfiability Problem: Theory and Applications 1996], [https://www.academia.edu/22023319/Backtrac
6 KB (833 words) - 22:28, 4 April 2021
<ref>[[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [h
In his thesis <ref>[[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [h
4 KB (549 words) - 14:02, 7 April 2021
...nternational masters in [https://en.wikipedia.org/wiki/Chess_problem chess-problem composition]. The result is applied on 100 known problems. It shows that th
4 KB (607 words) - 14:21, 7 April 2021
a Finnish [[:Category:Chess Composer|chess problem composer]] and author of the commercial chess solving programs [[Alybadix]]
1 KB (168 words) - 11:49, 11 April 2021
Václav Kotěšovec is author of the [[:Category:Problem|solving and composing software]] [[VKsach]] <ref>[http://www.kotesovec.cz/n
4 KB (519 words) - 12:57, 11 April 2021
...'1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html N
...'1998'''). ''Gambling in a rigged casino: The adversarial multi-arm bandit problem''. [http://www.bio.net/bioarchives/neuroscience/1998-November/034748.html N
12 KB (1,544 words) - 16:55, 11 April 2021
...massive black holes], [https://en.wikipedia.org/wiki/N-body_problem n-body problem],
...rt]] ('''2019'''). ''Newton vs the machine: solving the chaotic three-body problem using deep neural networks''. [https://arxiv.org/abs/1910.07291 arXiv:1910.
9 KB (1,236 words) - 23:31, 28 May 2021
.../www.talkchess.com/forum3/viewtopic.php?f=2&t=42099&start=9 Re: Philou 3.7 problem ...] by [[Philippe Gailhac]], [[CCC]], January 31, 2012
1 KB (182 words) - 11:48, 15 June 2021
* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=42099 Philou 3.7 problem ...] by Aser Huerga, [[CCC]], January 21, 2012
.../www.talkchess.com/forum3/viewtopic.php?f=2&t=42099&start=9 Re: Philou 3.7 problem ...] by [[Philippe Gailhac]], [[CCC]], January 31, 2012
4 KB (656 words) - 13:02, 15 June 2021
...ional creativity], the [https://en.wikipedia.org/wiki/Problem_of_induction problem of induction],
...''[https://link.springer.com/chapter/10.1007/3-540-61291-2_65 Parity: The Problem that Won't Go Away]''. [https://dblp.org/db/conf/ai/ai96.html#Thornton96 AI
8 KB (1,148 words) - 10:09, 5 July 2021
* [[Zvi Retchkiman Königsberg]] ('''1999'''). ''The load balancing problem''. [https://dblp.org/db/journals/npsc/npsc7.html#Konigsberg99 Neural, Paral
...tability-probl A mixed Lyapunov-Max-plus algebra approach to the Stability problem for discrete event dynamical systems modeled with timed Petri nets]''. [htt
6 KB (757 words) - 10:41, 9 July 2021
...Velani]] ('''2013'''). ''Badly approximable points on planar curves and a problem of Davenport''. [https://arxiv.org/abs/1301.4243 arXiv:1301.4243] » [[Math
5 KB (592 words) - 15:01, 1 August 2021
...'''). ''Improving Human Players’ T-Spin Skills in Tetris with Procedural Problem Generation''. [[Advances in Computer Games 16]]
4 KB (480 words) - 16:47, 1 December 2021
