Older Version
Newer Version
GerdIsenberg
Jan 20, 2018
**[[Home]] * [[Engines]] * N.N.**
||= <span style="display: block; text-align: center;"><span style="font-family: Comic Sans MS,cursive; font-size: 200%;"> </span>
</span><span style="display: block; text-align: center;"><span style="font-family: Comic Sans MS,cursive; font-size: 500%;">N.N.</span></span> ||~ || **N.N.**,
an experimental chess system to select reasonable moves in quiet [[Middlegame|middlegame]] positions, developed by [[Bernd Owsnicki-Klewe|Bernd Owsnicki]] and [[Kai von Luck]] at [[University of Hamburg]], written in [[LISP]] as subject of their Ph.D. theses <ref>[[Alexander Reinefeld]] (**1985**). [[Kai von Luck]]: //Aspekte wissensgestützter Planung//. [[Bernd Owsnicki-Klewe|Bernd Owsnicki]]: //Repräsentation von positionellem Schachwissen mit Techniken der künstlichen Intelligenz//. [[ICGA Journal#8_4|ICCA Journal, Vol. 8, No. 4]]</ref>, further introduced 1984 at the [[Advances in Computer Chess 4]] conference <ref>[[Bernd Owsnicki-Klewe|Bernd Owsnicki]], [[Kai von Luck]] (**1986**). //N.N.: A Case Study in Chess Knowledge Representation//. [[Advances in Computer Chess 4]]</ref>. N.N. is based on hierarchically structured [[Knowledge|chess knowledge]], conceptional divided into three main components, the [[https://en.wikipedia.org/wiki/Knowledge_base|knowledge bases]], the [[Planning|planning system]], and various dynamic data structures. The knowledge bases represent positional knowledge and associate classes of [[Pawn Structure|pawn structure]] with plans and actions. The planning system directs the evaluation of plans. Each plan is associated with some specific formation and has to be verified dynamically in a concept tree in order to overcome problems resulting from erroneous assumptions about the character of the position. At the conference, two distinct areas of planning were demonstrated, [[Minority Attack|minority attack]] and the elementary endgame [[KPK]] <ref>[[Jaap van Oosterwijk Bruyn]] (**1984**). //The Fourth Conference on Advances in Computer Chess//. [[ICGA Journal#7_2|ICCA Journal, Vol. 7, No. 2]]</ref>. Three typical areas of possible errors were mentioned - each with its own cause and each with a different level of solvability <ref>[[Dap Hartmann]] (**1987**). [[http://portal.acm.org/citation.cfm?id=1057627|Book review: Advances in Computer Chess 4]] from [[http://portal.acm.org/portal.cfm|ACM Portal]]</ref>, errors in a particular knowledge base, errors from design decisions, typically about the interaction of distinct instances in the concept tree, and errors in the semantic of planning. ||
[[toc]]
=Dynamic Behavior=
A sketch of N.N.'s dynamic behavior, considerably simplified <ref>Diagram edited from [[Kai von Luck]], [[Bernd Owsnicki-Klewe|Bernd Owsnicki]] (**1982**). //[[https://link.springer.com/chapter/10.1007%2F978-3-642-68826-3_8|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]] (Ed.), Proc. of [[http://www.informatik.uni-trier.de/%7Eley/db/conf/ki/gwai1982.html|GWAI-82]], Fig. 1, pp. 93</ref>:
[[code]]
Knowledge Bases Processes Knowledge Bases
┌────────────────┐ ╓────────────────╖ ┌────────────────┐
│ Prototype │ ║ Net ║ │ Discrimination │
│ Frames │ ┌─►║ Interpreter ║◄────│ Net │
└────────────────┘ │ ╙────────────────╜ └────────────────┘
model │ classes of classification
knowledge │ a given knowledge
. │ position
. │ ║
▼ │ ▼
┌────────────────┐ │ ╓────────────────╖ ┌────────────────┐
│ Instance │──┘ ║ Task ║◄────│ Action │
│ Frames │◄─┐ ║ Scheduler ║ ┌──│ Scripts │
└────────────────┘ │ ╙────────────────╜ │ └────────────────┘
position │ trigger of │ plan
knowledge │ appropriate │ knowledge
│ scripts │
│ ║ │
│ ▼ │
│ ╓────────────────╖ │ ┌────────────────┐
└─►║ Task ║◄─┘ │ Concept │
║ Scheduler ║────►│ Tree │
╙────────────────╜ └────────────────┘
concretization concrete plan
of scripts
[[code]]
> {{──► [[https://en.wikipedia.org/wiki/Information_flow_(information_theory)|information flow]]}}
> {{══► [[https://en.wikipedia.org/wiki/Control_flow|control flow]]}}
> {{··► [[https://en.wikipedia.org/wiki/Inheritance_(object-oriented_programming)|inheritance]]}}
=Etymology=
"N. N." is commonly used in the [[Game Notation|notation]] of [[Chess Game|chess games]] <ref>[[https://en.wikipedia.org/wiki/David_Vincent_Hooper|David Hooper]], [[https://en.wikipedia.org/wiki/Ken_Whyld|Kenneth Whyld]] (**1992**). //[[https://en.wikipedia.org/wiki/The_Oxford_Companion_to_Chess|The Oxford Companion to Chess]]//. 2nd ed., [[https://en.wikipedia.org/wiki/Oxford_University_Press|Oxford University Press]], p. 274</ref>, not only when one participant's name is genuinely unknown but when an untitled player faces a master, as in a [[https://en.wikipedia.org/wiki/Simultaneous_exhibition|simultaneous exhibition]]. Another reason is to protect a known player from the insult of a painful defeat <ref>[[https://en.wikipedia.org/wiki/Nomen_nescio|Nomen nescio from Wikipedia]]</ref> .
=See also=
* [[Various Classifications#Acronym|Acronym]]
* [[Planning]]
=Publications=
* [[Kai von Luck]], [[Bernd Owsnicki-Klewe|Bernd Owsnicki]] (**1981**). //[[https://link.springer.com/chapter/10.1007/978-3-662-02328-0_27|Structures for Knowledge-Based Chess Programs]]//. in [[http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/s/Siekmann:J=ouml=rg_H=.html|Siekmann]] (Ed.), Proc. of [[http://www.informatik.uni-trier.de/%7Eley/db/conf/ki/gwai1981.html|GWAI-81]]
* [[Kai von Luck]], [[Bernd Owsnicki-Klewe|Bernd Owsnicki]] (**1982**). //[[https://link.springer.com/chapter/10.1007%2F978-3-642-68826-3_8|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]] (Ed.), Proc. of [[http://www.informatik.uni-trier.de/%7Eley/db/conf/ki/gwai1982.html|GWAI-82]]
* [[Bernd Owsnicki-Klewe|Bernd Owsnicki]] (**1985**). //Repräsentation von positionellem Schachwissen mit Techniken der künstlichen Intelligenz//. Ph.D. thesis, [[University of Hamburg]] (German)
* [[Kai von Luck]] (**1985**). //Aspekte wissensgestützter Planung//. Ph.D. thesis, [[University of Hamburg]] (German)
* [[Bernd Owsnicki-Klewe|Bernd Owsnicki]], [[Kai von Luck]] (**1986**). //N.N.: A Case Study in Chess Knowledge Representation//. [[Advances in Computer Chess 4]]
=External Links=
* [[https://en.wikipedia.org/wiki/Nomen_nescio|Nomen nescio from Wikipedia]]
* [[https://en.wiktionary.org/wiki/nomen_nescio|nomen nescio - Wiktionary]]
* [[https://en.wikipedia.org/wiki/No_Name|No Name from Wikipedia]]
=References=
<references />
=What links here?=
[[include page="N.N." component="backlinks" limit="20"]]
**[[Engines|Up one Level]]**