Search results

* [[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [h

* [[:Category:Problem]]

* [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]],

...]] ('''1977'''). ''King and Rook Against King: Historical Background and a Problem on the Infinite Board''. [[Advances in Computer Chess 1]]

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

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]]

* [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

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

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

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

...'[https://backscattering.de/chess/hashtable-packing/ The Hashtable Packing Problem]''. (Draft)

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

* [https://www.stmintz.com/ccc/index.php?id=191460 Re: A math problem for the experts...] by Teerapong Tovirat, [[CCC]], October 02, 2001

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

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

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

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

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

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

...ttps://en.wikipedia.org/wiki/Houston,_we_have_a_problem Houston, we have a problem from Wikipedia]</ref>

...). ''[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

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

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

* [http://chesspuzzles.com/mate-in-two Mate in Two Problem | Chess Puzzles!]

...two moves away from [[Checkmate|checkmate]], known as the [[Mate-in-two]] problem.

Turing addressed the problem of [[Artificial Intelligence|artificial intelligence]], and proposed an exp

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

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

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

...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''. [[Advances in Computer Chess 7]]

* [https://groups.google.com/d/msg/fishcooking/0uRw0Zila0M/s2siUjVzFFwJ Problem with CLOP and clop-cutechess-cli.py? (long post)] by joster, [[Computer Che

...N [[Iteration|iterations]] regardless of the dimension of the optimization problem - opposed to FDSA, which needs p + 1 objective function measurements or sim

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

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

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

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

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

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

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

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

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

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

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

* [http://www.talkchess.com/forum/viewtopic.php?t=65589 Aspiration window problem] by [[Sander Maassen vd Brink]], [[CCC]], October 30, 2017

* [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]

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

* [http://www.talkchess.com/forum/viewtopic.php?t=31505 Problem with exploding tree because of extensions] by [[Oliver Brausch]], [[CCC]],

...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003

...]], 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.

We overcome this problem in the SEX algorithm by using two separate values of SEX, one for each side

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

To somewhat alleviate this problem so-called speculative-pruning methods are used to cut off less interesting

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

* [http://www.talkchess.com/forum/viewtopic.php?t=31494 The problem with LMR in suprtactical positions] by [[Oliver Brausch]], [[CCC]], January

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

* [http://www.talkchess.com/forum/viewtopic.php?t=64912 What is causing this problem?] by [[Michael Sherwin]], [[CCC]], August 16, 2017 » [[RomiChess]]

* [http://www.talkchess.com/forum/viewtopic.php?t=20646 SEE problem] by [[Tord Romstad]], [[CCC]], April 13, 2008

* [https://www.talkchess.com/forum3/viewtopic.php?f=7&t=76255 Problem with counter move heuristic] by John Garrison, [[CCC]], January 08, 2021

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

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

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

...whether it satisfies the [https://en.wikipedia.org/wiki/Problem_statement problem statement]. Brute-force algorithms are conceptually simple, but usually suf

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

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

...f Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp

...('''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

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

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

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

* [http://www.talkchess.com/forum/viewtopic.php?t=31505 Problem with exploding tree because of extensions] by [[Oliver Brausch]], [[CCC]],

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

* [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,

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

* [[Fridel Fainshtein]] ('''2006'''). ''An Orthodox k-Move Problem-Composer for Chess Directmates''. M.Sc. thesis, [[Bar-Ilan University]], [

* [[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]]

* [[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

...talkchess.com/forum/viewtopic.php?t=60193 Surprisingly difficult stalemate problem (for some engines)] by Juha Nieminen, [[CCC]], May 16, 2016

* [http://www.talkchess.com/forum3/viewtopic.php?f=7&t=41542 Problem with bitboard knight attack generator] by [[Matthew R. Brades|ZirconiumX]],

...://en.wikipedia.org/wiki/Wheat_and_chessboard_problem Wheat and chessboard problem]

...treet-Fighting Mathematics: The Art of Educated Guessing and Opportunistic Problem Solving]''. [https://en.wikipedia.org/wiki/MIT_Press MIT Press]

...g-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]]

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

* 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

* [http://www.jimloy.com/chess/mirror1.htm A "Mirror" Chess Problem] from [http://www.jimloy.com/chess/chess.htm Jim Loy's Chess Pages]

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:

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

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

...olution to a problem depends on solutions to smaller instances of the same problem.

...). ''[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

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

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

...erception and Memory versus Thought: Some Old Ideas and Recent Findings''. Problem Solving: Research, Method, and Theory (ed. B. Kleinmuntz), pp. 19-50. John

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

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

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

...w.talkchess.com/forum/viewtopic.php?t=52661 UCI, ownbooks, and a potential problem] by [[Miguel A. Ballicora]], [[CCC]], June 16, 2014 » [[UCI]]

...g-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]] » [[CC Sapiens]]

...гард]</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]

...d Gobet]] ('''1997'''). ''A Pattern-Recognition Theory of Search in Expert Problem Solving.'' Thinking and Reasoning, Vol. 3, No. 4</ref>.

* [[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

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

* [[: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

* [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

* [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

* [http://www.talkchess.com/forum/viewtopic.php?t=52836 En passant problem in gaviota tablebases] by [[Peter Österlund]], [[CCC]], July 02, 2014 » [

...tion to make and undo moves twice for all moves. Below code can avoid that problem and run much faster:

* [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

...] (8 [https://en.wikipedia.org/wiki/Gibibyte gibibytes]).DTS overcomes one problem of [[Parallel Search#PrincipalVariationSplitting|principle variation splitt

...?id=318833 The "same threat extension" as effective way to resolve horizon problem] by [[Sergei Markoff]], [[CCC]], October 01, 2003 » [[Botvinnik-Markoff Ex

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

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

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

* [[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''.

* [[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]],

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

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

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

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

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

...''A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem''. in

...Knowledge from Grandmaster Games. Part 1: Grandmasters have Insights - the Problem is what to Incorporate into Practical Problems.'' [[ICGA Journal#10_1|ICCA

...cribed by [[Paul Wiereyn]] <ref>[[Paul Wiereyn]] ('''1985'''). ''Inventive Problem Solving''. [[ICGA Journal#8_4|ICCA Journal, Vol. 8, No. 4]]</ref> and, acco

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

* [https://www.stmintz.com/ccc/index.php?id=29767 Minority attack: a problem even for new programs?] by [[Dirk Frickenschmidt]], [[CCC]], October 17, 19

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

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

...]] ('''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]]

* [https://www.stmintz.com/ccc/index.php?id=305906 Problem with TT] by [[Grzegorz Sidorowicz]], [[CCC]], July 11, 2003

* 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]]

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

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

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

'''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

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

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

...://www.talkchess.com/forum/viewtopic.php?t=34051 Ponder console input move problem] by [[Vlad Stamate]], [[CCC]], April 28, 2010 » [[Pondering]]

* [http://talkchess.com/forum3/viewtopic.php?t=46586 Problem with UCI engines hash in Arena] by carldaman, [[CCC]], December 27, 2012

* [http://www.talkchess.com/forum/viewtopic.php?t=61823 ChessGUI Timer Problem] by [[Dennis Sceviour]], [[CCC]], October 24, 2016 » [[ChessGUI]]

* [http://www.talkchess.com/forum/viewtopic.php?t=36722 Problem using XBoard + Polyglot + Zippy on FICS] by [[Ben-Hur Carlos Vieira Langoni

unlike [[First Rank Attacks|rank attacks]], the problem arises for [[Files|files]] and [[Diagonals|diagonals]] how to get scattered

* [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]],

...'[https://backscattering.de/chess/hashtable-packing/ The Hashtable Packing Problem]''. (Draft)

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

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

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

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

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

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

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

* [[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>

...://www.talkchess.com/forum/viewtopic.php?t=34051 Ponder console input move problem] by [[Vlad Stamate]], [[CCC]], April 28, 2010 » [[Command Line Interface]]

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

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

# [[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

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

# [[László Lindner]], [[Michael Schlosser]] ('''1991'''). ''New Ideas in Problem Solving and Composing Programs''.

...Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''Solving Shannon's Problem: Ways and Means''.

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

...ink.springer.com/chapter/10.1007/11922155_13 The Graph-History Interaction Problem in Chinese Chess]''. [[Advances in Computer Games 11]]

....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/3-540-45579-5_14 Creating Difficult Instances of the Post Correspondence Problem]''. [[CG 2000]]

...://link.springer.com/chapter/10.1007/3-540-48957-6_3 A Solution to the GHI Problem for Best-First Search]''. [[CG 1998]]

# [[David Levy]] ('''1989'''). ''The Million Pound Bridge Problem''. [[1st Computer Olympiad#Workshop|Heuristic Programming in AI 1]]

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

...in Hsu]], [[Tsan-sheng Hsu]] ('''2006'''). ''The Graph-History Interaction Problem in Chinese Chess.'' [[Advances in Computer Games 11]]

* [http://www.talkchess.com/forum/viewtopic.php?t=42984 Xboard crazyhouse problem] by [[Steven Atkinson]], [[CCC]], March 23, 2012

* [https://www.game-ai-forum.org/icga-tournaments/program.php?id=164 8 Queens Problem] by [[Johan de Koning]]

...G'02 Special Announcements], [[Elwyn Berlekamp|Elwyn Berlekamp's]] Clobber problem composition contest, [[CG 2002]]

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

...ematician#CBerge|Claude Berge]] ('''1981'''). ''Some remarks about the Hex problem''. in [http://www.plambeck.org/oldhtml/mathematics/klarner/ David A. Klarne

...sus_Machine_Problem-Solving_Winning_Openings_in_Dakon Human versus Machine Problem Solving: Winning Openings in Dakon]''. [https://en.wikipedia.org/wiki/Inter

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

...[[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2002'''). ''Pattern Selection Problem for Automatically Generating Evaluation Functions For General Game Player''

* [[Backtracking#8QinBitboards|Eight Queens Problem]]

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

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

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

* [[Nicolaas de Bruijn]] ('''1946'''). ''A Combinatorial Problem''. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764.

* [[Nicolaas de Bruijn]] ('''1946'''). ''A Combinatorial Problem''. Koninklijke Nederlandse Akademie v. Wetenschappen 49: 758–764.

* [http://www.talkchess.com/forum/viewtopic.php?t=21348 Problem suite testing - how to extract a useful number] by [[Don Dailey]], [[CCC]],

* [[Tony Marsland]] ('''1967'''). ''Adaptive Computer Programs: An Aid in Problem Analysis''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Wash

: [https://en.wikipedia.org/wiki/Counting_problem_%28complexity%29 Counting problem (complexity) from Wikipedia]

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

* [[Steven M. Bellovin]] ('''1996'''). ''Problem areas for the IP security protocols''. In Proceedings of the Sixth Usenix U

* [[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

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

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

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

* [[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

...al reasoning steps regarding single rows and columns, the general Nonogram problem is [https://en.wikipedia.org/wiki/NP-hard NP-hard].

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

...ink.springer.com/chapter/10.1007/11922155_13 The Graph-History Interaction Problem in Chinese Chess]''. [[Advances in Computer Games 11]]

...9/11606?locale=en Shape-Keeping Technique and Its Application to Checkmate Problem Composition]''. [http://tr.aiide.org/ 2013 AIIDE Workshop]

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

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

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

...7/3-540-45579-5_14 Creating Difficult Instances of the Post Correspondence Problem]''. [[CG 2000]]

* [https://www.stmintz.com/ccc/index.php?id=407134 Subject: Problem (small bug?) with Nalimov TBs] by [[Dieter Bürßner]], [[CCC]], January 23

Problem is, no one else has stepped forward. I was there when Barend Swets (Believ

...yer, member of the German [[Chess Problems, Compositions and Studies|chess problem]] association [https://en.wikipedia.org/wiki/Die_Schwalbe Die Schwalbe] <re

...ing chess.'' Symposium on theory and computing methods in the upper mantle problem, [https://stacks.stanford.edu/file/tn736hy2288/tn736hy2288.pdf pdf]

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

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

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

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

* [[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

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

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

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

...Bruno Bouzy]] ('''2015'''). ''An Experimental Investigation on the Pancake Problem''. [[Conferences#IJCAI2015|IJCAI Computer Games Workshop]], [http://www.mi.

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

...arrangierte Match gegen den Computer:Schach-Mikro für Boris Spasskij kein Problem], April 24, 1981, [[#Woche|Computerwoche]] 17/1981 » [[Rook (Program)|Rook

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

* [http://www.talkchess.com/forum/viewtopic.php?t=46586 Problem with UCI engines hash in Arena] by Carl Langan, [[CCC]], December 26, 2012

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

: ''Computer Problem Solving''. pp. 86

* [[Tihamér Nemes]] ('''1950 apr'''). ''An electronic problem solver''. The Fairy Chess Review, p. 101.

...d [[Ken Thompson]], already working on a chess hardware for [[Belle]], the problem with CHEOPS was the lack of positional [[Evaluation|evaluation]] support <r

| [[NSS|Chess Playing Programs and the Problem of Complexity]]<br/>(excerpt)

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

[[Category:Problem]]

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

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

* [http://www.talkchess.com/forum/viewtopic.php?t=28823 Crafty problem with cutechess-cli] by [[Gian-Carlo Pascutto]], [[CCC]], July 07, 2009 » [

...('''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

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

...] ('''2007'''). ''[http://dl.acm.org/citation.cfm?id=1770082 Study on loop problem in opening database for chinese chess programs]''. [http://www.informatik.u

...'''). ''Improving Human Players’ T-Spin Skills in Tetris with Procedural Problem Generation''. [[Advances in Computer Games 16]]

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

..., [[I-Chen Wu]], [[Der-Johng Sun]] ('''2012'''). ''Solving the Slitherlink Problem''. [http://idb.csie.ncku.edu.tw/taai2012conference/ TAAI 2012], [https://en

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

...o maximize a numeric reward over time. While a general formulation of this problem in terms of

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

...('''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

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

...ttp://hiarcs.net/forums/viewtopic.php?t=7026& Mephisto Vancouver Exclusive Problem] by BlackSails911, [[Computer Chess Forums|Hiarcs Forum]], January 27, 2015

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

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

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

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

* [[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]]

...han Schaeffer]] ('''2000'''). ''Sokoban: A Challenging Single-Agent Search Problem.'' Games in AI Research (eds. [[Jaap van den Herik]] and [[Hiroyuki Iida]])

...tps://en.wikipedia.org/wiki/Travelling_salesman_problem Traveling Salesman Problem]'' under the supervision of [[Monroe Newborn]] <ref>[http://www.cs.mcgill.c

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

...uy]] <ref>[https://en.wikipedia.org/wiki/Zarankiewicz_problem Zarankiewicz problem from Wikipedia]</ref>

...3Pasta%E2%80%93Ulam%E2%80%93Tsingou_problem Fermi–Pasta–Ulam–Tsingou problem from Wikipedia]

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

...3Pasta%E2%80%93Ulam%E2%80%93Tsingou_problem Fermi–Pasta–Ulam–Tsingou problem from Wikipedia]

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

* [http://www.talkchess.com/forum/viewtopic.php?t=66804 Problem position using Scorpio Egbbs] by [[Ross Boyd]], [[CCC]], March 11, 2018

* [http://www.talkchess.com/forum/viewtopic.php?t=41744 NebiyuReversi problem] by [[Harm Geert Muller]], [[CCC]], January 02, 2012

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

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

...a.org/wiki/Cognitive_architecture cognitive architecture] for learning and problem solving inspired by [[Herbert Simon|Herbert A. Simon's]] ideas of [https://

...g/doi/abs/10.1162/089976600300014700#.VfGbP5dpluM Evolution of Cooperative Problem Solving in an Artificial Economy]''. [https://en.wikipedia.org/wiki/Neural_

* [https://www.stmintz.com/ccc/index.php?id=72221 Problem with draws by rep and hash table] by [[James Robertson]], [[CCC]], October

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

* [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

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

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

...m/forum/viewtopic.php?t=66143 Need help to solve TLCV broadcast connection problem] by [[Sven Schüle]], [[CCC]], December 26, 2017

* [http://www.talkchess.com/forum/viewtopic.php?t=61823 ChessGUI Timer Problem] by [[Dennis Sceviour]], [[CCC]], October 24, 2016 » [[Chess Engine Commun

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

...search.pdb?expression=A=%27Seret%27%20and%20FIRSTNAME=%27Jean_Luc%27 Chess Problem Database Serve]</ref>, strong [[Bridge]] and [[Backgammon]] player, and res

* [http://www.talkchess.com/forum/viewtopic.php?t=20646 SEE problem] by [[Tord Romstad]], [[CCC]], April 13, 2008 » [[Static Exchange Evaluati

...'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).

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

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

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

* [http://www.talkchess.com/forum/viewtopic.php?t=64912 What is causing this problem?] by [[Michael Sherwin]], [[CCC]], August 16, 2017 » [[Move Ordering]]

* [http://www.talkchess.com/forum/viewtopic.php?t=31220 Stupid Extension Problem/Question] by [[John Merlino]], [[CCC]], December 23, 2009 » [[Extensions]]

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

...[[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2002'''). ''Pattern Selection Problem for Automatically Generating Evaluation Functions For General Game Player''

...[[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2002'''). ''Pattern Selection Problem for Automatically Generating Evaluation Functions For General Game Player''

...[[Kazunori Yamaguchi]], [[Satoru Kawai]] ('''2002'''). ''Pattern Selection Problem for Automatically Generating Evaluation Functions For General Game Player''

* [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,

* [http://www.talkchess.com/forum/viewtopic.php?t=30471 Problem with functions not inlining] by [[Gregory Strong]], [[CCC]], November 04, 2

Multiple accumulators can help avoid this problem, as well as finding other ways to hide the latency.

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

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

...curately, their conceptual approach of “experience-recognition”-driven problem solving points to the need to incorporate analogical reasoning mechanisms i

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

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

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

...i/Data_mining data mining], [https://en.wikipedia.org/wiki/Problem_solving problem solving], [https://en.wikipedia.org/wiki/Experimental_music experimental mu

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

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

...(Dynamic Neural Nets and the Fundamental Spatio-Temporal Credit Assignment Problem). Ph.D. thesis

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

* [http://www.talkchess.com/forum/viewtopic.php?t=51134 problem with syzygy tablebases] by [[Youri Matiounine]], [[CCC]], February 01, 2014

* [https://www.stmintz.com/ccc/index.php?id=312449 Winboard problem (maybe Delphi only )] by [[Tony van Roon-Werten|Tony Werten]], [[CCC]], Aug

...ddies: A Deep Neural Network-Based Estimation Metric for the Jigsaw Puzzle Problem''. [http://icann2016.org/ ICAAN 2016], [https://en.wikipedia.org/wiki/Lectu

...ddies: A Deep Neural Network-Based Estimation Metric for the Jigsaw Puzzle Problem''. [http://icann2016.org/ ICAAN 2016], [https://en.wikipedia.org/wiki/Lectu

* [[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''.

...Vučković]] ('''2001'''). ''Decision Trees and Search Strategies in Chess Problem Solving Applications'', Proceedings of a Workshop on Computational Intellig

...alkchess.com/forum/viewtopic.php?t=61346 Cfish solves the dreaded URI hard problem] by [[Dann Corbit]], [[CCC]], September 05, 2016

* FIX: nodes per second calculation overflow problem fixed

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

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

* [https://www.stmintz.com/ccc/index.php?id=319788 Problem ending for Yace] by [[Jouni Uski]], [[CCC]], October 06, 2003

* [https://www.stmintz.com/ccc/index.php?id=407134 Subject: Problem (small bug?) with Nalimov TBs] by [[Dieter Bürßner]], [[CCC]], January 23

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

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

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

* [[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]

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

=Problem Statement= Now we are ready to formulate the problem of optimizing the evaluation function in terms of [https://en.wikipedia.org

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

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

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

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

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

* [http://www.talkchess.com/forum/viewtopic.php?t=61823 ChessGUI Timer Problem] by [[Dennis Sceviour]], [[CCC]], October 24, 2016 » [[ChessGUI]]

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

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

* [[Marvin Minsky]] ('''1954'''). ''Neural Nets and the Brain Model Problem''. Ph.D. dissertation, [https://en.wikipedia.org/wiki/Princeton_University

* [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

* [http://www.talkchess.com/forum/viewtopic.php?t=35206 Compiler Problem] by [[Fritz Reul]], [[CCC]], June 29, 2010

* [[Ryan Rifkin]] ('''1998'''). ''The Static Stochastic Ground-Holding Problem''. Master's thesis, [[Massachusetts Institute of Technology|MIT]]

...ye]] ('''2004'''). ''Information Flow and Computation in the Maxwell Demon Problem''. Complexica Report 031128, [https://arxiv.org/abs/physics/0401002 arXiv:p

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

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

...l]] ('''1984'''). ''Heuristics: Intelligent Search Strategies for Computer Problem Solving''. [https://en.wikipedia.org/wiki/Addison-Wesley Addison-Wesley]

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

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

...your project from [[RobboLito|Robbolito]] codebase... Personally I see no problem with that (other than you not telling the truth).

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

...essvibes.com/?q=columns/lewis-carrolls-chess-problem Lewis Carroll's chess problem | ChessVibes], July 14, 2008</ref>

...f Shaw]], [[Herbert Simon]] ('''1958'''). ''Chess Playing Programs and the Problem of Complexity''. IBM Journal of Research and Development, Vol. 4, No. 2, pp

* [http://www.talkchess.com/forum/viewtopic.php?t=36722 Problem using XBoard + Polyglot + Zippy on FICS] by [[Ben-Hur Carlos Vieira Langoni

: [https://en.wikipedia.org/wiki/Optimization_problem Optimization problem from Wikipedia]

...VoPGSRksC A parallel memetic algorithm on GPU to solve the task scheduling problem in heterogeneous environments]''. [http://www.sigevo.org/gecco-2013/program

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

* [[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

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

The first problem is how to enumerate features. In general, anything that affects the overall

...Fruit/Rybka relationship, but this is not so. Strelka did not look like a problem because I assumed it was free.

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

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

* [https://www.stmintz.com/ccc/index.php?id=303131 Problem with extending to maxdepth] by [[Albert Bertilsson]], [[CCC]], June 26, 200

* [https://www.stmintz.com/ccc/index.php?id=303131 Problem with extending to maxdepth] by [[Albert Bertilsson]], [[CCC]], June 26, 200

...tps://en.wikipedia.org/wiki/Memory_bandwidth memory-bandwidth] is the real problem. Since Gromit's [[Evaluation|evaluation]] and [[Search|search heuristics]]

* [http://www.talkchess.com/forum/viewtopic.php?t=22015 64-bit PGO problem?] by [[Martin Bryant]], [[CCC]], June 27, 2008

...pan>[https://www.youtube.com/watch?v=PNKj529yY5c Reasoning: Goal Trees and Problem Solving]

...tps://www.stmintz.com/ccc/index.php?id=282362 endgame position - null move problem] by [[Jon Dart]], [[CCC]], February 06, 2003

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

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

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

...e Vol. 32 No. 3] <ref>[https://en.wikipedia.org/wiki/Clique_problem Clique problem from Wikipedia]</ref>

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

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

...i/S0305054810001504 An exact bit-parallel algorithm for the maximum clique problem]''. [https://dblp.uni-trier.de/db/journals/cor/cor38.html Computers & Opera

...roach is empirically evaluated on the standard Inductive Logic Programming problem of learning classification rules for the [[KRK]] chess endgame.

* [[Simona Tancig]] ('''2009'''). ''Expert Team Decision Making and Problem Solving: Development and Learning''. in Interdisciplinary Description of Co

* [http://www.talkchess.com/forum/viewtopic.php?t=64912 What is causing this problem?] by [[Michael Sherwin]], [[CCC]], August 16, 2017 » [[Move Ordering]]

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

...VoPGSRksC A parallel memetic algorithm on GPU to solve the task scheduling problem in heterogeneous environments]''. [http://www.sigevo.org/gecco-2013/program

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

...a]], [[Yoshiyuki Kotani]] ('''2006'''). ''A New Method of Dealing with GHI Problem for Proving Draw and Application to 3x4 Boards of Shogi''. IPSJ Transaction

...a]], [[Yoshiyuki Kotani]] ('''2006'''). ''A New Method of Dealing with GHI Problem for Proving Draw and Application to 3x4 Boards of Shogi''. IPSJ Transaction

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

...'''). ''Improving Human Players’ T-Spin Skills in Tetris with Procedural Problem Generation''. [[Advances in Computer Games 16]]

* [[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

..._Problem_Reduction_Representation_for_the_Linguistic_Analysis_of_Waveforms Problem Reduction Representation for the Linguistic Analysis of Waveforms]''. [[IEE

...://link.springer.com/book/10.1007/b107306 Metaheuristics: Progress as Real Problem Solvers]''. [https://link.springer.com/bookseries/6375 Operations Research

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

...). ''[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

* [[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

...e d'Orsay], [http://da.wikipedia.org/wiki/Psykofysisk_problem Psykofysisk problem from Wikipedia.da] (Danish), [http://commons.wikimedia.org/wiki/Category:Le

* [https://www.stmintz.com/ccc/index.php?id=305906 Problem with TT] by [[Grzegorz Sidorowicz]], [[CCC]], July 11, 2003 » [[Transposit

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

* [http://www.open-aurec.com/wbforum/viewtopic.php?f=2&t=5317 Problem with new Gosu] Postby Tony Thomas, [[Computer Chess Forums|Winboard Forum]]

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

...). ''[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

.../1970-01781-001 Information-processing analysis of perceptual processes in problem solving]''. [https://en.wikipedia.org/wiki/Psychological_Review Psychologic

* [[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

=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

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

* [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,

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

* [[Alan H. Bond]] ('''2002'''). ''Problem-solving behavior in a system model of the primate neocortex''. [https://www

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

* [http://www.talkchess.com/forum/viewtopic.php?t=34365 A hashing problem] by [[Rasjid Chan]], [[CCC]], May 18, 2010

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.

...is author of the Orthodox [[Chess Problems, Compositions and Studies|Chess Problem]] solving program [[Gustav]], initially developed from 1990 until 1993 unde

* [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

* [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

* [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

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

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

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

...1467-8640.1993.tb00310.x Hybrid Algorithms for the Constraint Satisfaction Problem]''. [https://en.wikipedia.org/wiki/Computational_Intelligence_(journal) Com

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

...kchess.com/forum/viewtopic.php?t=31767 Another Crafty-23.1 Nehalem scaling problem] by [[Louis Zulli]], [[CCC]], January 16, 2010

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

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

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

* [https://www.stmintz.com/ccc/index.php?id=29767 Minority attack: a problem even for new programs?] by [[Dirk Frickenschmidt]], [[CCC]], October 17, 19

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

...[Maurizio Monge]] ('''2010'''). ''The 3-dimensional searchlight scheduling problem''. [https://dblp.uni-trier.de/db/conf/cccg/cccg2010.html CCCG 2010], [https

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

...6ee708360f2e3dbd519eb The multiple resource-constrained project scheduling problem: A breadth-first approach]''. [https://en.wikipedia.org/wiki/European_Jour

* [http://www.talkchess.com/forum/viewtopic.php?t=28823 Crafty problem with cutechess-cli] by [[Gian-Carlo Pascutto]], [[CCC]], July 07, 2009 » [

...kchess.com/forum/viewtopic.php?t=58730 LittleBlitzer question and possible problem] by [[Jouni Uski]], [[CCC]], December 29, 2015

* [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

* [https://www.stmintz.com/ccc/index.php?id=207580 Problem with short PV] by [[Benny Antonsson]], [[CCC]], January 15, 2002

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

* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=69024 Java problem] by [[Gabor Szots]], [[CCC]], November 24, 2018 » [[Java]]

...s://en.wikipedia.org/wiki/Fred_Reinfeld Reinfeld's] [[Win at Chess]] (WAC) problem set is 274/300,

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

...endall]] ('''2001'''). ''Applying Meta-Heuristic Algorithms to the Nesting Problem Utilising the No Fit Polygon''. Ph.D. thesis, [https://en.wikipedia.org/wik

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

...arrangierte Match gegen den Computer:Schach-Mikro für Boris Spasskij kein Problem], April 24, 1981, [[Computerworld#Woche|Computerwoche]] 17/1981 (German)</r

...ion.cfm?id=1624689 TULIPS: Teachable, Understanding Natural Language Input Problem-Solver]''. [[Conferences#IJCAI1975|IJCAI 1975]], [https://www.ijcai.org/Pro

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

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

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

...ician#IRNourbakhsh|Illah Nourbakhsh]] ('''1993'''). ''Time-Saving Tips for Problem Solving with Incomplete Information''. [[Conferences#AAAI-93|AAAI 1993]]

...wikipedia.org/wiki/Constraint_satisfaction_problem constraint satisfaction problem] and then attempting to maximize the probability that the fill is correct <

* [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

adressing the average reward problem in sudden death games (such as [https://en.wikipedia.org/wiki/Connection_ga

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

...omposer|chess composer]] <ref>[https://pdb.dieschwalbe.de/search.jsp Chess Problem Database Server] - [https://en.wikipedia.org/wiki/Die_Schwalbe Die Schwalbe

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]

...('''1970''').''[https://repository.upenn.edu/cis_reports/824/ Man-Computer Problem Solving in Real-Time Naval Duels]''. [https://en.wikipedia.org/wiki/Univers

...oogle.com/d/msg/rec.games.chess.computer/MyFmpXxqccg/Z6WgNuoF-hcJ Smullyan Problem in Sherlock Holmes book] by Christopher Heckman, [[Computer Chess Forums|rg

a chess program with focus on [[:Category:Problem|solving]] [[Checkmate|mates]], written by [[Leonid Liberman]] in [[x86]] [[ [[Category:Problem]]

...ps://en.wikipedia.org/wiki/Homicidal_chauffeur_problem Homicidal chauffeur problem - Wikipedia]</ref>

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

...ess.com/forum/viewtopic.php?t=59407 Stockfish 7 and partial 6 piece syzygy problem?] by [[Jouni Uski]], [[CCC]], March 01, 2016 » [[Stockfish]]

...the [https://en.wikipedia.org/wiki/Helpmate helpmate] [[:Category:Problem|problem solving program]] [[Brutalis]] <ref>[http://www.jens-musik.dk/brutalis.htm

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

...://www.talkchess.com/forum3/viewtopic.php?f=7&t=22726 reading in strings - problem with "\n"] by [[Richard Allbert]], [[CCC]], July 31, 2008

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

...'2014'''). ''One-loop vacuum polarization at mα7 order for the two center problem''. [https://arxiv.org/abs/1411.1894 arXiv:1411.1894]

...bolic_computation symbolic] [https://en.wikipedia.org/wiki/Problem_solving problem-solving] systems and [https://en.wikipedia.org/wiki/Natural_language_proces

...erformance characteristics of the Alpha-Beta procedure within the specific problem domain of this study.

...ps://en.wikipedia.org/wiki/Travelling_salesman_problem Travelling salesman problem from Wikipedia]</ref>

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

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

* [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

...ps://en.wikipedia.org/wiki/Travelling_salesman_problem travelling salesman problem], covering [https://en.wikipedia.org/wiki/Metropolis%E2%80%93Hastings_algor

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

...ing Time Efficiently: Genetic-Evolutionary Algorithms and the Continuation Problem]''. [https://dblp.uni-trier.de/db/conf/gecco/gecco1999.html GECCO 1999]

* [http://www.talkchess.com/forum/viewtopic.php?t=30471 Problem with functions not inlining] by [[Gregory Strong]], [[CCC]], November 04, 2

* [http://www.talkchess.com/forum/viewtopic.php?t=66804 Problem position using Scorpio Egbbs] by [[Ross Boyd]], [[CCC]], March 11, 2018 »

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

...d the [https://en.wikipedia.org/wiki/Assignment_problem general assignment problem] (GAP).

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

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

...wikipedia.org/wiki/Constraint_satisfaction_problem Constraint satisfaction problem (CSP) from Wikipedia]</ref>

...://www.talkchess.com/forum/viewtopic.php?t=34051 Ponder console input move problem] by [[Vlad Stamate]], [[CCC]], April 28, 2010 » [[Pondering]]

* The problem of research is that someone, somewhere, has already done what you are propo

...ve to move the horizon a little father down the road. The solution to this problem is also beyond the scope of this project.

...sus_Machine_Problem-Solving_Winning_Openings_in_Dakon Human versus Machine Problem Solving: Winning Openings in Dakon''. Journal of Board Game Studies, Vol. 3

...-of-War algorithms for exploration-exploitation dilemma in extended Bandit Problem]''. [http://www.journals.elsevier.com/biosystems/ Biosystems] 117, 1-9, [ht

* [[Göran Grottling]] ('''1985'''). ''Problem-Solving Ability Tested''. [[ICGA Journal#8_2|ICCA Journal, Vol. 8, No. 2]]

...). ''[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

* [http://www.talkchess.com/forum3/viewtopic.php?f=2&t=74666 SF NNUE Problem] by [[Stephen Ham]], [[CCC]], August 03, 2020

...yaka Yaji], [[Shalabh Bhatnagar]] ('''2015'''). ''A bi-convex optimization problem to compute Nash equilibrium in n-player games and an algorithm''. [https://

Crystal focuses on better [[Chess Problems, Compositions and Studies|problem solving]] abilities, and includes [[Fortress|fortress]] detection code.

...e which contains a collection of information relating to chess, computers, problem solving, [[Artificial Intelligence|artificial intelligence]] and other subj

the general Nonogram problem is [https://en.wikipedia.org/wiki/NP-hard NP-hard].

* [http://www.talkchess.com/forum/viewtopic.php?t=65718 Java problem!] by [[Günther Simon]], [[CCC]], November 13, 2017 » [[Java]]

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

'''Chest''', (CHEST, CHEss problem analyST)<br/> a [[:Category:Problem|program for solving]] orthodox [[Chess Problems, Compositions and Studies|c

...the topic of [[Parallel Search|parallel heuristics search]] applied to the problem of chess.

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

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

* [http://www.talkchess.com/forum/viewtopic.php?t=46151 Problem with Win7 and turning HT off] by [[Dragan Zdravkovic]], [[CCC]], November 2

...iling: a heuristic search for the Pattern self-Assembly Tile-set Synthesis problem). Bachelor's thesis, [https://en.wikipedia.org/wiki/Aalto_University Aalto

* [[Dominik Klein]] ('''2019'''). ''The Stroke Correspondence Problem, Revisited''. [https://arxiv.org/abs/1909.11995 arXiv:1909.11995]

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

* [http://www.talkchess.com/forum/viewtopic.php?t=28807 Problem with pipe inheritance... ] by [[Stephan Vermeire]], [[CCC]], July 06, 2009

...m/g/rec.games.chess.computer/c/zIUg9A3GkZg/m/D7OvJBESxiMJ crafty copyright problem] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], February 17, 1999

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

...m/g/rec.games.chess.computer/c/zIUg9A3GkZg/m/D7OvJBESxiMJ crafty copyright problem] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], February 17, 1999</re

...m/g/rec.games.chess.computer/c/zIUg9A3GkZg/m/D7OvJBESxiMJ crafty copyright problem] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], February 17, 1999</re

...i/NP-complete NP-complete] [https://en.wikipedia.org/wiki/Decision_problem problem] arising in [https://en.wikipedia.org/wiki/Optical_character_recognition op

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

<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

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

a Finnish [[:Category:Chess Composer|chess problem composer]] and author of the commercial chess solving programs [[Alybadix]]

Václav Kotěšovec is author of the [[:Category:Problem|solving and composing software]] [[VKsach]] <ref>[http://www.kotesovec.cz/n

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

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

.../www.talkchess.com/forum3/viewtopic.php?f=2&t=42099&start=9 Re: Philou 3.7 problem ...] by [[Philippe Gailhac]], [[CCC]], January 31, 2012

* [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

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

* [[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

...Velani]] ('''2013'''). ''Badly approximable points on planar curves and a problem of Davenport''. [https://arxiv.org/abs/1301.4243 arXiv:1301.4243] » [[Math

...'''). ''Improving Human Players’ T-Spin Skills in Tetris with Procedural Problem Generation''. [[Advances in Computer Games 16]]