25,161
edits
Changes
Created page with "'''Home * Knowledge * Planning''' FILE:Pn-slogan-zakon.jpg|border|right|thumb|Plan is law, fulfillment is duty, over-fulfillment is honor! <ref>Лозун..."
'''[[Main Page|Home]] * [[Knowledge]] * Planning'''
[[FILE:Pn-slogan-zakon.jpg|border|right|thumb|Plan is law, fulfillment is duty, over-fulfillment is honor! <ref>Лозунг «План — закон, выполнение — долг, перевыполнение — честь!» в здании Ольховско-Батьковского торфяного предприятия в Кубринске, Переславский район - «Plan is law, fulfillment is duty, over-fulfillment is honor!» Building Olkhovskaya Batkovsky - peat enterprise [http://www.stad.com/index.php?city_id=540014 Kubrinsk], [https://en.wikipedia.org/wiki/Pereslavsky_District Pereslavskiy district], Photo by Н. Частов (N. Part), November 1997, [https://en.wikipedia.org/wiki/Five-Year_Plans_for_the_National_Economy_of_the_Soviet_Union Five-Year Plans for the National Economy of the Soviet Union - Wikipedia]</ref> ]]
'''Planning''',<br/>
the process of applying knowledge, [https://en.wikipedia.org/wiki/Thought thinking] and [https://en.wikipedia.org/wiki/Prediction prediction] to create and maintain a [https://en.wikipedia.org/wiki/Plan plan], a [https://en.wikipedia.org/wiki/Temporal_logic temporal] set of intended actions to achieve a certain goal, in chess, to finally win the game.
=Terms of Planning=
In 1997, [[Jan van Reek]] <ref>[[Jan van Reek]] ('''1997'''). ''Strategy in Chess''. Schachfirma Fruth, Unterhaching, ISBN 3-9804896-9-8</ref> categorized planning in chess to three main characteristics, [[Tactics|tactics]], positional play, and [[Strategy|strategy]], where positional play serves as guideline for planning of a strategy <ref>[[Jan van Reek]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''1998'''). ''Planning a Strategy in Chess''. [[ICGA Journal#21_3|ICCA Journal, Vol. 21, No. 3]]</ref>:
{| class="wikitable"
|-
!
! Terms of Planning
! Aim
! Dominating abstraction
|-
| Tactics
| Short
| To gain material or to mate
| Matter
|-
| Positional play
| Medium
| To improve the position
| Space
|-
| Strategy
| Long
| To swing the balance
| Time
|}
=Long-range Planning=
Long-range planning by human chess players is usually made on the basis of [https://en.wikipedia.org/wiki/Reason reasoning], [https://en.wikipedia.org/wiki/Experience experience], and [https://en.wikipedia.org/wiki/Intuition_%28psychology%29 intuition], as investigated by [[Adriaan de Groot|De Groot]] in 1946 <ref>[[Adriaan de Groot]] ('''1946'''). ''Het denken van den Schaker, een experimenteel-psychologische studie.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam]; N.V. Noord-Hollandse Uitgevers Maatschappij, [https://en.wikipedia.org/wiki/Amsterdam Amsterdam]. Translated with the help of [[George Baylor]], with additions, (in '''1965''') as ''Thought and Choice in Chess''. Mouton Publishers, The Hague. ISBN 90-279-7914-6</ref>.
=Search and Evaluation=
Conventional [[Depth-First|depth-first]] [[Alpha-Beta|alpha-beta searchers]] have no real sense of planning other than [[Minimax|minimaxing]] their [[Score|score]] inside their [[Horizon Effect|search horizons]]. Inside chess programs, planning is often implicit due to [[Search|look ahead]] and certain [[Evaluation|evaluation]] features and their associated weights. For instance, a bonus for a [[Rook on Open File|Rook on an open file]], and another bonus to [[Rook On Seventh|occupy the 7th rank]] is a typical example to mimic some kind of strategic planning. However, long-range planning and seeking for goals requires [[Pattern Recognition|pattern recognition]] and associated advices if they match.
=Oracle Approaches=
[[Oracle]] approaches such as [[Piece-Square Tables#Preprocessing|pre-processing]] and initializing [[Piece-Square Tables|piece-square tables]] based on features and pattern of the [[Root|root]] may realize plans like [[Minority Attack|minority attack]] and along with [[Pawn Structure|pawn structure]] and king placement, plans to attack the king. However, with todays typical [[Depth|search depths]] one has to consider [[Path-Dependency|path-dependencies]], [[Transposition Table|transposition table]] anomalies and resulting [[Search Instability|search instabilities]]. Instead, oracle approaches at or near the root, may be used to initialize dedicated piece-square tables for the sole purpose to control [[Selectivity|selectivity]] further down the tree, for instance to [[Extensions|extend]] moves according to a certain plan.
=Chess Quotes=
<ref>[http://www.chessquotes.com/topic-strategy Chess Quotes - Strategy]</ref>
* [https://en.wikipedia.org/wiki/Frank_Marshall_%28chess_player%29 Frank Marshall]: A bad plan is better than none at all.
* [[Mathematician#EmanuelLasker|Emanuel Lasker]]: To find the right plan is just as hard as looking for its sound justification.
* [https://en.wikipedia.org/wiki/Eugene_Znosko-Borovsky Eugene Znosko-Borovsky]: It is not a move, even the best move that you must seek, but a realizable plan.
* [https://en.wikipedia.org/wiki/Alexander_Kotov Alexander Kotov]: It is better to follow out a plan consistently even if it isn't the best one than to play without a plan at all. The worst thing is to wander about aimlessly.
=Chess Programs=
* [[N.N.]]
* [[Paradise]]
* [[Planner]]
* [[Symbolic]]
=See also=
* [[CHE]]
* [[Chunking]]
* [[Cognition]]
* [[History Heuristic]]
* [[Learning]]
* [[Opponent Model Search]]
* [[Oracle]]
* [[Pawn Structure]]
* [[Pattern Recognition]]
* [[Piece-Square Tables#Preprocessing|Pre-Processing]]
* [[Psychology]]
* [[Reinforcement Learning]]
* [[Strategy]]
* [[Tactics]]
* [[Time Management]]
=Publications=
==1946 ...==
* [[Adriaan de Groot]] ('''1946'''). ''Het denken van den Schaker, een experimenteel-psychologische studie.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], advisor [[Mathematician#Revesz|Géza Révész]]; N.V. Noord-Hollandse Uitgevers Maatschappij, [https://en.wikipedia.org/wiki/Amsterdam Amsterdam]. Translated with the help of [[George Baylor]], with additions, (in '''1965''') as ''Thought and Choice in Chess''. Mouton Publishers, The Hague. ISBN 90-279-7914-6.
==1950 ...==
* [[Max Euwe]] ('''1953'''). ''Judgment and Planning in Chess''. McKay Company, New York, N.Y. <ref>[http://www.chessgames.com/perl/chesscollection?cid=1006215 Judgment and Planning in Chess], games from [[Max Euwe|Dr. Max Euwe's]] book ''Judgment and Planning in Chess''. [http://www.chessgames.com/index.html chessgames.com]</ref>
==1960 ...==
* [[Adriaan de Groot]] ('''1965, 1978'''). ''Thought and Choice in Chess''. Mouton & Co Publishers, The Hague, The Netherlands. ISBN 90-279-7914-6
* [[Jack Good]] ('''1968'''). ''A Five-Year Plan for Automatic Chess''. [http://www.doc.ic.ac.uk/~shm/MI/mi2.html Machine Intelligence Vol. 2] pp. 110-115, [http://doczine.com/bigdata/2/1366100941_3145d71044/mi2-ch7-good.pdf pdf] from [http://doczine.com/ doczine]
==1970 ...==
* [[Mikhail Botvinnik]] ('''1970'''). ''Computers, Chess and Long-Range Planning''. Springer-Verlag, New York.
* [[Walter R. Reitman]], [[James Kerwin]], [[Robert Nado]], [[Judith Spencer Olson|Judith S. Reitman]], [[Bruce Wilcox]] ('''1974'''). ''[http://dl.acm.org/citation.cfm?id=810391 Goals and Plans in a Program for Playing Go]''. Proceedings of the 29th [[ACM]] Conference
* [[Larry Harris|Larry R. Harris]] ('''1975''') ''The Heuristic Search And The Game Of Chess - A Study Of Quiescence, Sacrifices, And Plan Oriented Play''. [http://dblp.uni-trier.de/db/conf/ijcai/ijcai75.html 4. IJCAI 1975], reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[Jacques Pitrat]] ('''1977'''). ''A Chess Combination Program Which Uses Plans.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol 8, No. 3
* [[Russell M. Church]], [[Kenneth W. Church]] ('''1977'''). ''Plans, Goals, and Search Strategies for the Selection of a Move in Chess''. [[Chess Skill in Man and Machine]]
* [[David Wilkins]] ('''1979'''). ''Using Patterns and Plans to Solve Problems and Control Search''. Ph.D. thesis, Computer Science Dept, [[Stanford University]], Stanford, California, AI Lab Memo AIM-329
* [[David Wilkins]] ('''1979'''). ''Using plans in chess''. In Proceedings of the 1979 International Joint Conference on Artificial Intelligence, (Tokyo, Japan), pp. 960-967.
* [[Jacques Pitrat]] ('''1979'''). ''A Program which Uses Plans for Finding Combinations in Chess''. [[ICGA Journal#2_2|ICCA Newsletter, Vol. 2 No. 2]]
==1980 ...==
* [[David Wilkins]] ('''1980'''). ''Using patterns and plans in chess''. Artificial Intelligence, Vol. 14, pp. 165-203. Reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[Jacques Pitrat]] ('''1980'''). ''The Behaviour of a Chess Combination Program using Plans.'' [[Advances in Computer Chess 2]]
* [[Jonathan Schaeffer]] ('''1980'''). ''Long-Range Planning in Computer Chess''. Master's thesis, Department of Computer Science, [[University of Waterloo]]
* [[Sarah E. Goldin]], [http://www.ksl.stanford.edu/people/bhr/ Barbara Hayes-Roth] ('''1980'''). ''[http://www.rand.org/pubs/notes/N1488.html Individual Differences in Planning Processes]''. [https://en.wikipedia.org/wiki/RAND_Corporation RAND] note N-1488
* [[Jaime Carbonell]] ('''1981'''). ''Counterplanning: A Strategy-Based Model of Adversary Planning in Real-World Situations''. Artificial Intelligence, Vol. 16
* [[Kai von Luck]], [[Bernd Owsnicki-Klewe|Bernd Owsnicki]] ('''1982'''). ''N.N.: A View of Planning in Chess''. in [http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/w/Wahlster:Wolfgang.html Wahlster], [http://www.informatik.uni-trier.de/%7Eley/db/conf/ki/gwai1982.html GWAI-82]
* [[Helmut Horacek]] ('''1982'''). ''Construction of Planned Move Trees for Chess Pawn Endings''. Sigart Newsletter 80, pp. 163-168.
* [[Evgeniĭ Dmitrievich Cherevik|E. D. Cherevik]], [http://www.amazon.de/s/ref=dp_byline_sr_book_2?ie=UTF8&field-author=Y.M.+Shvyrkov&search-alias=books-de-intl-us&text=Y.M.+Shvyrkov Y. M. Shvyrkov] ('''1982'''). ''[https://catalog.lib.uchicago.edu/vufind/Record/517650 An ABC of Planning : Fundamentals of the Theory and Methodology of Economic Planning]''. [https://en.wikipedia.org/wiki/Progress_Publishers Progress Moscow]
* [[Hermann Kaindl]] ('''1982'''). ''Positional Long-Range Planning in Computer Chess.'' [[Advances in Computer Chess 3]], also published as [[Hermann Kaindl]] ('''1983'''). ''Positional Long-Range Planning in Computer Chess.'' [[Vienna University of Technology]], Austria.
* [[Ivan Bratko]] ('''1984'''). ''Advice and Planning in Chess Endgames.'' Artificial and Human Thinking (eds. S. Amarel, A. Elithorn and R. Banerji). North-Holland.
==1985 ...==
* [[Hans Berliner]] ('''1985'''). ''Goals, Plans, and Mechanisms: Non-symbolically in an Evaluation Surface.'' Presentation at Evolution, Games, and Learning, Center for Nonlinear Studies, [[Los Alamos National Laboratory]], May 21.
* [[Richard Korf]] ('''1987'''). ''Planning as Search: A Quantitative Approach.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 33, pp. 65-88.
* [[David Wilkins]] ('''1988'''). ''Practical Planning: Extending the Classical AI Planning Paradigm''. (Morgan Kaufmann Series in Representation and Reasoning), [http://www.amazon.com/ref=gno_logo amazon]
* [[Bruce Abramson]] ('''1989'''). ''Control Strategies for Two-Player Games.'' [[ACM#Surveys|ACM Computing Surveys]], Vol. 21, No. 2
* [[Reiner Seidel]] ('''1989'''). ''A Model of Chess Knowledge - Planning Structures and Constituent Analysis''. [[Advances in Computer Chess 5]]
==1990 ...==
* [[David Wilkins]] ('''1991'''). ''Working notes on paradise chess patterns''. Technical Note 509, AI Center, SRI International, 333 Ravenswood Ave., Menlo Park, CA 94025
* [[Jens Christensen]], [http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/g/Grove:Adam_J=.html Adam Grove] ('''1991'''). ''A Formal Model Classical Planning''. [http://dblp.uni-trier.de/db/conf/ijcai/ijcai91.html#ChristensenG91 IJCAI-91], [http://ijcai.org/Past%20Proceedings/IJCAI-91-VOL1/PDF/039.pdf pdf]
* [[Jens Christensen]] ('''1991'''). ''[http://naca.larc.nasa.gov/search.jsp?R=19970034976&qs=N%3D4294129240%2B4294374694 Automatic Abstraction in Planning]''. Ph.D. thesis, [[Stanford University]]
* [[Steven Walczak]] ('''1992'''). ''Pattern-Based Tactical Planning''. [http://www.informatik.uni-trier.de/~ley/db/journals/ijprai/ijprai6.html#Walczak92 IJPRAI], Vol. 6, No. 5
* [[Stephen J.J. Smith]], [[Dana Nau|Dana S. Nau]], [[Thomas A. Throop]] ('''1992'''). ''[http://dl.acm.org/citation.cfm?id=139657 A hierarchical approach to strategic planning with non-cooperating agents under conditions of uncertainty]''. Proceedings of the First International Conference on AI Planning Systems
* [[Stephen J.J. Smith]], [[Dana Nau|Dana S. Nau]] ('''1993'''). ''[http://dl.acm.org/citation.cfm?id=171355&coll=DL&dl=GUIDE&CFID=403943247&CFTOKEN=26458653 Strategic planning for imperfect-information games]''. Technical Report, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park]
* [[Mikhail Botvinnik]], [[Evgeniĭ Dmitrievich Cherevik]], [[Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''[https://getinfo.de/app/Solving-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]] » [[CC Sapiens]]
* [[Andreas L. Opdahl]], [[Bjornar Tessem]] ('''1994'''). ''Long-Term Planning in Computer Chess''. [[Advances in Computer Chess 7]]
==1995 ...==
* [[Stephen J.J. Smith]], [[Dana Nau|Dana S. Nau]], [[Thomas A. Throop]] ('''1996'''). ''Total-Order Multi-Agent Task-Network Planning for Contract Bridge''. [[AAAI|AAAI 1996]]
* [https://en.wikipedia.org/wiki/Henry_Kautz Henry Kautz], [[Bart Selman]] ('''1996'''). ''Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search''. [[AAAI|AAAI 1996]], [http://www.cs.cornell.edu/selman/papers/pdf/plan.pdf pdf]
* [[Chrilly Donninger]] ('''1996'''). ''CHE: A Graphical Language for Expressing Chess Knowledge''. [[ICGA Journal#19_4|ICCA Journal, Vol. 19, No. 4]]
* [[Jan van Reek]] ('''1997'''). ''Strategy in Chess''. Schachfirma Fruth, Unterhaching, ISBN 3-9804896-9-8
* [[Jan van Reek]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''1998'''). ''Planning a Strategy in Chess''. [[ICGA Journal#21_3|ICCA Journal, Vol. 21, No. 3]]
* [[Stephen J.J. Smith]], [[Dana Nau|Dana S. Nau]], [[Thomas A. Throop]] ('''1998'''). ''Computer Bridge: A Big Win for AI Planning''. AI Magazine, Vol. 19, No. 2
* [[Ian Frank]] ('''1998'''). ''[http://www.goodreads.com/book/show/7998822-search-and-planning-under-incomplete-information Search and Planning Under Incomplete Information: A Study Using Bridge Card Play]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], Ph.D. thesis, [[University of Edinburgh]]
==2000 ...==
* [[Mark Brockington]] ('''2000'''). ''Computer Chess Meets Planning''. [[ICGA Journal#23_2|ICGA Journal, Vol. 23, No. 2]]
* [[Alex B. Meijer]], [[Henk Koppelaar]] ('''2001'''). ''[http://www.kbs.twi.tudelft.nl/Publications/Conference/2001/2001-MeijerKoppelaar-BNAIC01.html Pursuing abstract goals in the game of Go]''. [http://hcs.science.uva.nl/bnaic01/ BNAIC 2001]
* [[Adi Botea]] ('''2002'''). ''Using Abstraction for Heuristic Search and Planning''. Research Summary. In Proceedings of the 5th International Symposium on Abstraction, Reformulation, and Approximation SARA-02, volume 2371 of Lecture Notes in Artificial Intelligence, 326-327, Kananaskis, AB, Canada.
* [[Ari Shapiro]], [[Gil Fuchs]], [[Robert Levinson]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_4 Learning a Game Strategy Using Pattern-Weights and Self-play]''. [[CG 2002]]
* [[Adi Botea]], [[Martin Müller]], [[Jonathan Schaeffer]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_24 Using Abstraction for Planning in Sokoban]''. [[CG 2002]]
* [[Joelle Pineau]] ('''2004'''). ''Tractable Planning Under Uncertainty: Exploiting Structure''. Ph.D. thesis, [[Carnegie Mellon University]], [http://www.cs.mcgill.ca/~jpineau/files/jpineau-thesis.pdf pdf]
==2005 ...==
* [[Adi Botea]], [[Markus Enzenberger]], [[Martin Müller]], [[Jonathan Schaeffer]] ('''2005'''). ''Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators''. Journal of Artificial Intelligence Research 24 (2005) 581-621, [http://www.jair.org/media/1696/live-1696-2537-jair.pdf pdf]
* [http://www.lsi.upc.edu/~alquezar/ René Alquézar], A. Gonzalez Camargo, [[Alejandro González Romero]] ('''2006'''). ''[http://portal.acm.org/citation.cfm?id=1166904 Evolving Plans for the KRKa2 Chess Ending]''. Artificial Intelligence and Applications 2006
* [[Adi Botea]] ('''2006'''). ''Improving AI Planning and Search with Automatic Abstraction''. PhD Thesis, [[University of Alberta]], [http://abotea.rsise.anu.edu.au/data/thesis.pdf pdf]
* [[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, pp. 282-293. introducing [[UCT]], [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]
* [[Frantisek Sailer]], [[Michael Buro]], [[Marc Lanctot]] ('''2007'''). ''Adversarial planning through strategy simulation''. [[IEEE#CIG|Computational Intelligence and Games]], [https://skatgame.net/mburo/ps/rtsmc.pdf pdf]
* [[Zvi Retchkiman Königsberg]] ('''2007'''). ''A Combinatorial Game Mathematical Strategy Planning Procedure for a Class of Chess Endgames''. [http://www.m-hikari.com/imf-password2007/65-68-2007/index.html International Mathematical Forum, Vol. 2, No. 68]
* [[Sylvain Gelly]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Olivier Teytaud]], [http://fr.linkedin.com/pub/yann-kalemkarian/7/7aa/716 Yann Kalemkarian] ('''2008'''). ''The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning''. ICINCO-ICSO 2008: 244-249, [http://hal.archives-ouvertes.fr/docs/00/28/78/67/PDF/icin08.pdf pdf], [http://www.lri.fr/~teytaud/UCTpara.pdf slides as pdf]
* [[Akihiro Kishimoto]], [[Alex Fukunaga]], [[Adi Botea]] ('''2009'''). ''Scalable, Parallel Best-First Search for Optimal Sequential Planning''. In Proceedings of the [http://icaps09.uom.gr/ 19th International Conference on Automated Planning and Scheduling] (ICAPS-2009) (Best Paper Award), pages 201-208, [http://abotea.rsise.anu.edu.au/data/kishimoto-etal-icaps09.pdf pdf]
* [[Gerhard Trippen]] ('''2009'''). ''Plans, Patterns and Move Categories Guiding a Highly Selective Search''. [[Advances in Computer Games 12]], [http://arimaa.com/arimaa/papers/0905Trippen/Contribution118.pdf pdf]
==2010 ...==
* [[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010]
* [[Raghuram Ramanujan]], [[Bart Selman]] ('''2011'''). ''[http://aaai.org/ocs/index.php/ICAPS/ICAPS11/paper/view/2708 Trade-Offs in Sampling-Based Adversarial Planning]''. [http://www.aaai.org/Press/Proceedings/icaps11.php ICAPS 2011], [http://videolectures.net/raghuram_ramanujan/ best paper], [http://videolectures.net/icaps2011_ramanujan_sampling/ VideoLecture] » [[UCT]]
* [[Stefano Cianciulli]], [[Stavros Vassos]] ('''2013'''). ''Planning for Interactive Storytelling Processes''. [http://icaps13.icaps-conference.org/technical-program/workshop-program/planning-in-games/ ICAPS-2013], [http://stavros.lostre.org/files/CianciulliVassos2013Jaco.pdf pdf]
* [[Arthur Guez]], [[David Silver]], [[Peter Dayan]] ('''2014'''). ''Better Optimism By Bayes: Adaptive Planning with Rich Models''. [https://arxiv.org/abs/1402.1958 arXiv:1402.1958v1]
* [[Arthur Guez]], [[Nicolas Heess]], [[David Silver]], [[Peter Dayan]] ('''2014'''). ''Bayes-Adaptive Simulation-based Search with Value Function Approximation''. [https://papers.nips.cc/book/advances-in-neural-information-processing-systems-27-2014 NIPS 2014], [https://papers.nips.cc/paper/5501-bayes-adaptive-simulation-based-search-with-value-function-approximation.pdf pdf]
==2015 ...==
* [[Arthur Guez]] ('''2015'''). ''Sample-based Search Methods for Bayes-Adaptive Planning''. Ph.D. Thesis, Gatsby Computational Neuroscience Unit, [https://en.wikipedia.org/wiki/University_College_London University College London], [http://www.gatsby.ucl.ac.uk/~aguez/files/guez_phdthesis2015.pdf pdf]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=347144 Implementing Planning in an Engine] by [[Tom Likens]], [[CCC]], February 04, 2004
* [https://www.stmintz.com/ccc/index.php?id=348682 Possible definition of planning] by [[Charles Roberson]], [[CCC]], February 12, 2004
=External Links=
* [https://en.wikipedia.org/wiki/Planning Planning from Wikipedia]
* [https://en.wikipedia.org/wiki/Plan_%28disambiguation%29 Plan (disambiguation) from Wikipedia]
* [https://en.wikipedia.org/wiki/State_space_planning State space planning from Wikipedia]
* [https://en.wikipedia.org/wiki/Strategic_planning Strategic planning from Wikipedia]
* [https://en.wikipedia.org/wiki/Plan Plan from Wikipedia]
* [https://en.wikipedia.org/wiki/Automated_planning_and_scheduling Automated planning and scheduling from Wikipedia]
* [https://en.wikipedia.org/wiki/Planning_fallacy Planning fallacy from Wikipedia]
* [https://en.wikipedia.org/wiki/Forecasting Forecasting from Wikipedia]
* [https://en.wikipedia.org/wiki/Prediction Prediction from Wikipedia]
* [http://www.chess-insights.com/how-to-plan-in-chess.html Discover How To Plan In Chess]
* [http://www.chessplans.com/ Chess Plans - Home]
* [http://www.chess.com/article/view/planning-in-chess Planning in Chess] by [https://en.wikipedia.org/wiki/Natalia_Pogonina Natalia Pogonina], [http://www.chess.com/ Chess.com], June 21, 2010
* [http://opsound.org/artist/bigbonobotheinternationalbigbono/ Bigbonobo Combo] - Whitecube plan, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=ttOGPYZWtuQ|alignment=left|valignment=top}}
=References=
<references />
'''[[Knowledge|Up one Level]]'''
[[FILE:Pn-slogan-zakon.jpg|border|right|thumb|Plan is law, fulfillment is duty, over-fulfillment is honor! <ref>Лозунг «План — закон, выполнение — долг, перевыполнение — честь!» в здании Ольховско-Батьковского торфяного предприятия в Кубринске, Переславский район - «Plan is law, fulfillment is duty, over-fulfillment is honor!» Building Olkhovskaya Batkovsky - peat enterprise [http://www.stad.com/index.php?city_id=540014 Kubrinsk], [https://en.wikipedia.org/wiki/Pereslavsky_District Pereslavskiy district], Photo by Н. Частов (N. Part), November 1997, [https://en.wikipedia.org/wiki/Five-Year_Plans_for_the_National_Economy_of_the_Soviet_Union Five-Year Plans for the National Economy of the Soviet Union - Wikipedia]</ref> ]]
'''Planning''',<br/>
the process of applying knowledge, [https://en.wikipedia.org/wiki/Thought thinking] and [https://en.wikipedia.org/wiki/Prediction prediction] to create and maintain a [https://en.wikipedia.org/wiki/Plan plan], a [https://en.wikipedia.org/wiki/Temporal_logic temporal] set of intended actions to achieve a certain goal, in chess, to finally win the game.
=Terms of Planning=
In 1997, [[Jan van Reek]] <ref>[[Jan van Reek]] ('''1997'''). ''Strategy in Chess''. Schachfirma Fruth, Unterhaching, ISBN 3-9804896-9-8</ref> categorized planning in chess to three main characteristics, [[Tactics|tactics]], positional play, and [[Strategy|strategy]], where positional play serves as guideline for planning of a strategy <ref>[[Jan van Reek]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''1998'''). ''Planning a Strategy in Chess''. [[ICGA Journal#21_3|ICCA Journal, Vol. 21, No. 3]]</ref>:
{| class="wikitable"
|-
!
! Terms of Planning
! Aim
! Dominating abstraction
|-
| Tactics
| Short
| To gain material or to mate
| Matter
|-
| Positional play
| Medium
| To improve the position
| Space
|-
| Strategy
| Long
| To swing the balance
| Time
|}
=Long-range Planning=
Long-range planning by human chess players is usually made on the basis of [https://en.wikipedia.org/wiki/Reason reasoning], [https://en.wikipedia.org/wiki/Experience experience], and [https://en.wikipedia.org/wiki/Intuition_%28psychology%29 intuition], as investigated by [[Adriaan de Groot|De Groot]] in 1946 <ref>[[Adriaan de Groot]] ('''1946'''). ''Het denken van den Schaker, een experimenteel-psychologische studie.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam]; N.V. Noord-Hollandse Uitgevers Maatschappij, [https://en.wikipedia.org/wiki/Amsterdam Amsterdam]. Translated with the help of [[George Baylor]], with additions, (in '''1965''') as ''Thought and Choice in Chess''. Mouton Publishers, The Hague. ISBN 90-279-7914-6</ref>.
=Search and Evaluation=
Conventional [[Depth-First|depth-first]] [[Alpha-Beta|alpha-beta searchers]] have no real sense of planning other than [[Minimax|minimaxing]] their [[Score|score]] inside their [[Horizon Effect|search horizons]]. Inside chess programs, planning is often implicit due to [[Search|look ahead]] and certain [[Evaluation|evaluation]] features and their associated weights. For instance, a bonus for a [[Rook on Open File|Rook on an open file]], and another bonus to [[Rook On Seventh|occupy the 7th rank]] is a typical example to mimic some kind of strategic planning. However, long-range planning and seeking for goals requires [[Pattern Recognition|pattern recognition]] and associated advices if they match.
=Oracle Approaches=
[[Oracle]] approaches such as [[Piece-Square Tables#Preprocessing|pre-processing]] and initializing [[Piece-Square Tables|piece-square tables]] based on features and pattern of the [[Root|root]] may realize plans like [[Minority Attack|minority attack]] and along with [[Pawn Structure|pawn structure]] and king placement, plans to attack the king. However, with todays typical [[Depth|search depths]] one has to consider [[Path-Dependency|path-dependencies]], [[Transposition Table|transposition table]] anomalies and resulting [[Search Instability|search instabilities]]. Instead, oracle approaches at or near the root, may be used to initialize dedicated piece-square tables for the sole purpose to control [[Selectivity|selectivity]] further down the tree, for instance to [[Extensions|extend]] moves according to a certain plan.
=Chess Quotes=
<ref>[http://www.chessquotes.com/topic-strategy Chess Quotes - Strategy]</ref>
* [https://en.wikipedia.org/wiki/Frank_Marshall_%28chess_player%29 Frank Marshall]: A bad plan is better than none at all.
* [[Mathematician#EmanuelLasker|Emanuel Lasker]]: To find the right plan is just as hard as looking for its sound justification.
* [https://en.wikipedia.org/wiki/Eugene_Znosko-Borovsky Eugene Znosko-Borovsky]: It is not a move, even the best move that you must seek, but a realizable plan.
* [https://en.wikipedia.org/wiki/Alexander_Kotov Alexander Kotov]: It is better to follow out a plan consistently even if it isn't the best one than to play without a plan at all. The worst thing is to wander about aimlessly.
=Chess Programs=
* [[N.N.]]
* [[Paradise]]
* [[Planner]]
* [[Symbolic]]
=See also=
* [[CHE]]
* [[Chunking]]
* [[Cognition]]
* [[History Heuristic]]
* [[Learning]]
* [[Opponent Model Search]]
* [[Oracle]]
* [[Pawn Structure]]
* [[Pattern Recognition]]
* [[Piece-Square Tables#Preprocessing|Pre-Processing]]
* [[Psychology]]
* [[Reinforcement Learning]]
* [[Strategy]]
* [[Tactics]]
* [[Time Management]]
=Publications=
==1946 ...==
* [[Adriaan de Groot]] ('''1946'''). ''Het denken van den Schaker, een experimenteel-psychologische studie.'' Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Amsterdam University of Amsterdam], advisor [[Mathematician#Revesz|Géza Révész]]; N.V. Noord-Hollandse Uitgevers Maatschappij, [https://en.wikipedia.org/wiki/Amsterdam Amsterdam]. Translated with the help of [[George Baylor]], with additions, (in '''1965''') as ''Thought and Choice in Chess''. Mouton Publishers, The Hague. ISBN 90-279-7914-6.
==1950 ...==
* [[Max Euwe]] ('''1953'''). ''Judgment and Planning in Chess''. McKay Company, New York, N.Y. <ref>[http://www.chessgames.com/perl/chesscollection?cid=1006215 Judgment and Planning in Chess], games from [[Max Euwe|Dr. Max Euwe's]] book ''Judgment and Planning in Chess''. [http://www.chessgames.com/index.html chessgames.com]</ref>
==1960 ...==
* [[Adriaan de Groot]] ('''1965, 1978'''). ''Thought and Choice in Chess''. Mouton & Co Publishers, The Hague, The Netherlands. ISBN 90-279-7914-6
* [[Jack Good]] ('''1968'''). ''A Five-Year Plan for Automatic Chess''. [http://www.doc.ic.ac.uk/~shm/MI/mi2.html Machine Intelligence Vol. 2] pp. 110-115, [http://doczine.com/bigdata/2/1366100941_3145d71044/mi2-ch7-good.pdf pdf] from [http://doczine.com/ doczine]
==1970 ...==
* [[Mikhail Botvinnik]] ('''1970'''). ''Computers, Chess and Long-Range Planning''. Springer-Verlag, New York.
* [[Walter R. Reitman]], [[James Kerwin]], [[Robert Nado]], [[Judith Spencer Olson|Judith S. Reitman]], [[Bruce Wilcox]] ('''1974'''). ''[http://dl.acm.org/citation.cfm?id=810391 Goals and Plans in a Program for Playing Go]''. Proceedings of the 29th [[ACM]] Conference
* [[Larry Harris|Larry R. Harris]] ('''1975''') ''The Heuristic Search And The Game Of Chess - A Study Of Quiescence, Sacrifices, And Plan Oriented Play''. [http://dblp.uni-trier.de/db/conf/ijcai/ijcai75.html 4. IJCAI 1975], reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[Jacques Pitrat]] ('''1977'''). ''A Chess Combination Program Which Uses Plans.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol 8, No. 3
* [[Russell M. Church]], [[Kenneth W. Church]] ('''1977'''). ''Plans, Goals, and Search Strategies for the Selection of a Move in Chess''. [[Chess Skill in Man and Machine]]
* [[David Wilkins]] ('''1979'''). ''Using Patterns and Plans to Solve Problems and Control Search''. Ph.D. thesis, Computer Science Dept, [[Stanford University]], Stanford, California, AI Lab Memo AIM-329
* [[David Wilkins]] ('''1979'''). ''Using plans in chess''. In Proceedings of the 1979 International Joint Conference on Artificial Intelligence, (Tokyo, Japan), pp. 960-967.
* [[Jacques Pitrat]] ('''1979'''). ''A Program which Uses Plans for Finding Combinations in Chess''. [[ICGA Journal#2_2|ICCA Newsletter, Vol. 2 No. 2]]
==1980 ...==
* [[David Wilkins]] ('''1980'''). ''Using patterns and plans in chess''. Artificial Intelligence, Vol. 14, pp. 165-203. Reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[Jacques Pitrat]] ('''1980'''). ''The Behaviour of a Chess Combination Program using Plans.'' [[Advances in Computer Chess 2]]
* [[Jonathan Schaeffer]] ('''1980'''). ''Long-Range Planning in Computer Chess''. Master's thesis, Department of Computer Science, [[University of Waterloo]]
* [[Sarah E. Goldin]], [http://www.ksl.stanford.edu/people/bhr/ Barbara Hayes-Roth] ('''1980'''). ''[http://www.rand.org/pubs/notes/N1488.html Individual Differences in Planning Processes]''. [https://en.wikipedia.org/wiki/RAND_Corporation RAND] note N-1488
* [[Jaime Carbonell]] ('''1981'''). ''Counterplanning: A Strategy-Based Model of Adversary Planning in Real-World Situations''. Artificial Intelligence, Vol. 16
* [[Kai von Luck]], [[Bernd Owsnicki-Klewe|Bernd Owsnicki]] ('''1982'''). ''N.N.: A View of Planning in Chess''. in [http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/w/Wahlster:Wolfgang.html Wahlster], [http://www.informatik.uni-trier.de/%7Eley/db/conf/ki/gwai1982.html GWAI-82]
* [[Helmut Horacek]] ('''1982'''). ''Construction of Planned Move Trees for Chess Pawn Endings''. Sigart Newsletter 80, pp. 163-168.
* [[Evgeniĭ Dmitrievich Cherevik|E. D. Cherevik]], [http://www.amazon.de/s/ref=dp_byline_sr_book_2?ie=UTF8&field-author=Y.M.+Shvyrkov&search-alias=books-de-intl-us&text=Y.M.+Shvyrkov Y. M. Shvyrkov] ('''1982'''). ''[https://catalog.lib.uchicago.edu/vufind/Record/517650 An ABC of Planning : Fundamentals of the Theory and Methodology of Economic Planning]''. [https://en.wikipedia.org/wiki/Progress_Publishers Progress Moscow]
* [[Hermann Kaindl]] ('''1982'''). ''Positional Long-Range Planning in Computer Chess.'' [[Advances in Computer Chess 3]], also published as [[Hermann Kaindl]] ('''1983'''). ''Positional Long-Range Planning in Computer Chess.'' [[Vienna University of Technology]], Austria.
* [[Ivan Bratko]] ('''1984'''). ''Advice and Planning in Chess Endgames.'' Artificial and Human Thinking (eds. S. Amarel, A. Elithorn and R. Banerji). North-Holland.
==1985 ...==
* [[Hans Berliner]] ('''1985'''). ''Goals, Plans, and Mechanisms: Non-symbolically in an Evaluation Surface.'' Presentation at Evolution, Games, and Learning, Center for Nonlinear Studies, [[Los Alamos National Laboratory]], May 21.
* [[Richard Korf]] ('''1987'''). ''Planning as Search: A Quantitative Approach.'' [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 33, pp. 65-88.
* [[David Wilkins]] ('''1988'''). ''Practical Planning: Extending the Classical AI Planning Paradigm''. (Morgan Kaufmann Series in Representation and Reasoning), [http://www.amazon.com/ref=gno_logo amazon]
* [[Bruce Abramson]] ('''1989'''). ''Control Strategies for Two-Player Games.'' [[ACM#Surveys|ACM Computing Surveys]], Vol. 21, No. 2
* [[Reiner Seidel]] ('''1989'''). ''A Model of Chess Knowledge - Planning Structures and Constituent Analysis''. [[Advances in Computer Chess 5]]
==1990 ...==
* [[David Wilkins]] ('''1991'''). ''Working notes on paradise chess patterns''. Technical Note 509, AI Center, SRI International, 333 Ravenswood Ave., Menlo Park, CA 94025
* [[Jens Christensen]], [http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/g/Grove:Adam_J=.html Adam Grove] ('''1991'''). ''A Formal Model Classical Planning''. [http://dblp.uni-trier.de/db/conf/ijcai/ijcai91.html#ChristensenG91 IJCAI-91], [http://ijcai.org/Past%20Proceedings/IJCAI-91-VOL1/PDF/039.pdf pdf]
* [[Jens Christensen]] ('''1991'''). ''[http://naca.larc.nasa.gov/search.jsp?R=19970034976&qs=N%3D4294129240%2B4294374694 Automatic Abstraction in Planning]''. Ph.D. thesis, [[Stanford University]]
* [[Steven Walczak]] ('''1992'''). ''Pattern-Based Tactical Planning''. [http://www.informatik.uni-trier.de/~ley/db/journals/ijprai/ijprai6.html#Walczak92 IJPRAI], Vol. 6, No. 5
* [[Stephen J.J. Smith]], [[Dana Nau|Dana S. Nau]], [[Thomas A. Throop]] ('''1992'''). ''[http://dl.acm.org/citation.cfm?id=139657 A hierarchical approach to strategic planning with non-cooperating agents under conditions of uncertainty]''. Proceedings of the First International Conference on AI Planning Systems
* [[Stephen J.J. Smith]], [[Dana Nau|Dana S. Nau]] ('''1993'''). ''[http://dl.acm.org/citation.cfm?id=171355&coll=DL&dl=GUIDE&CFID=403943247&CFTOKEN=26458653 Strategic planning for imperfect-information games]''. Technical Report, [https://en.wikipedia.org/wiki/University_of_Maryland,_College_Park University of Maryland, College Park]
* [[Mikhail Botvinnik]], [[Evgeniĭ Dmitrievich Cherevik]], [[Vasily Vladimirov]], [[Vitaly Vygodsky]] ('''1994'''). ''[https://getinfo.de/app/Solving-Shannon-s-Problem-Ways-and-Means/id/BLCP%3ACN011979464 Solving Shannon's Problem: Ways and Means]''. [[Advances in Computer Chess 7]] » [[CC Sapiens]]
* [[Andreas L. Opdahl]], [[Bjornar Tessem]] ('''1994'''). ''Long-Term Planning in Computer Chess''. [[Advances in Computer Chess 7]]
==1995 ...==
* [[Stephen J.J. Smith]], [[Dana Nau|Dana S. Nau]], [[Thomas A. Throop]] ('''1996'''). ''Total-Order Multi-Agent Task-Network Planning for Contract Bridge''. [[AAAI|AAAI 1996]]
* [https://en.wikipedia.org/wiki/Henry_Kautz Henry Kautz], [[Bart Selman]] ('''1996'''). ''Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search''. [[AAAI|AAAI 1996]], [http://www.cs.cornell.edu/selman/papers/pdf/plan.pdf pdf]
* [[Chrilly Donninger]] ('''1996'''). ''CHE: A Graphical Language for Expressing Chess Knowledge''. [[ICGA Journal#19_4|ICCA Journal, Vol. 19, No. 4]]
* [[Jan van Reek]] ('''1997'''). ''Strategy in Chess''. Schachfirma Fruth, Unterhaching, ISBN 3-9804896-9-8
* [[Jan van Reek]], [[Jos Uiterwijk]], [[Jaap van den Herik]] ('''1998'''). ''Planning a Strategy in Chess''. [[ICGA Journal#21_3|ICCA Journal, Vol. 21, No. 3]]
* [[Stephen J.J. Smith]], [[Dana Nau|Dana S. Nau]], [[Thomas A. Throop]] ('''1998'''). ''Computer Bridge: A Big Win for AI Planning''. AI Magazine, Vol. 19, No. 2
* [[Ian Frank]] ('''1998'''). ''[http://www.goodreads.com/book/show/7998822-search-and-planning-under-incomplete-information Search and Planning Under Incomplete Information: A Study Using Bridge Card Play]''. [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer], Ph.D. thesis, [[University of Edinburgh]]
==2000 ...==
* [[Mark Brockington]] ('''2000'''). ''Computer Chess Meets Planning''. [[ICGA Journal#23_2|ICGA Journal, Vol. 23, No. 2]]
* [[Alex B. Meijer]], [[Henk Koppelaar]] ('''2001'''). ''[http://www.kbs.twi.tudelft.nl/Publications/Conference/2001/2001-MeijerKoppelaar-BNAIC01.html Pursuing abstract goals in the game of Go]''. [http://hcs.science.uva.nl/bnaic01/ BNAIC 2001]
* [[Adi Botea]] ('''2002'''). ''Using Abstraction for Heuristic Search and Planning''. Research Summary. In Proceedings of the 5th International Symposium on Abstraction, Reformulation, and Approximation SARA-02, volume 2371 of Lecture Notes in Artificial Intelligence, 326-327, Kananaskis, AB, Canada.
* [[Ari Shapiro]], [[Gil Fuchs]], [[Robert Levinson]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_4 Learning a Game Strategy Using Pattern-Weights and Self-play]''. [[CG 2002]]
* [[Adi Botea]], [[Martin Müller]], [[Jonathan Schaeffer]] ('''2002'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-40031-8_24 Using Abstraction for Planning in Sokoban]''. [[CG 2002]]
* [[Joelle Pineau]] ('''2004'''). ''Tractable Planning Under Uncertainty: Exploiting Structure''. Ph.D. thesis, [[Carnegie Mellon University]], [http://www.cs.mcgill.ca/~jpineau/files/jpineau-thesis.pdf pdf]
==2005 ...==
* [[Adi Botea]], [[Markus Enzenberger]], [[Martin Müller]], [[Jonathan Schaeffer]] ('''2005'''). ''Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators''. Journal of Artificial Intelligence Research 24 (2005) 581-621, [http://www.jair.org/media/1696/live-1696-2537-jair.pdf pdf]
* [http://www.lsi.upc.edu/~alquezar/ René Alquézar], A. Gonzalez Camargo, [[Alejandro González Romero]] ('''2006'''). ''[http://portal.acm.org/citation.cfm?id=1166904 Evolving Plans for the KRKa2 Chess Ending]''. Artificial Intelligence and Applications 2006
* [[Adi Botea]] ('''2006'''). ''Improving AI Planning and Search with Automatic Abstraction''. PhD Thesis, [[University of Alberta]], [http://abotea.rsise.anu.edu.au/data/thesis.pdf pdf]
* [[Levente Kocsis]], [[Csaba Szepesvári]] ('''2006'''). ''[http://www.computer-go.info/resources/bandit.html Bandit based Monte-Carlo Planning]'' ECML-06, LNCS/LNAI 4212, pp. 282-293. introducing [[UCT]], [http://www.sztaki.hu/%7Eszcsaba/papers/ecml06.pdf pdf]
* [[Frantisek Sailer]], [[Michael Buro]], [[Marc Lanctot]] ('''2007'''). ''Adversarial planning through strategy simulation''. [[IEEE#CIG|Computational Intelligence and Games]], [https://skatgame.net/mburo/ps/rtsmc.pdf pdf]
* [[Zvi Retchkiman Königsberg]] ('''2007'''). ''A Combinatorial Game Mathematical Strategy Planning Procedure for a Class of Chess Endgames''. [http://www.m-hikari.com/imf-password2007/65-68-2007/index.html International Mathematical Forum, Vol. 2, No. 68]
* [[Sylvain Gelly]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Olivier Teytaud]], [http://fr.linkedin.com/pub/yann-kalemkarian/7/7aa/716 Yann Kalemkarian] ('''2008'''). ''The Parallelization of Monte-Carlo Planning - Parallelization of MC-Planning''. ICINCO-ICSO 2008: 244-249, [http://hal.archives-ouvertes.fr/docs/00/28/78/67/PDF/icin08.pdf pdf], [http://www.lri.fr/~teytaud/UCTpara.pdf slides as pdf]
* [[Akihiro Kishimoto]], [[Alex Fukunaga]], [[Adi Botea]] ('''2009'''). ''Scalable, Parallel Best-First Search for Optimal Sequential Planning''. In Proceedings of the [http://icaps09.uom.gr/ 19th International Conference on Automated Planning and Scheduling] (ICAPS-2009) (Best Paper Award), pages 201-208, [http://abotea.rsise.anu.edu.au/data/kishimoto-etal-icaps09.pdf pdf]
* [[Gerhard Trippen]] ('''2009'''). ''Plans, Patterns and Move Categories Guiding a Highly Selective Search''. [[Advances in Computer Games 12]], [http://arimaa.com/arimaa/papers/0905Trippen/Contribution118.pdf pdf]
==2010 ...==
* [[Raghuram Ramanujan]], [[Ashish Sabharwal]], [[Bart Selman]] ('''2010'''). ''[http://www.aaai.org/ocs/index.php/ICAPS/ICAPS10/paper/view/1458 On Adversarial Search Spaces and Sampling-Based Planning]''. [http://www.aaai.org/Press/Proceedings/icaps10.php ICAPS 2010]
* [[Raghuram Ramanujan]], [[Bart Selman]] ('''2011'''). ''[http://aaai.org/ocs/index.php/ICAPS/ICAPS11/paper/view/2708 Trade-Offs in Sampling-Based Adversarial Planning]''. [http://www.aaai.org/Press/Proceedings/icaps11.php ICAPS 2011], [http://videolectures.net/raghuram_ramanujan/ best paper], [http://videolectures.net/icaps2011_ramanujan_sampling/ VideoLecture] » [[UCT]]
* [[Stefano Cianciulli]], [[Stavros Vassos]] ('''2013'''). ''Planning for Interactive Storytelling Processes''. [http://icaps13.icaps-conference.org/technical-program/workshop-program/planning-in-games/ ICAPS-2013], [http://stavros.lostre.org/files/CianciulliVassos2013Jaco.pdf pdf]
* [[Arthur Guez]], [[David Silver]], [[Peter Dayan]] ('''2014'''). ''Better Optimism By Bayes: Adaptive Planning with Rich Models''. [https://arxiv.org/abs/1402.1958 arXiv:1402.1958v1]
* [[Arthur Guez]], [[Nicolas Heess]], [[David Silver]], [[Peter Dayan]] ('''2014'''). ''Bayes-Adaptive Simulation-based Search with Value Function Approximation''. [https://papers.nips.cc/book/advances-in-neural-information-processing-systems-27-2014 NIPS 2014], [https://papers.nips.cc/paper/5501-bayes-adaptive-simulation-based-search-with-value-function-approximation.pdf pdf]
==2015 ...==
* [[Arthur Guez]] ('''2015'''). ''Sample-based Search Methods for Bayes-Adaptive Planning''. Ph.D. Thesis, Gatsby Computational Neuroscience Unit, [https://en.wikipedia.org/wiki/University_College_London University College London], [http://www.gatsby.ucl.ac.uk/~aguez/files/guez_phdthesis2015.pdf pdf]
=Forum Posts=
* [https://www.stmintz.com/ccc/index.php?id=347144 Implementing Planning in an Engine] by [[Tom Likens]], [[CCC]], February 04, 2004
* [https://www.stmintz.com/ccc/index.php?id=348682 Possible definition of planning] by [[Charles Roberson]], [[CCC]], February 12, 2004
=External Links=
* [https://en.wikipedia.org/wiki/Planning Planning from Wikipedia]
* [https://en.wikipedia.org/wiki/Plan_%28disambiguation%29 Plan (disambiguation) from Wikipedia]
* [https://en.wikipedia.org/wiki/State_space_planning State space planning from Wikipedia]
* [https://en.wikipedia.org/wiki/Strategic_planning Strategic planning from Wikipedia]
* [https://en.wikipedia.org/wiki/Plan Plan from Wikipedia]
* [https://en.wikipedia.org/wiki/Automated_planning_and_scheduling Automated planning and scheduling from Wikipedia]
* [https://en.wikipedia.org/wiki/Planning_fallacy Planning fallacy from Wikipedia]
* [https://en.wikipedia.org/wiki/Forecasting Forecasting from Wikipedia]
* [https://en.wikipedia.org/wiki/Prediction Prediction from Wikipedia]
* [http://www.chess-insights.com/how-to-plan-in-chess.html Discover How To Plan In Chess]
* [http://www.chessplans.com/ Chess Plans - Home]
* [http://www.chess.com/article/view/planning-in-chess Planning in Chess] by [https://en.wikipedia.org/wiki/Natalia_Pogonina Natalia Pogonina], [http://www.chess.com/ Chess.com], June 21, 2010
* [http://opsound.org/artist/bigbonobotheinternationalbigbono/ Bigbonobo Combo] - Whitecube plan, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=ttOGPYZWtuQ|alignment=left|valignment=top}}
=References=
<references />
'''[[Knowledge|Up one Level]]'''
