25,161
edits
Changes
Created page with "'''Home * Knowledge''' FILE:Knowledgeable.jpg|border|right|thumb|link=http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574..."
'''[[Main Page|Home]] * Knowledge'''
[[FILE:Knowledgeable.jpg|border|right|thumb|link=http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bc6|[[Arts#Bak|Samuel Bak]] - Knowledgeable <ref>[http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bc6 Chess in the Art of Samuel Bak], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [https://en.wikipedia.org/wiki/University_of_Minnesota University of Minnesota]</ref> ]]
'''Knowledge''' is the possession of information, its acquisition involves complex [[Cognition|cognitive]] processes: [https://en.wikipedia.org/wiki/Perception perception], [[Learning|learning]], [https://en.wikipedia.org/wiki/Communication communication], [https://en.wikipedia.org/wiki/Association association] and [https://en.wikipedia.org/wiki/Reasoning reasoning].
Inside a chess program, knowledge is manifested either as [https://en.wikipedia.org/wiki/Procedural_knowledge procedural] or as [https://en.wikipedia.org/wiki/Declarative_knowledge declarative knowledge]. The declarative [https://en.wikipedia.org/wiki/A_priori_and_a_posteriori a priori] knowledge about the [[Rules of Chess|rules of chess]] is immanent inside the [[Move Generation|move generator]] in conjunction with [[Check|check]] detection. Further declarative knowledge is coded as [https://en.wikipedia.org/wiki/Rule_of_thumb rules of thumb] of the [[Evaluation|evaluation]] function, as well as persistent perfect knowledge from [[Retrograde Analysis|retrograde analysis]], or as [https://en.wikipedia.org/wiki/Empirical empirical] knowledge mostly from human [https://en.wikipedia.org/wiki/Experience experience], to retrieve [[Moves|moves]] from an hand crafted [[Opening Book|opening book]]. Procedural knowledge is applied by [[Learning]], as well to backup declarative knowledge by [[Search]]. However, the Search versus Knowledge trade-off in computer chess and games refers heuristic or perfect knowledge.
<span id="SearchversusKnowledge"></span>
=Search versus Knowledge=
The trade-offs of [[Search|search]] versus Knowledge <ref>[[Jonathan Schaeffer]] ('''1997'''). [http://www.cs.ualberta.ca/%7Ejonathan/OJA/oja.html One Jump Ahead] ''Challenging Human Supremacy in Checkers'', Springer, ISBN 0-387-94930-5, Prelude to Disaster, pp. 255-256 or pp. 249-250 in the [http://www.springer.com/computer/artificial/book/978-0-387-76575-4 Second Edition, 2009]</ref>
{|
|- style="vertical-align:top;"
| [[FILE:KnowledeSearch.JPG|none|border|text-bottom]]
| Curves A and B represent a fixed performance level, say 2000 for B and 2200 for A. The curves indicate that there are many ways to archive that level of performance, either by little knowledge and lot of search, or vice versa. If a program has archived point P on curve B, it may improve between search only (point S) or knowledge only (point K).
|}
<span id="InPractice"></span>
==In Practice==
[[Andreas Junghanns]] and [[Jonathan Schaeffer]] in ''Search versus knowledge in game-playing programs revisited'' <ref>[[Andreas Junghanns]], [[Jonathan Schaeffer]] ('''1997'''). ''Search versus knowledge in game-playing programs revisited''. [[Conferences#IJCAI1997|IJCAI-97]], Vol 1, [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.168&rep=rep1&type=pdf pdf], 3 Search Versus Knowledge: Practise</ref>:
The difficulty lies in quantifying the knowledge axis. Perfect knowledge assumes an [[Oracle|oracle]], which for most games we do not have. However, we can approximate an oracle by using a high-quality, game playing program that performs deep searches. Although not perfect, it is the best approximation available. Using this, how can we measure the quality of knowledge in the program?
A heuristic evaluation function, as judged by an oracle, can be viewed as a combination of two things: oracle knowledge and noise. The oracle knowledge is beneficial and improves the program' s play. The noise, on the other hand, represents the inaccuracies in the program' s knowledge. It can be introduced by several things, including knowledge that is missing, over- or under-valued, and/or irrelevant. As the noise level increase, the beneficial contribution of the knowledge is overshadowed.
By definition, an oracle has no noise. We can measure the quality of the heuristic evaluation in a program by the amount of noise that is added into it. To measure this, we add a [[Pseudorandom Number Generator|random number]] to each [[Search with Random Leaf Values|leaf node evaluation]] ...
==HiTech versus LoTech==
At the [[Advances in Computer Chess 5]] conference 1987, [[Hans Berliner]] et al. introduced an interesting experiment. [[HiTech]] with a sophisticated evaluation competed versus LoTech, almost the same program but a rudimentary evaluation, at different [[Depth|search depths]] <ref>[[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1989'''). ''Measuring the Performance Potential of Chess Programs'', [[Advances in Computer Chess 5]]</ref>. According to [[Peter Kouwenhoven]] <ref>[[Peter Kouwenhoven]] ('''1987'''). ''Advances in Computer Chess, The 5th Triennial Conference''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]] (report)</ref>, Berliner's conclusion was that more was to be won by increasing HiTech's knowledge at constant speed rather than further increasing its speed while keeping knowledge constant. The abstract from the extended 1990 paper <ref>[[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1990'''). ''[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TYF-47WTT8W-3J&_user=10&_coverDate=04%2F30%2F1990&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1541914346&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=a43185e00b7d7d4550af0add28ff36b8&searchtype=a Measuring the Performance Potential of Chess Programs].'' Artificial Intelligence, Vol. 43, No. 1</ref>:
Chess programs can differ in depth of search or in the evaluation function applied to leaf nodes or both. Over the past 10 years, the notion that the principal way to [[Playing Strength|strengthen]] a chess program is to improve its depth of search has held sway. Improving depth of search undoubtedly does improve a program's strength. However, projections of potential gain have time and again been found to overestimate the actual gain.
We examine the notion that it is possible to project the playing strength of chess programs by having different versions of the same program (differing only in depth of search) play each other. Our data indicates that once a depth of “tactical sufficiency” is reached, a knowledgeable program can beat a significantly less knowledgeable one almost all of the time when both are searching to the same depth. This suggests that once a certain knowledge gap has been opened up, it cannot be overcome by small increments in searching depth. The conclusion from this work is that extending the depth of search without increasing the present level of knowledge will not in any foreseeable time lead to World Championship level chess. The approach of increasing knowledge has been taken in the HiTech chess machine.
==Ed Schröder's Conclusion==
[[Ed Schroder|Ed Schröder]] concluded HiTech's extra knowledge was just worth one [[Ply|ply]] in the computer-computer area <ref>[http://www.rebel.nl/ches2010.htm Chess in 2010] by [[Ed Schroder|Ed Schröder]], The Berliner Experiment</ref><ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/e917da2d88146756 The end of computer chess progress?] by [[Ed Schroder|Ed Schröder]], [[Computer Chess Forums|rgcc]], March 06, 1999</ref>, and further elaborated on [[Tactics|tactical]] evaluation knowledge helpful in early [[Rebel]] searching 5-7 plies versus Rebel searching 13-15 plies on 2001 hardware <ref>[https://www.stmintz.com/ccc/index.php?id=198940 Re: Intelligent software, please] by [[Ed Schroder|Ed Schröder]], [[CCC]], November 26, 2001</ref> <ref>[http://www.schach-computer.info/wiki/index.php/Schr%C3%B6der,_Ed Schröder, Ed] (German) from [http://www.schach-computer.info/wiki/index.php/Hauptseite_En Schachcomputer.info - Wiki] also refers the post by [[Ed Schroder|Ed Schröder]]</ref>:
Some specific chess knowledge through the years become out-dated due to the speed of nowadays computers. An example: In the early days of computer chess, say the period 1985-1989 I as hardware had a [[6502]] running at 5 Mhz. [[Rebel]] at that time could only search 5-7 plies on tournament time control. Such a low depth guarantees you one thing: [[Horizon Effect|horizon effects]] all over, thus losing the game.
To escape from the horizon effect all kind of tricks were invented, chess knowledge about dangerous [[Pin|pins]], [[Knight Pattern#KnightForks|knight forks]], [[Double Attack|double attacks]], [[Overloading|overloading of pieces]] and reward those aspects in [[Evaluation|eval]]. Complicated and processor time consuming software it was (15-20% less performance) but it did the trick escaping from the horizon effect in a reasonable way.
Today we run chess program on 1500 Mhz machines and instead of the 5-7 plies Rebel now gets 13-15 plies in the middle game and the horizon effect which was a major problem at 5 Mhz slowly was fading away.
So I wondered, what if I throw that complicated "anti-horizon" code out of Rebel, is it still needed? So I tried and found out that Rebel played as good with the "anti-horizon" code as without the code. In other words, the net gain was a "free" speed gain of 15-20%, thus an improvement.
One aspect of chess programming is that your program is in a constant state of change due to the state of art of nowadays available hardware. I am sure a Rebel at 10 Ghz several parts of Rebel need a face-lift to get the maximum out of the new speed monster.
<span id="SearchVersusEvaluation"></span>
==Search versus Evaluation==
[[Mark Uniacke]] in a reply to [[Ed Schroder|Ed Schröder]], on [[Search]] or [[Evaluation]], mentioning the [[1st Computer Olympiad#Chess|1st Computer Olympiad]], [[Null Move Pruning]], [[Hiarcs]], [[Woodpusher]], [[E6P]], [[Rebel]], [[Fritz]] ... <ref>[http://www.hiarcs.net/forums/viewtopic.php?p=2944 Re: Search or Evaluation?] by [[Mark Uniacke]], [[Computer Chess Forums|Hiarcs Forum]], October 14, 2007</ref>:
I am not saying search is the only reason but that search is more significant in the Elo jump than other factors. Thanks for the interesting history which in general I agree with but I should add for clarification...
In 1989 I was exposed to the [[Null Move|null move]] in [[Hiarcs|HIARCS']] first official computer tournament at the [[1st Computer Olympiad|Olympiad]] in London. [[John Hamlen]] had written his program [[Woodpusher]] as part of his M.Sc project investigating the null move exclamation and although Woodpusher did not do well in that tournament I had the good fortune to discuss null move with John and reading his project which interested me very much. John and I had many discussions on computer chess over the following months.
That Olympiad probably had an impact on you too and not only because [[Rebel]] won Gold above [[Mephisto Portorose|Mephisto X]] and [[Fidelity|Fidelity X]] for the first time but because there was a program there running quite fast (at that time in history) called [[E6P]] (so named because it could reach 6 ply full width!) running on an Acorn [[ARM2|ARM]] [[Acorn Archimedes|based machine]]. [[Jan Louwman|Jan]] was operating Rebel at the tournament as you know and I noticed Jan take a keen interest in this new machine.
[[Frans Morsch|Frans]] was using null move in [[Fritz|Fritz 2]] in [[WCCC 1992|Madrid 1992]] (I am not sure about Fritz 1). I am sure you remember that tournament fondly. I remember at Madrid having a discussion with a few programmers including [[Richard Lang|Richard]] about what on earth was Fritz 2 doing to reach the [[Depth|depths]] it was attaining, this seed of interest made me investigate search enhancements carefully after Madrid and it was then that I began re-investigating the null move. It was not long before HIARCS began using null moves too and by Christmas 1992 I had a working implementation which gave a big jump over Hiarcs 1 which had only been released shortly before. I had much fun playing my Hiarcs 1.n against [[Mephisto RISC|Mephisto Risc 1]] in late 1992, early 1993 and that sort of closes the circle on the E6P story. Even so, the null move idea still evolved and my implementation today is much better than it was initially and so it can be for other ideas. We can all profit from these techniques but some gain more than others if they find new ways to exploit it.
Rebel 7/8/9 and Hiarcs 5/6/7 battled hard in those years and my big jump to the top of the rating lists happened partly because of a search change to Hiarcs 5/6 which led at one stage to a 71 Elo lead on the SSDF. I recall Rebel and Hiarcs exchanging the lead on the [[SSDF]] list a number of times in those years. So we agree the impact search has made on computer chess progress is clear. Now we diverge on what might be the reason for new progress in the field.
Clearly we have good search enhancements on [[Node Types#CUT|cut nodes]] and [[Node Types#ALL|all nodes]], but that does not mean they cannot be improved and enhanced or in fact that another technique might prove to be superior or complementary. Meanwhile there can be no doubt that progress is made positionally irrespective of search but I do not believe it can be the reason for a breakthrough jump in chess strength but rather a steady climb.
But wait!
Maybe there is a middle way, a third avenue of improvement which sort of falls between the two pillars of search and evaluation and that is search intelligence. Something both of us have practiced in our programs for years but maybe not properly exploited. The ability of the eval to have a more significant impact on the search than traditionally has been the case. I think this area has been relatively unexplored and offers interesting potential.
=Knowing=
* [[Chunking]]
* [[Cognition]]
* [[Learning]]
* [[Pattern Recognition]]
* [[Planning]]
<span id="DeclarativeKnowledge"></span>
=Declarative Knowledge=
==A Priori==
* [[Rules of Chess]]
* [[Move Generation]]
* [[Check|In Check]]
==Heuristic Knowledge==
* [[Evaluation]]
* [[Move Ordering]]
* [[Selectivity]]
==Empirical Knowledge==
* [[Automated Tuning]]
* [[Opening Book]]
<span id="PerfectKnowledge"></span>
==Perfect Knowledge==
Perfect Knowledge usually incorporates [[Retrograde Analysis|analysis]] or stored results from exhaustive search, which requires no further search at [[Interior Node|interior nodes]] except the [[Root|root]]. An [[Oracle|oracle]] might be considered as "perfect" [[Evaluation|evaluation]].
* [[Oracle]]
* [[Retrograde Analysis]]
<span id="InteriorNodeRecognizers"></span>
===Interior Node Recognizer===
* [[Interior Node Recognizer]]
===Endgame Databases===
as probed inside a Recognizer framework, if a certain material constellation is detected.
* [[Endgame Tablebases]]
* [[Endgame Bitbases]]
=Procedural Knowledge=
* [[Search]]
* [[Checkmate]]
* [[Stalemate]]
* [[Fifty-move Rule]]
* [[Repetitions]]
=See also=
* [[Artificial Intelligence]]
* [[Depth#DiminishingReturns|Diminishing Returns]]
* [[Memory]]
* [[Opponent Model Search]]
* [[Psychology]]
* [[Strategy]]
* [[Tactics]]
=Publications=
==1970 ...==
* [[Marvin Minsky]] ('''1974'''). ''[http://web.media.mit.edu/~minsky/papers/Frames/frames.html Framework for Representing Knowledge 1974]''. [[Massachusetts Institute of Technology|MIT]]-AI Laboratory Memo 306
* [[Coen Zuidema]] ('''1974'''). ''Chess: How to Program the Exceptions?'' Technical Report IW21/74, [https://en.wikipedia.org/wiki/Centrum_Wiskunde_%26_Informatica Mathematical Center Amdsterdam]. [http://oai.cwi.nl/oai/asset/9480/9480A.pdf pdf]
==1975 ...==
* [[Donald Michie]] ('''1976'''). ''An Advice-Taking System for Computer Chess.'' Computer Bulletin, Ser. 2, Vol. 10, pp. 12-14. ISSN 0010-4531.
* [[Jack Good]] ('''1977'''). ''Dynamic Probability, Computer Chess, and the Measurement of Knowledge.'' Machine Intelligence, Vol. 8 (eds. E. Elcock and [[Donald Michie]]), pp. 139-150. Ellis Horwood, Chichester.
* [[Ivan Bratko]], [[Danny Kopec]], [[Donald Michie]] ('''1978'''). ''Pattern-Based Representation of Chess Endgame Knowledge''. [http://comjnl.oxfordjournals.org/content/21/2.toc The Computer Journal, Vol. 21, No. 2], pp. 149-153. [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_44_C.pdf pdf]
* [[Donald Michie]], [[Ivan Bratko]] ('''1978'''). ''Advice Table Representations of Chess End-Game Knowledge''. Proceedings 3rd AISB/GI Conference, pp. 194-200.
* [[David Wilkins]] ('''1979'''). ''Using Patterns and Plans to Solve Problems and Control Search''. Ph.D. thesis, Computer Science Dept, [[Stanford University]], AI Lab Memo AIM-329
* [[Max Bramer]], [[Mike Clarke]] ('''1979'''). ''[http://www.sciencedirect.com/science/article/pii/S0020737379800139 A Model for the Representation of Pattern-Knowledge for the Endgame in Chess]''. [http://www.interaction-design.org/references/periodicals/international_journal_of_man-machine_studies_volume_11.html International Journal of Man-Machine Studies, Vol. 11, No.5]
==1980 ...==
* [[Ivan Bratko]], [[Donald Michie]] ('''1980'''). ''A Representation of Pattern-Knowledge in Chess Endgames''. [[Advances in Computer Chess 2]]
* [[David Wilkins]] ('''1980'''). ''Using patterns and plans in chess''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], vol. 14, pp. 165-203. Reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[David Wilkins]] ('''1982'''). ''Using Knowledge to Control Tree Searching''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], vol. 18, pp. 1-51.
* [[Alen Shapiro]], [[Tim Niblett]] ('''1982'''). ''Automatic Induction of Classification Rules for Chess End game.'' [[Advances in Computer Chess 3]]
* [[Hans Berliner]] ('''1982'''). ''Search vs. knowledge: an analysis from the domain of games''. Technical Report Department of Computer Science, [[Carnegie Mellon University]]
* [[Allen Newell]] ('''1982'''). ''The Knowledge Level''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 18, No. 1
* [[Raymond Smullyan]] ('''1982'''). ''[http://www.mit.edu/people/dpolicar/writing/prose/text/epistemologicalNightmare.html An Epistemological Nightmare]''. [[Massachusetts Institute of Technology|MIT]]
* [[David Wilkins]] ('''1983'''). ''Using chess knowledge to reduce search''. In [[Chess Skill in Man and Machine]] ([[Peter W. Frey]], ed.), Ch. 10, 2nd Edition, Springer-Verlag.
* [[Danny Kopec]] ('''1983'''). ''Human and Machine Representations of Knowledge''. Ph.D. thesis, [[University of Edinburgh]], supervisor: [[Donald Michie]]
* [[Alen Shapiro]] ('''1983'''). ''The Role of Structured Induction in Expert Systems''. [[University of Edinburgh]], Machine Intelligence Research Unit (Ph.D. thesis) <ref>[http://archive.ics.uci.edu/ml/datasets/Chess+%28King-Rook+vs.+King-Pawn%29 UCI Machine Learning Repository: Chess (King-Rook vs. King-Pawn) Data Set]</ref>
* [[Jonathan Schaeffer]] ('''1984'''). ''The Relative Importance of Knowledge''. [[ICGA Journal#7_3|ICCA Journal, Vol. 7, No. 3]]
* [[Albrecht Heeffer]] ('''1984'''). ''Automated Acquisition on Concepts for the Description of Middle-game Positions in Chess''. [https://en.wikipedia.org/wiki/Turing_Institute Turing Institute], [https://en.wikipedia.org/wiki/Glasgow Glasgow], [https://en.wikipedia.org/wiki/Scotland Scotland], TIRM-84-005
==1985 ...==
* [[Albrecht Heeffer]] ('''1985'''). ''Validating Concepts from Automated Acquisition Systems''. [[Conferences#IJCAI|IJCAI 85]], [http://ijcai.org/Past%20Proceedings/IJCAI-85-VOL1/PDF/118.pdf pdf]
* [[Reiner Seidel]] ('''1985'''). ''Grammatical Description of Chess Positions, Data-Base versus Human Knowledge''. [[ICGA Journal#8_3|ICCA Journal, Vol. 8, No. 3]]
* [[Jonathan Schaeffer]], [[Tony Marsland]] ('''1985'''). ''The Utility of Expert Knowledge''. Proceedings [http://www.informatik.uni-trier.de/%7Eley/db/conf/ijcai/ijcai85.html IJCAI 85], pp. 585-587. Los Angeles.
* [[Alen Shapiro]], [[Donald Michie]] ('''1986'''). ''A Self-commenting Facility for Inductively Synthesised Endgame Expertise''. [[Advances in Computer Chess 4]]
* [[Bernd Owsnicki-Klewe|Bernd Owsnicki]], [[Kai von Luck]] ('''1986'''). ''N.N.: A Case Study in Chess Knowledge Representation''. [[Advances in Computer Chess 4]]
* [[Jonathan Schaeffer]] ('''1986'''). ''Experiments in Search and Knowledge''. Ph.D. Thesis, [[University of Waterloo]]. Reprinted as Technical Report TR 86-12, Department of Computing Science, [[University of Alberta]], Edmonton, Alberta.
* [[Peter W. Frey]] ('''1986'''). ''Fuzzy Production Rules in Chess''. [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]]
* [[Peter W. Frey]] ('''1986'''). ''[https://archive.org/stream/byte-magazine-1986-11/1986_11_BYTE_11-12_Knowledge_Representation#page/n175/mode/2up A Bit-Mapped Classifier]''. [[Byte Magazine#BYTE1112|BYTE, Vol. 11, No. 12]], pp. 161-172.
* [https://en.wikipedia.org/wiki/Subhash_Kak Subhash Kak] ('''1987'''). ''Patanjali and Cognitive Science''. [http://www.vitastapublishing.com/ Vitasta Publishing] <ref>[https://en.wikipedia.org/wiki/Patanjali Patanjali from Wikipedia]</ref>
* [[Alen Shapiro]] ('''1987'''). ''Structured Induction in Expert Systems''. Turing Institute Press in association with Addison-Wesley Publishing Company, Workingham, UK. ISBN 0-201-178133. [http://www.amazon.com/exec/obidos/ASIN/0201178133/acmorg-20 amazon]<ref>[[Dap Hartmann]] ('''1988'''). [[Alen Shapiro|Alen D. Shapiro]]: ''Structured Induction in Expert Systems''. [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]]</ref>
* [[Stephen Muggleton]] ('''1988'''). ''Inductive Acquisition of Chess Strategies''. [http://www.doc.ic.ac.uk/%7Eshm/MI/mi11.html Machine Intelligence 11] (eds. [[Jean Hayes Michie]], [[Donald Michie]], and J. Richards), pp. 375-389. Clarendon Press, Oxford, U.K. ISBN 0-19-853718-2.
* [[Reiner Seidel]]('''1989'''). ''A Model of Chess Knowledge - Planning Structures and Constituent Analysis''. [[Advances in Computer Chess 5]]
* [[Hans Berliner]], [[Carl Ebeling]] ('''1989'''). ''Pattern Knowledge and Search: The SUPREM Architecture.'' Artificial Intelligence, Vol. 38, No. 2, pp. 161-198. ISSN 0004-3702.
: Revised as [[Hans Berliner]], [[Carl Ebeling]] ('''1990'''). ''Hitech''. [[Computers, Chess, and Cognition]]
* [[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1989'''). ''Measuring the Performance Potential of Chess Programs,'' [[Advances in Computer Chess 5]]
* [[Hermann Kaindl]] ('''1989'''). ''Towards a Theory of Knowledge''. [[Advances in Computer Chess 5]]
==1990 ...==
* [[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1990'''). ''[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TYF-47WTT8W-3J&_user=10&_coverDate=04%2F30%2F1990&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1541914346&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=a43185e00b7d7d4550af0add28ff36b8&searchtype=a Measuring the Performance Potential of Chess Programs].'' Artificial Intelligence, Vol. 43, No. 1
* [[Kiyoshi Shirayanagi]] ('''1990'''). ''Knowledge Representation and its Refinement in Go Programs''. [[Computers, Chess, and Cognition]]
* [[Robert Levinson]], [[Feng-hsiung Hsu]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[David Wilkins]] ('''1991'''). ''The Role of Chess in Artificial Intelligence Research''. [http://dli.iiit.ac.in/ijcai/IJCAI-91-VOL1/CONTENT/content.htm IJCAI 1991], [http://dli.iiit.ac.in/ijcai/IJCAI-91-VOL1/PDF/084.pdf pdf], also in [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]], [http://www.ai.sri.com/%7Ewilkins/papers/chess-panel.pdf pdf]
* [[Christian Posthoff]], [[Michael Schlosser]], [[Jens Zeidler]] ('''1993'''). ''Search vs. Knowledge? - Search and Knowledge!'' In: Proc. 3rd KADS Meeting, Munich, March 8-9 1993, Siemens AG, Corporate Research and Development, 305-326, 1993.
* [[Steven Walczak]], [http://www.cise.ufl.edu/~ddd/ Douglas D. Dankel II] ('''1993'''). ''Acquiring Tactical and Strategic Knowledge with a Generalized Method for Chunking of Game Pieces''. International Journal of Intelligent Systems 8 (2), 249-270.
* [[Christian Posthoff]], [[Michael Schlosser]], [[Rainer Staudte]], [[Jens Zeidler]] ('''1994'''). ''Transformations of Knowledge''. [[Advances in Computer Chess 7]]
* [[Robert Levinson]], [[Gil Fuchs]] ('''1994'''). ''A Pattern-Weight Formulation of Search Knowledge''. UCSC-CRL-94-10, [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.1027 CiteSeerX]
==1995 ...==
* [[Richard Fikes]] ('''1996'''). ''Ontologies: What Are They, and Where's The Research?'' [http://www.informatik.uni-trier.de/~ley/db/conf/kr/kr96.html#Fikes96 KR 1996]
* [[Andreas Junghanns]], [[Jonathan Schaeffer]] ('''1997'''). ''Search versus knowledge in game-playing programs revisited''. [[Conferences#IJCAI1997|IJCAI-97]], Vol 1, [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.168&rep=rep1&type=pdf pdf]
* [[Johannes Fürnkranz]] ('''1997'''). ''Knowledge Discovery in Chess Databases: A Research Proposal.'' Technical Report OEFAI-TR-97-33, Austrian Research Institute for Artificial Intelligence, [http://www.ke.informatik.tu-darmstadt.de/%7Ejuffi/publications/chess-ws.ps.gz zipped ps], [http://www.top-5000.nl/ps/Knowledge%20discovery%20in%20chess%20databases%20-%20a%20research%20proposal.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Knowledge_discovery Knowledge discovery from Wikipedia]</ref>
* [[Krzysztof Krawiec]], [http://www.informatik.uni-trier.de/~ley/pers/hd/s/Slowinski:Roman.html Roman Slowinski], [http://www.informatik.uni-trier.de/~ley/pers/hd/s/Szczesniak:Irmina.html Irmina Szczesniak] ('''1998'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-69115-4_60 Pedagogical Method for Extraction of Symbolic Knowledge from Neural Networks]''. [http://link.springer.com/book/10.1007%2F3-540-69115-4 Rough Sets and Current Trends in Computing 1998]
* [[Edward John Quigley|Edward J. Quigley]], [http://www.ischool.pitt.edu/people/debons.php Anthony Debons] ('''1999'''). ''Interrogative Theory of Information and Knowledge''. [http://www.informatik.uni-trier.de/~ley/db/conf/sigcpr/sigcpr1999.html#QuigleyD99 SIGCPR '99], [http://www.thirdwave-websites.com/datainfoknow.pdf pdf]
==2000 ...==
* [[Michael Thielscher]] ('''2000'''). ''Representing the Knowledge of a Robot''. [http://www.informatik.uni-trier.de/~ley/db/conf/kr/kr2000.html#Thielscher00 KR 2000], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.477 CiteSeerX]
* [[Krzysztof Krawiec]] ('''2002'''). ''[http://link.springer.com/article/10.1023/A:1020984725014 Genetic Programming-based Construction of Features for Machine Learning and Knowledge Discovery Tasks]''. [http://www.informatik.uni-trier.de/~ley/db/journals/gpem/gpem3.html#Krawiec02 Genetic Programming and Evolvable Machines, Vol. 3], No. 4
* [[Stuart Russell]], [[Peter Norvig]] ('''2003'''). ''[http://aima.cs.berkeley.edu/ Artificial Intelligence: A Modern Approach]'', 2nd edition, [http://books.google.com/books?id=8jZBksh-bUMC&dq=isbn:0137903952&hl=en 3rd edition 2009]
* [[Stuart Russell]] ('''2003'''). ''Rationality and Intelligence.'' In Renee Elio (Ed.), Common sense, reasoning, and rationality, Oxford University Press, [http://www.cs.berkeley.edu/%7Erussell/papers/aij-cnt.pdf pdf]
* [[Aleksander Sadikov]], [[Ivan Bratko]], [[Igor Kononenko]] ('''2003'''). ''Search versus Knowledge: An Empirical Study of Minimax on KRK''. [[Advances in Computer Games 10]], [http://www.ailab.si/sasha/acg2003.pdf pdf]
* [[Tristan Caulfield]] ('''2004'''). ''Acquiring and Using Knowledge in Computer Chess''. BSc Computer Science, [https://en.wikipedia.org/wiki/University_of_Bath University of Bath], [http://opus.bath.ac.uk/16854/1/CSBU pdf]
* [http://people.virginia.edu/~ema3z/ Elias M. Awad], [http://www.goodreads.com/author/show/4245178.Hassan_Ghaziri Hassan M. Ghaziri] ('''2004,2010'''). ''Knowledge Management Systems''. [http://www.pearsoned.co.in/web/books/9788131714034_Knowledge-Management_Hassan-M-Ghaziri.aspx Pearson Education India], [http://turing.une.edu.au/~comp292/Lectures/HEADER_KM_2004_LEC_NOTES/HEADER_KM_2004_LEC_NOTES.html Knowledge Management Systems - Lecture Notes], [http://www.latex2html.org/ LaTeX2HTML] by [http://www.astro.ku.dk/software/latex2html/manual/manual.html Nikos Drakos], [http://maths.mq.edu.au/~ross/ Ross Moore]
* [[Nick Pelling]] ('''2004'''). ''[http://www.nickpelling.com/dissertation/ The Network Is The Knowledge: Ideology & Strategy in Mintzberg's Ten Schools]''. [https://en.wikipedia.org/wiki/Master_of_Business_Administration MBA] dissertation, [https://en.wikipedia.org/wiki/Kingston_University Kingston University] [https://en.wikipedia.org/wiki/Kingston_Business_School Business School], [https://en.wikipedia.org/wiki/Surrey Surrey], UK
==2005 ...==
* [[Christian Posthoff]], [[Michael Schlosser]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-60217-8_17 Optimal strategies — Learning from examples — Boolean equations]''. in [https://www.researchgate.net/profile/Klaus_Jantke Klaus P. Jantke], [https://www.fbi.h-da.de/organisation/personen/lange-steffen.html Steffen Lange] (eds.) ('''2005'''). [http://link.springer.com/book/10.1007/3-540-60217-8 Algorithmic Learning for Knowledge-Based Systems], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 961, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Aleksander Sadikov]], [[Ivan Bratko]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_15 Search Versus Knowledge Revisited Again]''. [[CG 2006]]
* [[David J. Stracuzzi]] ('''2006'''). ''[http://scholarworks.umass.edu/dissertations/AAI3242366/ Scalable Knowledge Acquisition through Cumulative Learning and Memory Organization]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Massachusetts_Amherst University of Massachusetts Amherst], advisor [[Paul E. Utgoff]], [http://stracuzzi.info/david/manuscripts/dissertation06.pdf pdf]
* [[Guillaume Chaslot]], [[Louis Chatriot]], [[Christophe Fiter]], [[Sylvain Gelly]], [[Jean-Baptiste Hoock]], [[Julien Pérez]], [[Arpad Rimmel]], [[Olivier Teytaud]] ('''2008'''). ''Combining expert, offline, transient and online knowledge in Monte-Carlo exploration''. [http://www.lri.fr/~teytaud/eg.pdf pdf]
* [[Guillaume Chaslot]], [[Christophe Fiter]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Olivier Teytaud]] ('''2009'''). ''Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search''. [[Advances in Computer Games 12]], [http://www.personeel.unimaas.nl/g-chaslot/papers/acg09.pdf pdf], [http://www.lri.fr/~rimmel/publi/EK_explo.pdf pdf]
==2010 ...==
* [[Matej Guid]] ('''2010'''). ''Search and Knowledge for Human and Machine Problem Solving'', Ph.D. thesis, [[University of Ljubljana]], [http://eprints.fri.uni-lj.si/1113/1/Matej__Guid.disertacija.pdf pdf] <ref>[[Dap Hartmann]] ('''2010'''). ''How can Humans learn from Computers?'' Review on [[Matej Guid|Matej Guid's]] Ph.D. thesis, [[ICGA Journal#33_4|ICGA Journal, Vol. 33, No. 4]]</ref>
* [[Shi-Jim Yen]], [[Jung-Kuei Yang]], [[Kuo-Yuan Kao]], [[Tai-Ning Yang]] ('''2012'''). ''[http://www.sciencedirect.com/science/article/pii/S0950705112001293 Bitboard Knowledge Base System and Elegant Search Architectures for Connect6]''. [https://www.journals.elsevier.com/knowledge-based-systems/ Knowledge-Based Systems], Vol. 34
* [[Bo-Nian Chen]], [[Hung-Jui Chang]], [[Shun-Chin Hsu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2013'''). ''Multilevel Inference in Chinese Chess Endgame Knowledge Bases''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]] » [[Chinese Chess]], [[Endgame Tablebases]]
* [[Bo-Nian Chen]], [[Hung-Jui Chang]], [[Shun-Chin Hsu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2014'''). ''Advanced Meta-knowledge for Chinese Chess Endgame Knowledge Bases''. [[ICGA Journal#37_1|ICGA Journal, Vol 37, No. 1]]
==2015 ...==
* [[Tamal T. Biswas]], [[Kenneth Wingate Regan|Kenneth W. Regan]] ('''2015'''). ''Quantifying Depth and Complexity of Thinking and Knowledge''. [http://www.icaart.org/EuropeanProjectSpace.aspx?y=2015 ICAART 2015], [http://www.cse.buffalo.edu/~regan/papers/pdf/BiReICAART15CR.pdf pdf]
=Forum Posts=
==1996 ...==
* [https://groups.google.com/d/msg/rec.games.chess.computer/47bgYzU2kyQ/BKAn9pqUtogJ Incoporating chess knowledge in chess programs] by [[Valavan Manohararajah]], [[Computer Chess Forums|rgcc]], June 26, 1996
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/99eec6923b0481db computer chess "oracle" ideas...] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], April 1, 1997 » [[Oracle]]
* [https://www.stmintz.com/ccc/index.php?id=20531 Knowledge is not elegant] by [[Don Dailey]], [[CCC]], June 14, 1998
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/e917da2d88146756 The end of computer chess progress?] by [[Ed Schroder|Ed Schröder]], [[Computer Chess Forums|rgcc]], March 06, 1999
* [https://www.stmintz.com/ccc/index.php?id=77234 The Limits of Positional Knowledge] by Michael Neish from [[CCC]], November 11, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=261167 suggestions for (a new generation of) chess knowledge using engines] by [[Ingo Lindam]], [[CCC]], October 23, 2002
* [https://www.stmintz.com/ccc/index.php?id=261636 likelihood instead of pawnunits? + chess knowledge] by [[Ingo Lindam]], [[CCC]], October 25, 2002
* [https://www.stmintz.com/ccc/index.php?id=389133 Knowledge] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], September 26, 2004
==2005 ...==
* [https://www.stmintz.com/ccc/index.php?id=480599 The superior Rybka chess knowledge] by [[Chrilly Donninger]], [[CCC]], January 18, 2006 » [[Rybka]]
* [https://www.stmintz.com/ccc/index.php?id=486851 knowledge and blitz; search and long games] by Joseph Ciarrochi, [[CCC]], February 15, 2006
* [http://www.hiarcs.net/forums/viewtopic.php?t=402 Search or Evaluation?] by [[Ed Schroder|Ed Schröder]], [[Computer Chess Forums|Hiarcs Forum]], October 05, 2007 » [[Search]], [[Evaluation]]
: [http://www.hiarcs.net/forums/viewtopic.php?p=2944 Re: Search or Evaluation?] by [[Mark Uniacke]], [[Computer Chess Forums|Hiarcs Forum]], October 14, 2007
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=36031 hardware advances - a different perspective] by [[Robert Hyatt]], [[CCC]], September 09, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=36040 old crafty vs new crafty on new hardware] by [[Robert Hyatt]], [[CCC]], September 11, 2010 » [[Crafty]]
* [http://www.talkchess.com/forum/viewtopic.php?t=36050 Crafty tests show that Software has advanced more] by [[Don Dailey]], [[CCC]], September 12, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=36059 Final results - Crafty - hardware vs software] by [[Robert Hyatt]], [[CCC]], September 13, 2010 » [[Crafty]]
* [http://www.talkchess.com/forum/viewtopic.php?t=36058 Deep Blue vs Rybka] by [[Don Dailey]], [[CCC]], September 13, 2010 » [[Deep Blue]], [[Rybka]]
* [http://www.talkchess.com/forum/viewtopic.php?t=36088 hardware doubling number for Crafty] by [[Robert Hyatt]], [[CCC]], September 15, 2010 » [[Crafty]]
* [http://www.talkchess.com/forum/viewtopic.php?t=40166 Ahhh... the holy grail of computer chess] by [[Marcel van Kervinck]], [[CCC]], August 23, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=48743 Is search irrelevant when computing ahead of very big trees?] by [[Fermin Serrano]], [[CCC]], July 24, 2013 » [[Search]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49190 Improve the search or the evaluation?] by [[Jens Bæk Nielsen]], [[CCC]], August 31, 2013 » [[Knowledge#SearchVersusEvaluation|Search versus Evaluation]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49906 Slow Searchers?] by Michael Neish, [[CCC]], November 02, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=54697 Chessprogams with the most chessknowing] by Joe Boden, [[CCC]], December 19, 2014
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=55752 An attempt to measure the knowledge of engines] by [[Kai Laskos]], [[CCC]], March 23, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=54697&start=44 Re: Chessprogams with the most chessknowing] by [[Vincent Lejeune]], [[CCC]], February 18, 2017
: [http://www.talkchess.com/forum/viewtopic.php?t=54697&start=46 Re: Chessprogams with the most chessknowing] by [[Alvaro Cardoso]], [[CCC]], February 18, 2017
: [http://www.talkchess.com/forum/viewtopic.php?t=54697&start=47 Re: Chessprogams with the most chessknowing] by [[Mark Lefler]], [[CCC]], February 18, 2017 » [[Komodo]]
: [http://www.talkchess.com/forum/viewtopic.php?t=54697&start=50 Re: Chessprogams with the most chessknowing] by [[Marco Costalba]], [[CCC]], February 19, 2017 » [[Stockfish]]
=External Links=
==Knowledge==
* [https://en.wikipedia.org/wiki/Knowledge Knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_acquisition Knowledge acquisition from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_discovery Knowledge discovery from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_engineering Knowledge engineering from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_Engineering_Environment Knowledge Engineering Environment from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_extraction Knowledge extraction from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_management Knowledge management from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_representation_and_reasoning Knowledge representation and reasoning from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_transfer Knowledge transfer from Wikipedia]
==Related Topics==
* [https://en.wikipedia.org/wiki/Awareness Awareness from Wikipedia]
* [https://en.wikipedia.org/wiki/Belief Belief from Wikipedia]
* [https://en.wikipedia.org/wiki/Cognition Cognition from Wikipedia]
* [https://en.wikipedia.org/wiki/Consciousness Consciousness from Wikipedia]
* [https://en.wikipedia.org/wiki/Data_mining Data mining from Wikipedia]
* [https://en.wikipedia.org/wiki/Epistemology Epistemology from Wikipedia]
* [https://en.wikipedia.org/wiki/Experience Experience from Wikipedia]
* [https://en.wikipedia.org/wiki/Expert Expert from Wikipedia]
* [https://en.wikipedia.org/wiki/Expert_system Expert system from Wikipedia]
* [https://en.wikipedia.org/wiki/Imagination Imagination from Wikipedia]
* [https://en.wikipedia.org/wiki/Instinct Instinct from Wikipedia]
* [https://en.wikipedia.org/wiki/Intelligence Intelligence from Wikipedia]
* [https://en.wikipedia.org/wiki/Intuition_%28philosophy%29 Intuition (philosophy) from Wikipedia]
* [https://en.wikipedia.org/wiki/Intuition_%28psychology%29 Intuition (psychology) from Wikipedia]
* [https://en.wikipedia.org/wiki/Learning Learning from Wikipedia]
* [https://en.wikipedia.org/wiki/Mind Mind from Wikipedia]
* [https://en.wikipedia.org/wiki/Ontology_%28information_science%29 Ontology (information science) from Wikipedia]
* [https://en.wikipedia.org/wiki/Paradigm Paradigm from Wikipedia]
* [https://en.wikipedia.org/wiki/Philosophy Philosophy from Wikipedia]
* [https://en.wikipedia.org/wiki/Philosophy_of_mind Philosophy of mind from Wikipedia]
* [https://en.wikipedia.org/wiki/Psychology Psychology from Wikipedia]
* [https://en.wikipedia.org/wiki/Science Science from Wikipedia]
* [https://en.wikipedia.org/wiki/Scientia_potentia_est Scientia potentia est - knowledge is power - Wikipedia]
* [https://en.wikipedia.org/wiki/Skill Skill from Wikipedia]
* [https://en.wikipedia.org/wiki/Thought Thought from Wikipedia]
* [https://en.wikipedia.org/wiki/Understanding Understanding from Wikipedia]
==Types of Knowledge==
* [https://en.wikipedia.org/wiki/A_priori_and_a_posteriori A priori and a posteriori from Wikipedia]
* [https://en.wikipedia.org/wiki/Common_knowledge Common knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Common_knowledge_%28logic%29 Common knowledge (logic) from Wikipedia]
* [http://decisionautomation.com/glossary/14.php Declarative Knowledge] from [http://decisionautomation.com/ Decision Automation Resources]
* [https://en.wikipedia.org/wiki/Descriptive_knowledge Descriptive knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Dispersed_knowledge Dispersed knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Distributed_knowledge Distributed knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Metaknowledge Metaknowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Mutual_knowledge_%28logic%29 Mutual knowledge (logic) from Wikipedia]
* [https://en.wikipedia.org/wiki/Procedural_knowledge Procedural knowledge from Wikipedia]
* [http://www.ehhs.cmich.edu/%7Ermscott/643declarative.html Teaching Declarative Knowledge] by [http://www.ehhs.cmich.edu/%7Ermscott/index.html Renay M. Scott]
==Musicvideo==
* <span id="youknow"></span>[[Videos#MahavishnuOrchestra|Mahavishnu Orchestra]] - [https://en.wikipedia.org/wiki/The_Inner_Mounting_Flame You Know You Know], August 17, 1972, more recent [https://en.wikipedia.org/wiki/3sat 3Sat] broadcast <ref>Original [https://en.wikipedia.org/wiki/ZDF ZDF] broadcast "[https://de.wikipedia.org/wiki/ZDF_Sonntagskonzert Sonntagskonzert]", September 17, 1972, recorded at [http://www.abendzeitung-muenchen.de/inhalt.deutsches-museum-kongresshalle-wird-zur-event-location-gaudi-und-tralala.0fbdbcaa-3122-4466-a8b3-69a7de1bde68.html Kongresshalle] [https://en.wikipedia.org/wiki/Deutsches_Museum Deutschen Museum], [https://en.wikipedia.org/wiki/Munich Munich], "Jazz Now", August 17, 1972, curator [http://alchetron.com/Joachim-Ernst-Berendt-780489-W Joachim-Ernst Berendt], see [http://www.bathedinlightning.com/bonus%20material/the_mahavishnu_orchestra_on_film.html The Mahavishnu Orchestra On Film], [http://www.embryo.de/MUENCHEN-72_KPL.pdf MUENCHEN-72_KPL.pdf], [http://www.spiegel.de/spiegel/print/d-42891878.html Diese Woche im Fernsehen], [https://en.wikipedia.org/wiki/Der_Spiegel Der Spiegel] 38/1972 (German), [https://en.wikipedia.org/wiki/1972_Summer_Olympics 1972 Summer Olympics]</ref>, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: [[Videos#JohnMcLaughlin|John McLaughlin]], [[Videos#BillyCobham|Billy Cobham]], [https://en.wikipedia.org/wiki/Rick_Laird Rick Laird], [[Videos#JanHammer|Jan Hammer]], [https://en.wikipedia.org/wiki/Jerry_Goodman Jerry Goodman]
: {{#evu:https://www.youtube.com/watch?v=ujcYw2QTPzM|alignment=left|valignment=top}}
=References=
<references />
'''[[Main Page|Up one Level]]'''
[[Category:Samuel Bak]]
[[FILE:Knowledgeable.jpg|border|right|thumb|link=http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bc6|[[Arts#Bak|Samuel Bak]] - Knowledgeable <ref>[http://chgs.elevator.umn.edu/asset/viewAsset/57f3b6787d58ae5f74bf8ba9#57f3b6d77d58ae5574bf8bc6 Chess in the Art of Samuel Bak], [http://www.chgs.umn.edu/ Center for Holocaust & Genocide Studies], [https://en.wikipedia.org/wiki/University_of_Minnesota University of Minnesota]</ref> ]]
'''Knowledge''' is the possession of information, its acquisition involves complex [[Cognition|cognitive]] processes: [https://en.wikipedia.org/wiki/Perception perception], [[Learning|learning]], [https://en.wikipedia.org/wiki/Communication communication], [https://en.wikipedia.org/wiki/Association association] and [https://en.wikipedia.org/wiki/Reasoning reasoning].
Inside a chess program, knowledge is manifested either as [https://en.wikipedia.org/wiki/Procedural_knowledge procedural] or as [https://en.wikipedia.org/wiki/Declarative_knowledge declarative knowledge]. The declarative [https://en.wikipedia.org/wiki/A_priori_and_a_posteriori a priori] knowledge about the [[Rules of Chess|rules of chess]] is immanent inside the [[Move Generation|move generator]] in conjunction with [[Check|check]] detection. Further declarative knowledge is coded as [https://en.wikipedia.org/wiki/Rule_of_thumb rules of thumb] of the [[Evaluation|evaluation]] function, as well as persistent perfect knowledge from [[Retrograde Analysis|retrograde analysis]], or as [https://en.wikipedia.org/wiki/Empirical empirical] knowledge mostly from human [https://en.wikipedia.org/wiki/Experience experience], to retrieve [[Moves|moves]] from an hand crafted [[Opening Book|opening book]]. Procedural knowledge is applied by [[Learning]], as well to backup declarative knowledge by [[Search]]. However, the Search versus Knowledge trade-off in computer chess and games refers heuristic or perfect knowledge.
<span id="SearchversusKnowledge"></span>
=Search versus Knowledge=
The trade-offs of [[Search|search]] versus Knowledge <ref>[[Jonathan Schaeffer]] ('''1997'''). [http://www.cs.ualberta.ca/%7Ejonathan/OJA/oja.html One Jump Ahead] ''Challenging Human Supremacy in Checkers'', Springer, ISBN 0-387-94930-5, Prelude to Disaster, pp. 255-256 or pp. 249-250 in the [http://www.springer.com/computer/artificial/book/978-0-387-76575-4 Second Edition, 2009]</ref>
{|
|- style="vertical-align:top;"
| [[FILE:KnowledeSearch.JPG|none|border|text-bottom]]
| Curves A and B represent a fixed performance level, say 2000 for B and 2200 for A. The curves indicate that there are many ways to archive that level of performance, either by little knowledge and lot of search, or vice versa. If a program has archived point P on curve B, it may improve between search only (point S) or knowledge only (point K).
|}
<span id="InPractice"></span>
==In Practice==
[[Andreas Junghanns]] and [[Jonathan Schaeffer]] in ''Search versus knowledge in game-playing programs revisited'' <ref>[[Andreas Junghanns]], [[Jonathan Schaeffer]] ('''1997'''). ''Search versus knowledge in game-playing programs revisited''. [[Conferences#IJCAI1997|IJCAI-97]], Vol 1, [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.168&rep=rep1&type=pdf pdf], 3 Search Versus Knowledge: Practise</ref>:
The difficulty lies in quantifying the knowledge axis. Perfect knowledge assumes an [[Oracle|oracle]], which for most games we do not have. However, we can approximate an oracle by using a high-quality, game playing program that performs deep searches. Although not perfect, it is the best approximation available. Using this, how can we measure the quality of knowledge in the program?
A heuristic evaluation function, as judged by an oracle, can be viewed as a combination of two things: oracle knowledge and noise. The oracle knowledge is beneficial and improves the program' s play. The noise, on the other hand, represents the inaccuracies in the program' s knowledge. It can be introduced by several things, including knowledge that is missing, over- or under-valued, and/or irrelevant. As the noise level increase, the beneficial contribution of the knowledge is overshadowed.
By definition, an oracle has no noise. We can measure the quality of the heuristic evaluation in a program by the amount of noise that is added into it. To measure this, we add a [[Pseudorandom Number Generator|random number]] to each [[Search with Random Leaf Values|leaf node evaluation]] ...
==HiTech versus LoTech==
At the [[Advances in Computer Chess 5]] conference 1987, [[Hans Berliner]] et al. introduced an interesting experiment. [[HiTech]] with a sophisticated evaluation competed versus LoTech, almost the same program but a rudimentary evaluation, at different [[Depth|search depths]] <ref>[[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1989'''). ''Measuring the Performance Potential of Chess Programs'', [[Advances in Computer Chess 5]]</ref>. According to [[Peter Kouwenhoven]] <ref>[[Peter Kouwenhoven]] ('''1987'''). ''Advances in Computer Chess, The 5th Triennial Conference''. [[ICGA Journal#10_2|ICCA Journal, Vol. 10, No. 2]] (report)</ref>, Berliner's conclusion was that more was to be won by increasing HiTech's knowledge at constant speed rather than further increasing its speed while keeping knowledge constant. The abstract from the extended 1990 paper <ref>[[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1990'''). ''[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TYF-47WTT8W-3J&_user=10&_coverDate=04%2F30%2F1990&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1541914346&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=a43185e00b7d7d4550af0add28ff36b8&searchtype=a Measuring the Performance Potential of Chess Programs].'' Artificial Intelligence, Vol. 43, No. 1</ref>:
Chess programs can differ in depth of search or in the evaluation function applied to leaf nodes or both. Over the past 10 years, the notion that the principal way to [[Playing Strength|strengthen]] a chess program is to improve its depth of search has held sway. Improving depth of search undoubtedly does improve a program's strength. However, projections of potential gain have time and again been found to overestimate the actual gain.
We examine the notion that it is possible to project the playing strength of chess programs by having different versions of the same program (differing only in depth of search) play each other. Our data indicates that once a depth of “tactical sufficiency” is reached, a knowledgeable program can beat a significantly less knowledgeable one almost all of the time when both are searching to the same depth. This suggests that once a certain knowledge gap has been opened up, it cannot be overcome by small increments in searching depth. The conclusion from this work is that extending the depth of search without increasing the present level of knowledge will not in any foreseeable time lead to World Championship level chess. The approach of increasing knowledge has been taken in the HiTech chess machine.
==Ed Schröder's Conclusion==
[[Ed Schroder|Ed Schröder]] concluded HiTech's extra knowledge was just worth one [[Ply|ply]] in the computer-computer area <ref>[http://www.rebel.nl/ches2010.htm Chess in 2010] by [[Ed Schroder|Ed Schröder]], The Berliner Experiment</ref><ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/e917da2d88146756 The end of computer chess progress?] by [[Ed Schroder|Ed Schröder]], [[Computer Chess Forums|rgcc]], March 06, 1999</ref>, and further elaborated on [[Tactics|tactical]] evaluation knowledge helpful in early [[Rebel]] searching 5-7 plies versus Rebel searching 13-15 plies on 2001 hardware <ref>[https://www.stmintz.com/ccc/index.php?id=198940 Re: Intelligent software, please] by [[Ed Schroder|Ed Schröder]], [[CCC]], November 26, 2001</ref> <ref>[http://www.schach-computer.info/wiki/index.php/Schr%C3%B6der,_Ed Schröder, Ed] (German) from [http://www.schach-computer.info/wiki/index.php/Hauptseite_En Schachcomputer.info - Wiki] also refers the post by [[Ed Schroder|Ed Schröder]]</ref>:
Some specific chess knowledge through the years become out-dated due to the speed of nowadays computers. An example: In the early days of computer chess, say the period 1985-1989 I as hardware had a [[6502]] running at 5 Mhz. [[Rebel]] at that time could only search 5-7 plies on tournament time control. Such a low depth guarantees you one thing: [[Horizon Effect|horizon effects]] all over, thus losing the game.
To escape from the horizon effect all kind of tricks were invented, chess knowledge about dangerous [[Pin|pins]], [[Knight Pattern#KnightForks|knight forks]], [[Double Attack|double attacks]], [[Overloading|overloading of pieces]] and reward those aspects in [[Evaluation|eval]]. Complicated and processor time consuming software it was (15-20% less performance) but it did the trick escaping from the horizon effect in a reasonable way.
Today we run chess program on 1500 Mhz machines and instead of the 5-7 plies Rebel now gets 13-15 plies in the middle game and the horizon effect which was a major problem at 5 Mhz slowly was fading away.
So I wondered, what if I throw that complicated "anti-horizon" code out of Rebel, is it still needed? So I tried and found out that Rebel played as good with the "anti-horizon" code as without the code. In other words, the net gain was a "free" speed gain of 15-20%, thus an improvement.
One aspect of chess programming is that your program is in a constant state of change due to the state of art of nowadays available hardware. I am sure a Rebel at 10 Ghz several parts of Rebel need a face-lift to get the maximum out of the new speed monster.
<span id="SearchVersusEvaluation"></span>
==Search versus Evaluation==
[[Mark Uniacke]] in a reply to [[Ed Schroder|Ed Schröder]], on [[Search]] or [[Evaluation]], mentioning the [[1st Computer Olympiad#Chess|1st Computer Olympiad]], [[Null Move Pruning]], [[Hiarcs]], [[Woodpusher]], [[E6P]], [[Rebel]], [[Fritz]] ... <ref>[http://www.hiarcs.net/forums/viewtopic.php?p=2944 Re: Search or Evaluation?] by [[Mark Uniacke]], [[Computer Chess Forums|Hiarcs Forum]], October 14, 2007</ref>:
I am not saying search is the only reason but that search is more significant in the Elo jump than other factors. Thanks for the interesting history which in general I agree with but I should add for clarification...
In 1989 I was exposed to the [[Null Move|null move]] in [[Hiarcs|HIARCS']] first official computer tournament at the [[1st Computer Olympiad|Olympiad]] in London. [[John Hamlen]] had written his program [[Woodpusher]] as part of his M.Sc project investigating the null move exclamation and although Woodpusher did not do well in that tournament I had the good fortune to discuss null move with John and reading his project which interested me very much. John and I had many discussions on computer chess over the following months.
That Olympiad probably had an impact on you too and not only because [[Rebel]] won Gold above [[Mephisto Portorose|Mephisto X]] and [[Fidelity|Fidelity X]] for the first time but because there was a program there running quite fast (at that time in history) called [[E6P]] (so named because it could reach 6 ply full width!) running on an Acorn [[ARM2|ARM]] [[Acorn Archimedes|based machine]]. [[Jan Louwman|Jan]] was operating Rebel at the tournament as you know and I noticed Jan take a keen interest in this new machine.
[[Frans Morsch|Frans]] was using null move in [[Fritz|Fritz 2]] in [[WCCC 1992|Madrid 1992]] (I am not sure about Fritz 1). I am sure you remember that tournament fondly. I remember at Madrid having a discussion with a few programmers including [[Richard Lang|Richard]] about what on earth was Fritz 2 doing to reach the [[Depth|depths]] it was attaining, this seed of interest made me investigate search enhancements carefully after Madrid and it was then that I began re-investigating the null move. It was not long before HIARCS began using null moves too and by Christmas 1992 I had a working implementation which gave a big jump over Hiarcs 1 which had only been released shortly before. I had much fun playing my Hiarcs 1.n against [[Mephisto RISC|Mephisto Risc 1]] in late 1992, early 1993 and that sort of closes the circle on the E6P story. Even so, the null move idea still evolved and my implementation today is much better than it was initially and so it can be for other ideas. We can all profit from these techniques but some gain more than others if they find new ways to exploit it.
Rebel 7/8/9 and Hiarcs 5/6/7 battled hard in those years and my big jump to the top of the rating lists happened partly because of a search change to Hiarcs 5/6 which led at one stage to a 71 Elo lead on the SSDF. I recall Rebel and Hiarcs exchanging the lead on the [[SSDF]] list a number of times in those years. So we agree the impact search has made on computer chess progress is clear. Now we diverge on what might be the reason for new progress in the field.
Clearly we have good search enhancements on [[Node Types#CUT|cut nodes]] and [[Node Types#ALL|all nodes]], but that does not mean they cannot be improved and enhanced or in fact that another technique might prove to be superior or complementary. Meanwhile there can be no doubt that progress is made positionally irrespective of search but I do not believe it can be the reason for a breakthrough jump in chess strength but rather a steady climb.
But wait!
Maybe there is a middle way, a third avenue of improvement which sort of falls between the two pillars of search and evaluation and that is search intelligence. Something both of us have practiced in our programs for years but maybe not properly exploited. The ability of the eval to have a more significant impact on the search than traditionally has been the case. I think this area has been relatively unexplored and offers interesting potential.
=Knowing=
* [[Chunking]]
* [[Cognition]]
* [[Learning]]
* [[Pattern Recognition]]
* [[Planning]]
<span id="DeclarativeKnowledge"></span>
=Declarative Knowledge=
==A Priori==
* [[Rules of Chess]]
* [[Move Generation]]
* [[Check|In Check]]
==Heuristic Knowledge==
* [[Evaluation]]
* [[Move Ordering]]
* [[Selectivity]]
==Empirical Knowledge==
* [[Automated Tuning]]
* [[Opening Book]]
<span id="PerfectKnowledge"></span>
==Perfect Knowledge==
Perfect Knowledge usually incorporates [[Retrograde Analysis|analysis]] or stored results from exhaustive search, which requires no further search at [[Interior Node|interior nodes]] except the [[Root|root]]. An [[Oracle|oracle]] might be considered as "perfect" [[Evaluation|evaluation]].
* [[Oracle]]
* [[Retrograde Analysis]]
<span id="InteriorNodeRecognizers"></span>
===Interior Node Recognizer===
* [[Interior Node Recognizer]]
===Endgame Databases===
as probed inside a Recognizer framework, if a certain material constellation is detected.
* [[Endgame Tablebases]]
* [[Endgame Bitbases]]
=Procedural Knowledge=
* [[Search]]
* [[Checkmate]]
* [[Stalemate]]
* [[Fifty-move Rule]]
* [[Repetitions]]
=See also=
* [[Artificial Intelligence]]
* [[Depth#DiminishingReturns|Diminishing Returns]]
* [[Memory]]
* [[Opponent Model Search]]
* [[Psychology]]
* [[Strategy]]
* [[Tactics]]
=Publications=
==1970 ...==
* [[Marvin Minsky]] ('''1974'''). ''[http://web.media.mit.edu/~minsky/papers/Frames/frames.html Framework for Representing Knowledge 1974]''. [[Massachusetts Institute of Technology|MIT]]-AI Laboratory Memo 306
* [[Coen Zuidema]] ('''1974'''). ''Chess: How to Program the Exceptions?'' Technical Report IW21/74, [https://en.wikipedia.org/wiki/Centrum_Wiskunde_%26_Informatica Mathematical Center Amdsterdam]. [http://oai.cwi.nl/oai/asset/9480/9480A.pdf pdf]
==1975 ...==
* [[Donald Michie]] ('''1976'''). ''An Advice-Taking System for Computer Chess.'' Computer Bulletin, Ser. 2, Vol. 10, pp. 12-14. ISSN 0010-4531.
* [[Jack Good]] ('''1977'''). ''Dynamic Probability, Computer Chess, and the Measurement of Knowledge.'' Machine Intelligence, Vol. 8 (eds. E. Elcock and [[Donald Michie]]), pp. 139-150. Ellis Horwood, Chichester.
* [[Ivan Bratko]], [[Danny Kopec]], [[Donald Michie]] ('''1978'''). ''Pattern-Based Representation of Chess Endgame Knowledge''. [http://comjnl.oxfordjournals.org/content/21/2.toc The Computer Journal, Vol. 21, No. 2], pp. 149-153. [http://www.sci.brooklyn.cuny.edu/%7Ekopec/Publications/Publications/O_44_C.pdf pdf]
* [[Donald Michie]], [[Ivan Bratko]] ('''1978'''). ''Advice Table Representations of Chess End-Game Knowledge''. Proceedings 3rd AISB/GI Conference, pp. 194-200.
* [[David Wilkins]] ('''1979'''). ''Using Patterns and Plans to Solve Problems and Control Search''. Ph.D. thesis, Computer Science Dept, [[Stanford University]], AI Lab Memo AIM-329
* [[Max Bramer]], [[Mike Clarke]] ('''1979'''). ''[http://www.sciencedirect.com/science/article/pii/S0020737379800139 A Model for the Representation of Pattern-Knowledge for the Endgame in Chess]''. [http://www.interaction-design.org/references/periodicals/international_journal_of_man-machine_studies_volume_11.html International Journal of Man-Machine Studies, Vol. 11, No.5]
==1980 ...==
* [[Ivan Bratko]], [[Donald Michie]] ('''1980'''). ''A Representation of Pattern-Knowledge in Chess Endgames''. [[Advances in Computer Chess 2]]
* [[David Wilkins]] ('''1980'''). ''Using patterns and plans in chess''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], vol. 14, pp. 165-203. Reprinted ('''1988''') in [[Computer Chess Compendium]]
* [[David Wilkins]] ('''1982'''). ''Using Knowledge to Control Tree Searching''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], vol. 18, pp. 1-51.
* [[Alen Shapiro]], [[Tim Niblett]] ('''1982'''). ''Automatic Induction of Classification Rules for Chess End game.'' [[Advances in Computer Chess 3]]
* [[Hans Berliner]] ('''1982'''). ''Search vs. knowledge: an analysis from the domain of games''. Technical Report Department of Computer Science, [[Carnegie Mellon University]]
* [[Allen Newell]] ('''1982'''). ''The Knowledge Level''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 18, No. 1
* [[Raymond Smullyan]] ('''1982'''). ''[http://www.mit.edu/people/dpolicar/writing/prose/text/epistemologicalNightmare.html An Epistemological Nightmare]''. [[Massachusetts Institute of Technology|MIT]]
* [[David Wilkins]] ('''1983'''). ''Using chess knowledge to reduce search''. In [[Chess Skill in Man and Machine]] ([[Peter W. Frey]], ed.), Ch. 10, 2nd Edition, Springer-Verlag.
* [[Danny Kopec]] ('''1983'''). ''Human and Machine Representations of Knowledge''. Ph.D. thesis, [[University of Edinburgh]], supervisor: [[Donald Michie]]
* [[Alen Shapiro]] ('''1983'''). ''The Role of Structured Induction in Expert Systems''. [[University of Edinburgh]], Machine Intelligence Research Unit (Ph.D. thesis) <ref>[http://archive.ics.uci.edu/ml/datasets/Chess+%28King-Rook+vs.+King-Pawn%29 UCI Machine Learning Repository: Chess (King-Rook vs. King-Pawn) Data Set]</ref>
* [[Jonathan Schaeffer]] ('''1984'''). ''The Relative Importance of Knowledge''. [[ICGA Journal#7_3|ICCA Journal, Vol. 7, No. 3]]
* [[Albrecht Heeffer]] ('''1984'''). ''Automated Acquisition on Concepts for the Description of Middle-game Positions in Chess''. [https://en.wikipedia.org/wiki/Turing_Institute Turing Institute], [https://en.wikipedia.org/wiki/Glasgow Glasgow], [https://en.wikipedia.org/wiki/Scotland Scotland], TIRM-84-005
==1985 ...==
* [[Albrecht Heeffer]] ('''1985'''). ''Validating Concepts from Automated Acquisition Systems''. [[Conferences#IJCAI|IJCAI 85]], [http://ijcai.org/Past%20Proceedings/IJCAI-85-VOL1/PDF/118.pdf pdf]
* [[Reiner Seidel]] ('''1985'''). ''Grammatical Description of Chess Positions, Data-Base versus Human Knowledge''. [[ICGA Journal#8_3|ICCA Journal, Vol. 8, No. 3]]
* [[Jonathan Schaeffer]], [[Tony Marsland]] ('''1985'''). ''The Utility of Expert Knowledge''. Proceedings [http://www.informatik.uni-trier.de/%7Eley/db/conf/ijcai/ijcai85.html IJCAI 85], pp. 585-587. Los Angeles.
* [[Alen Shapiro]], [[Donald Michie]] ('''1986'''). ''A Self-commenting Facility for Inductively Synthesised Endgame Expertise''. [[Advances in Computer Chess 4]]
* [[Bernd Owsnicki-Klewe|Bernd Owsnicki]], [[Kai von Luck]] ('''1986'''). ''N.N.: A Case Study in Chess Knowledge Representation''. [[Advances in Computer Chess 4]]
* [[Jonathan Schaeffer]] ('''1986'''). ''Experiments in Search and Knowledge''. Ph.D. Thesis, [[University of Waterloo]]. Reprinted as Technical Report TR 86-12, Department of Computing Science, [[University of Alberta]], Edmonton, Alberta.
* [[Peter W. Frey]] ('''1986'''). ''Fuzzy Production Rules in Chess''. [[ICGA Journal#9_4|ICCA Journal, Vol. 9, No. 4]]
* [[Peter W. Frey]] ('''1986'''). ''[https://archive.org/stream/byte-magazine-1986-11/1986_11_BYTE_11-12_Knowledge_Representation#page/n175/mode/2up A Bit-Mapped Classifier]''. [[Byte Magazine#BYTE1112|BYTE, Vol. 11, No. 12]], pp. 161-172.
* [https://en.wikipedia.org/wiki/Subhash_Kak Subhash Kak] ('''1987'''). ''Patanjali and Cognitive Science''. [http://www.vitastapublishing.com/ Vitasta Publishing] <ref>[https://en.wikipedia.org/wiki/Patanjali Patanjali from Wikipedia]</ref>
* [[Alen Shapiro]] ('''1987'''). ''Structured Induction in Expert Systems''. Turing Institute Press in association with Addison-Wesley Publishing Company, Workingham, UK. ISBN 0-201-178133. [http://www.amazon.com/exec/obidos/ASIN/0201178133/acmorg-20 amazon]<ref>[[Dap Hartmann]] ('''1988'''). [[Alen Shapiro|Alen D. Shapiro]]: ''Structured Induction in Expert Systems''. [[ICGA Journal#11_4|ICCA Journal, Vol. 11, No. 4]]</ref>
* [[Stephen Muggleton]] ('''1988'''). ''Inductive Acquisition of Chess Strategies''. [http://www.doc.ic.ac.uk/%7Eshm/MI/mi11.html Machine Intelligence 11] (eds. [[Jean Hayes Michie]], [[Donald Michie]], and J. Richards), pp. 375-389. Clarendon Press, Oxford, U.K. ISBN 0-19-853718-2.
* [[Reiner Seidel]]('''1989'''). ''A Model of Chess Knowledge - Planning Structures and Constituent Analysis''. [[Advances in Computer Chess 5]]
* [[Hans Berliner]], [[Carl Ebeling]] ('''1989'''). ''Pattern Knowledge and Search: The SUPREM Architecture.'' Artificial Intelligence, Vol. 38, No. 2, pp. 161-198. ISSN 0004-3702.
: Revised as [[Hans Berliner]], [[Carl Ebeling]] ('''1990'''). ''Hitech''. [[Computers, Chess, and Cognition]]
* [[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1989'''). ''Measuring the Performance Potential of Chess Programs,'' [[Advances in Computer Chess 5]]
* [[Hermann Kaindl]] ('''1989'''). ''Towards a Theory of Knowledge''. [[Advances in Computer Chess 5]]
==1990 ...==
* [[Hans Berliner]], [[Gordon Goetsch]], [[Murray Campbell]], [[Carl Ebeling]] ('''1990'''). ''[http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6TYF-47WTT8W-3J&_user=10&_coverDate=04%2F30%2F1990&_rdoc=1&_fmt=high&_orig=search&_origin=search&_sort=d&_docanchor=&view=c&_searchStrId=1541914346&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=a43185e00b7d7d4550af0add28ff36b8&searchtype=a Measuring the Performance Potential of Chess Programs].'' Artificial Intelligence, Vol. 43, No. 1
* [[Kiyoshi Shirayanagi]] ('''1990'''). ''Knowledge Representation and its Refinement in Go Programs''. [[Computers, Chess, and Cognition]]
* [[Robert Levinson]], [[Feng-hsiung Hsu]], [[Tony Marsland]], [[Jonathan Schaeffer]], [[David Wilkins]] ('''1991'''). ''The Role of Chess in Artificial Intelligence Research''. [http://dli.iiit.ac.in/ijcai/IJCAI-91-VOL1/CONTENT/content.htm IJCAI 1991], [http://dli.iiit.ac.in/ijcai/IJCAI-91-VOL1/PDF/084.pdf pdf], also in [[ICGA Journal#14_3|ICCA Journal, Vol. 14, No. 3]], [http://www.ai.sri.com/%7Ewilkins/papers/chess-panel.pdf pdf]
* [[Christian Posthoff]], [[Michael Schlosser]], [[Jens Zeidler]] ('''1993'''). ''Search vs. Knowledge? - Search and Knowledge!'' In: Proc. 3rd KADS Meeting, Munich, March 8-9 1993, Siemens AG, Corporate Research and Development, 305-326, 1993.
* [[Steven Walczak]], [http://www.cise.ufl.edu/~ddd/ Douglas D. Dankel II] ('''1993'''). ''Acquiring Tactical and Strategic Knowledge with a Generalized Method for Chunking of Game Pieces''. International Journal of Intelligent Systems 8 (2), 249-270.
* [[Christian Posthoff]], [[Michael Schlosser]], [[Rainer Staudte]], [[Jens Zeidler]] ('''1994'''). ''Transformations of Knowledge''. [[Advances in Computer Chess 7]]
* [[Robert Levinson]], [[Gil Fuchs]] ('''1994'''). ''A Pattern-Weight Formulation of Search Knowledge''. UCSC-CRL-94-10, [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.1027 CiteSeerX]
==1995 ...==
* [[Richard Fikes]] ('''1996'''). ''Ontologies: What Are They, and Where's The Research?'' [http://www.informatik.uni-trier.de/~ley/db/conf/kr/kr96.html#Fikes96 KR 1996]
* [[Andreas Junghanns]], [[Jonathan Schaeffer]] ('''1997'''). ''Search versus knowledge in game-playing programs revisited''. [[Conferences#IJCAI1997|IJCAI-97]], Vol 1, [http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.32.168&rep=rep1&type=pdf pdf]
* [[Johannes Fürnkranz]] ('''1997'''). ''Knowledge Discovery in Chess Databases: A Research Proposal.'' Technical Report OEFAI-TR-97-33, Austrian Research Institute for Artificial Intelligence, [http://www.ke.informatik.tu-darmstadt.de/%7Ejuffi/publications/chess-ws.ps.gz zipped ps], [http://www.top-5000.nl/ps/Knowledge%20discovery%20in%20chess%20databases%20-%20a%20research%20proposal.pdf pdf] <ref>[https://en.wikipedia.org/wiki/Knowledge_discovery Knowledge discovery from Wikipedia]</ref>
* [[Krzysztof Krawiec]], [http://www.informatik.uni-trier.de/~ley/pers/hd/s/Slowinski:Roman.html Roman Slowinski], [http://www.informatik.uni-trier.de/~ley/pers/hd/s/Szczesniak:Irmina.html Irmina Szczesniak] ('''1998'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-69115-4_60 Pedagogical Method for Extraction of Symbolic Knowledge from Neural Networks]''. [http://link.springer.com/book/10.1007%2F3-540-69115-4 Rough Sets and Current Trends in Computing 1998]
* [[Edward John Quigley|Edward J. Quigley]], [http://www.ischool.pitt.edu/people/debons.php Anthony Debons] ('''1999'''). ''Interrogative Theory of Information and Knowledge''. [http://www.informatik.uni-trier.de/~ley/db/conf/sigcpr/sigcpr1999.html#QuigleyD99 SIGCPR '99], [http://www.thirdwave-websites.com/datainfoknow.pdf pdf]
==2000 ...==
* [[Michael Thielscher]] ('''2000'''). ''Representing the Knowledge of a Robot''. [http://www.informatik.uni-trier.de/~ley/db/conf/kr/kr2000.html#Thielscher00 KR 2000], [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.477 CiteSeerX]
* [[Krzysztof Krawiec]] ('''2002'''). ''[http://link.springer.com/article/10.1023/A:1020984725014 Genetic Programming-based Construction of Features for Machine Learning and Knowledge Discovery Tasks]''. [http://www.informatik.uni-trier.de/~ley/db/journals/gpem/gpem3.html#Krawiec02 Genetic Programming and Evolvable Machines, Vol. 3], No. 4
* [[Stuart Russell]], [[Peter Norvig]] ('''2003'''). ''[http://aima.cs.berkeley.edu/ Artificial Intelligence: A Modern Approach]'', 2nd edition, [http://books.google.com/books?id=8jZBksh-bUMC&dq=isbn:0137903952&hl=en 3rd edition 2009]
* [[Stuart Russell]] ('''2003'''). ''Rationality and Intelligence.'' In Renee Elio (Ed.), Common sense, reasoning, and rationality, Oxford University Press, [http://www.cs.berkeley.edu/%7Erussell/papers/aij-cnt.pdf pdf]
* [[Aleksander Sadikov]], [[Ivan Bratko]], [[Igor Kononenko]] ('''2003'''). ''Search versus Knowledge: An Empirical Study of Minimax on KRK''. [[Advances in Computer Games 10]], [http://www.ailab.si/sasha/acg2003.pdf pdf]
* [[Tristan Caulfield]] ('''2004'''). ''Acquiring and Using Knowledge in Computer Chess''. BSc Computer Science, [https://en.wikipedia.org/wiki/University_of_Bath University of Bath], [http://opus.bath.ac.uk/16854/1/CSBU pdf]
* [http://people.virginia.edu/~ema3z/ Elias M. Awad], [http://www.goodreads.com/author/show/4245178.Hassan_Ghaziri Hassan M. Ghaziri] ('''2004,2010'''). ''Knowledge Management Systems''. [http://www.pearsoned.co.in/web/books/9788131714034_Knowledge-Management_Hassan-M-Ghaziri.aspx Pearson Education India], [http://turing.une.edu.au/~comp292/Lectures/HEADER_KM_2004_LEC_NOTES/HEADER_KM_2004_LEC_NOTES.html Knowledge Management Systems - Lecture Notes], [http://www.latex2html.org/ LaTeX2HTML] by [http://www.astro.ku.dk/software/latex2html/manual/manual.html Nikos Drakos], [http://maths.mq.edu.au/~ross/ Ross Moore]
* [[Nick Pelling]] ('''2004'''). ''[http://www.nickpelling.com/dissertation/ The Network Is The Knowledge: Ideology & Strategy in Mintzberg's Ten Schools]''. [https://en.wikipedia.org/wiki/Master_of_Business_Administration MBA] dissertation, [https://en.wikipedia.org/wiki/Kingston_University Kingston University] [https://en.wikipedia.org/wiki/Kingston_Business_School Business School], [https://en.wikipedia.org/wiki/Surrey Surrey], UK
==2005 ...==
* [[Christian Posthoff]], [[Michael Schlosser]] ('''2005'''). ''[http://link.springer.com/chapter/10.1007%2F3-540-60217-8_17 Optimal strategies — Learning from examples — Boolean equations]''. in [https://www.researchgate.net/profile/Klaus_Jantke Klaus P. Jantke], [https://www.fbi.h-da.de/organisation/personen/lange-steffen.html Steffen Lange] (eds.) ('''2005'''). [http://link.springer.com/book/10.1007/3-540-60217-8 Algorithmic Learning for Knowledge-Based Systems], [https://en.wikipedia.org/wiki/Lecture_Notes_in_Computer_Science Lecture Notes in Computer Science] 961, [https://en.wikipedia.org/wiki/Springer_Science%2BBusiness_Media Springer]
* [[Aleksander Sadikov]], [[Ivan Bratko]] ('''2006'''). ''[http://link.springer.com/chapter/10.1007/978-3-540-75538-8_15 Search Versus Knowledge Revisited Again]''. [[CG 2006]]
* [[David J. Stracuzzi]] ('''2006'''). ''[http://scholarworks.umass.edu/dissertations/AAI3242366/ Scalable Knowledge Acquisition through Cumulative Learning and Memory Organization]''. Ph.D. thesis, [https://en.wikipedia.org/wiki/University_of_Massachusetts_Amherst University of Massachusetts Amherst], advisor [[Paul E. Utgoff]], [http://stracuzzi.info/david/manuscripts/dissertation06.pdf pdf]
* [[Guillaume Chaslot]], [[Louis Chatriot]], [[Christophe Fiter]], [[Sylvain Gelly]], [[Jean-Baptiste Hoock]], [[Julien Pérez]], [[Arpad Rimmel]], [[Olivier Teytaud]] ('''2008'''). ''Combining expert, offline, transient and online knowledge in Monte-Carlo exploration''. [http://www.lri.fr/~teytaud/eg.pdf pdf]
* [[Guillaume Chaslot]], [[Christophe Fiter]], [[Jean-Baptiste Hoock]], [[Arpad Rimmel]], [[Olivier Teytaud]] ('''2009'''). ''Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search''. [[Advances in Computer Games 12]], [http://www.personeel.unimaas.nl/g-chaslot/papers/acg09.pdf pdf], [http://www.lri.fr/~rimmel/publi/EK_explo.pdf pdf]
==2010 ...==
* [[Matej Guid]] ('''2010'''). ''Search and Knowledge for Human and Machine Problem Solving'', Ph.D. thesis, [[University of Ljubljana]], [http://eprints.fri.uni-lj.si/1113/1/Matej__Guid.disertacija.pdf pdf] <ref>[[Dap Hartmann]] ('''2010'''). ''How can Humans learn from Computers?'' Review on [[Matej Guid|Matej Guid's]] Ph.D. thesis, [[ICGA Journal#33_4|ICGA Journal, Vol. 33, No. 4]]</ref>
* [[Shi-Jim Yen]], [[Jung-Kuei Yang]], [[Kuo-Yuan Kao]], [[Tai-Ning Yang]] ('''2012'''). ''[http://www.sciencedirect.com/science/article/pii/S0950705112001293 Bitboard Knowledge Base System and Elegant Search Architectures for Connect6]''. [https://www.journals.elsevier.com/knowledge-based-systems/ Knowledge-Based Systems], Vol. 34
* [[Bo-Nian Chen]], [[Hung-Jui Chang]], [[Shun-Chin Hsu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2013'''). ''Multilevel Inference in Chinese Chess Endgame Knowledge Bases''. [[ICGA Journal#36_4|ICGA Journal, Vol. 36, No. 4]] » [[Chinese Chess]], [[Endgame Tablebases]]
* [[Bo-Nian Chen]], [[Hung-Jui Chang]], [[Shun-Chin Hsu]], [[Jr-Chang Chen]], [[Tsan-sheng Hsu]] ('''2014'''). ''Advanced Meta-knowledge for Chinese Chess Endgame Knowledge Bases''. [[ICGA Journal#37_1|ICGA Journal, Vol 37, No. 1]]
==2015 ...==
* [[Tamal T. Biswas]], [[Kenneth Wingate Regan|Kenneth W. Regan]] ('''2015'''). ''Quantifying Depth and Complexity of Thinking and Knowledge''. [http://www.icaart.org/EuropeanProjectSpace.aspx?y=2015 ICAART 2015], [http://www.cse.buffalo.edu/~regan/papers/pdf/BiReICAART15CR.pdf pdf]
=Forum Posts=
==1996 ...==
* [https://groups.google.com/d/msg/rec.games.chess.computer/47bgYzU2kyQ/BKAn9pqUtogJ Incoporating chess knowledge in chess programs] by [[Valavan Manohararajah]], [[Computer Chess Forums|rgcc]], June 26, 1996
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/99eec6923b0481db computer chess "oracle" ideas...] by [[Robert Hyatt]], [[Computer Chess Forums|rgcc]], April 1, 1997 » [[Oracle]]
* [https://www.stmintz.com/ccc/index.php?id=20531 Knowledge is not elegant] by [[Don Dailey]], [[CCC]], June 14, 1998
* [http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/e917da2d88146756 The end of computer chess progress?] by [[Ed Schroder|Ed Schröder]], [[Computer Chess Forums|rgcc]], March 06, 1999
* [https://www.stmintz.com/ccc/index.php?id=77234 The Limits of Positional Knowledge] by Michael Neish from [[CCC]], November 11, 1999
==2000 ...==
* [https://www.stmintz.com/ccc/index.php?id=261167 suggestions for (a new generation of) chess knowledge using engines] by [[Ingo Lindam]], [[CCC]], October 23, 2002
* [https://www.stmintz.com/ccc/index.php?id=261636 likelihood instead of pawnunits? + chess knowledge] by [[Ingo Lindam]], [[CCC]], October 25, 2002
* [https://www.stmintz.com/ccc/index.php?id=389133 Knowledge] by [[Sergei Markoff|Sergei S. Markoff]], [[CCC]], September 26, 2004
==2005 ...==
* [https://www.stmintz.com/ccc/index.php?id=480599 The superior Rybka chess knowledge] by [[Chrilly Donninger]], [[CCC]], January 18, 2006 » [[Rybka]]
* [https://www.stmintz.com/ccc/index.php?id=486851 knowledge and blitz; search and long games] by Joseph Ciarrochi, [[CCC]], February 15, 2006
* [http://www.hiarcs.net/forums/viewtopic.php?t=402 Search or Evaluation?] by [[Ed Schroder|Ed Schröder]], [[Computer Chess Forums|Hiarcs Forum]], October 05, 2007 » [[Search]], [[Evaluation]]
: [http://www.hiarcs.net/forums/viewtopic.php?p=2944 Re: Search or Evaluation?] by [[Mark Uniacke]], [[Computer Chess Forums|Hiarcs Forum]], October 14, 2007
==2010 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=36031 hardware advances - a different perspective] by [[Robert Hyatt]], [[CCC]], September 09, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=36040 old crafty vs new crafty on new hardware] by [[Robert Hyatt]], [[CCC]], September 11, 2010 » [[Crafty]]
* [http://www.talkchess.com/forum/viewtopic.php?t=36050 Crafty tests show that Software has advanced more] by [[Don Dailey]], [[CCC]], September 12, 2010
* [http://www.talkchess.com/forum/viewtopic.php?t=36059 Final results - Crafty - hardware vs software] by [[Robert Hyatt]], [[CCC]], September 13, 2010 » [[Crafty]]
* [http://www.talkchess.com/forum/viewtopic.php?t=36058 Deep Blue vs Rybka] by [[Don Dailey]], [[CCC]], September 13, 2010 » [[Deep Blue]], [[Rybka]]
* [http://www.talkchess.com/forum/viewtopic.php?t=36088 hardware doubling number for Crafty] by [[Robert Hyatt]], [[CCC]], September 15, 2010 » [[Crafty]]
* [http://www.talkchess.com/forum/viewtopic.php?t=40166 Ahhh... the holy grail of computer chess] by [[Marcel van Kervinck]], [[CCC]], August 23, 2011
* [http://www.talkchess.com/forum/viewtopic.php?t=48743 Is search irrelevant when computing ahead of very big trees?] by [[Fermin Serrano]], [[CCC]], July 24, 2013 » [[Search]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49190 Improve the search or the evaluation?] by [[Jens Bæk Nielsen]], [[CCC]], August 31, 2013 » [[Knowledge#SearchVersusEvaluation|Search versus Evaluation]]
* [http://www.talkchess.com/forum/viewtopic.php?t=49906 Slow Searchers?] by Michael Neish, [[CCC]], November 02, 2013
* [http://www.talkchess.com/forum/viewtopic.php?t=54697 Chessprogams with the most chessknowing] by Joe Boden, [[CCC]], December 19, 2014
==2015 ...==
* [http://www.talkchess.com/forum/viewtopic.php?t=55752 An attempt to measure the knowledge of engines] by [[Kai Laskos]], [[CCC]], March 23, 2015
* [http://www.talkchess.com/forum/viewtopic.php?t=54697&start=44 Re: Chessprogams with the most chessknowing] by [[Vincent Lejeune]], [[CCC]], February 18, 2017
: [http://www.talkchess.com/forum/viewtopic.php?t=54697&start=46 Re: Chessprogams with the most chessknowing] by [[Alvaro Cardoso]], [[CCC]], February 18, 2017
: [http://www.talkchess.com/forum/viewtopic.php?t=54697&start=47 Re: Chessprogams with the most chessknowing] by [[Mark Lefler]], [[CCC]], February 18, 2017 » [[Komodo]]
: [http://www.talkchess.com/forum/viewtopic.php?t=54697&start=50 Re: Chessprogams with the most chessknowing] by [[Marco Costalba]], [[CCC]], February 19, 2017 » [[Stockfish]]
=External Links=
==Knowledge==
* [https://en.wikipedia.org/wiki/Knowledge Knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_acquisition Knowledge acquisition from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_discovery Knowledge discovery from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_engineering Knowledge engineering from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_Engineering_Environment Knowledge Engineering Environment from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_extraction Knowledge extraction from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_management Knowledge management from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_representation_and_reasoning Knowledge representation and reasoning from Wikipedia]
* [https://en.wikipedia.org/wiki/Knowledge_transfer Knowledge transfer from Wikipedia]
==Related Topics==
* [https://en.wikipedia.org/wiki/Awareness Awareness from Wikipedia]
* [https://en.wikipedia.org/wiki/Belief Belief from Wikipedia]
* [https://en.wikipedia.org/wiki/Cognition Cognition from Wikipedia]
* [https://en.wikipedia.org/wiki/Consciousness Consciousness from Wikipedia]
* [https://en.wikipedia.org/wiki/Data_mining Data mining from Wikipedia]
* [https://en.wikipedia.org/wiki/Epistemology Epistemology from Wikipedia]
* [https://en.wikipedia.org/wiki/Experience Experience from Wikipedia]
* [https://en.wikipedia.org/wiki/Expert Expert from Wikipedia]
* [https://en.wikipedia.org/wiki/Expert_system Expert system from Wikipedia]
* [https://en.wikipedia.org/wiki/Imagination Imagination from Wikipedia]
* [https://en.wikipedia.org/wiki/Instinct Instinct from Wikipedia]
* [https://en.wikipedia.org/wiki/Intelligence Intelligence from Wikipedia]
* [https://en.wikipedia.org/wiki/Intuition_%28philosophy%29 Intuition (philosophy) from Wikipedia]
* [https://en.wikipedia.org/wiki/Intuition_%28psychology%29 Intuition (psychology) from Wikipedia]
* [https://en.wikipedia.org/wiki/Learning Learning from Wikipedia]
* [https://en.wikipedia.org/wiki/Mind Mind from Wikipedia]
* [https://en.wikipedia.org/wiki/Ontology_%28information_science%29 Ontology (information science) from Wikipedia]
* [https://en.wikipedia.org/wiki/Paradigm Paradigm from Wikipedia]
* [https://en.wikipedia.org/wiki/Philosophy Philosophy from Wikipedia]
* [https://en.wikipedia.org/wiki/Philosophy_of_mind Philosophy of mind from Wikipedia]
* [https://en.wikipedia.org/wiki/Psychology Psychology from Wikipedia]
* [https://en.wikipedia.org/wiki/Science Science from Wikipedia]
* [https://en.wikipedia.org/wiki/Scientia_potentia_est Scientia potentia est - knowledge is power - Wikipedia]
* [https://en.wikipedia.org/wiki/Skill Skill from Wikipedia]
* [https://en.wikipedia.org/wiki/Thought Thought from Wikipedia]
* [https://en.wikipedia.org/wiki/Understanding Understanding from Wikipedia]
==Types of Knowledge==
* [https://en.wikipedia.org/wiki/A_priori_and_a_posteriori A priori and a posteriori from Wikipedia]
* [https://en.wikipedia.org/wiki/Common_knowledge Common knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Common_knowledge_%28logic%29 Common knowledge (logic) from Wikipedia]
* [http://decisionautomation.com/glossary/14.php Declarative Knowledge] from [http://decisionautomation.com/ Decision Automation Resources]
* [https://en.wikipedia.org/wiki/Descriptive_knowledge Descriptive knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Dispersed_knowledge Dispersed knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Distributed_knowledge Distributed knowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Metaknowledge Metaknowledge from Wikipedia]
* [https://en.wikipedia.org/wiki/Mutual_knowledge_%28logic%29 Mutual knowledge (logic) from Wikipedia]
* [https://en.wikipedia.org/wiki/Procedural_knowledge Procedural knowledge from Wikipedia]
* [http://www.ehhs.cmich.edu/%7Ermscott/643declarative.html Teaching Declarative Knowledge] by [http://www.ehhs.cmich.edu/%7Ermscott/index.html Renay M. Scott]
==Musicvideo==
* <span id="youknow"></span>[[Videos#MahavishnuOrchestra|Mahavishnu Orchestra]] - [https://en.wikipedia.org/wiki/The_Inner_Mounting_Flame You Know You Know], August 17, 1972, more recent [https://en.wikipedia.org/wiki/3sat 3Sat] broadcast <ref>Original [https://en.wikipedia.org/wiki/ZDF ZDF] broadcast "[https://de.wikipedia.org/wiki/ZDF_Sonntagskonzert Sonntagskonzert]", September 17, 1972, recorded at [http://www.abendzeitung-muenchen.de/inhalt.deutsches-museum-kongresshalle-wird-zur-event-location-gaudi-und-tralala.0fbdbcaa-3122-4466-a8b3-69a7de1bde68.html Kongresshalle] [https://en.wikipedia.org/wiki/Deutsches_Museum Deutschen Museum], [https://en.wikipedia.org/wiki/Munich Munich], "Jazz Now", August 17, 1972, curator [http://alchetron.com/Joachim-Ernst-Berendt-780489-W Joachim-Ernst Berendt], see [http://www.bathedinlightning.com/bonus%20material/the_mahavishnu_orchestra_on_film.html The Mahavishnu Orchestra On Film], [http://www.embryo.de/MUENCHEN-72_KPL.pdf MUENCHEN-72_KPL.pdf], [http://www.spiegel.de/spiegel/print/d-42891878.html Diese Woche im Fernsehen], [https://en.wikipedia.org/wiki/Der_Spiegel Der Spiegel] 38/1972 (German), [https://en.wikipedia.org/wiki/1972_Summer_Olympics 1972 Summer Olympics]</ref>, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: [[Videos#JohnMcLaughlin|John McLaughlin]], [[Videos#BillyCobham|Billy Cobham]], [https://en.wikipedia.org/wiki/Rick_Laird Rick Laird], [[Videos#JanHammer|Jan Hammer]], [https://en.wikipedia.org/wiki/Jerry_Goodman Jerry Goodman]
: {{#evu:https://www.youtube.com/watch?v=ujcYw2QTPzM|alignment=left|valignment=top}}
=References=
<references />
'''[[Main Page|Up one Level]]'''
[[Category:Samuel Bak]]
