N.N.

N.N. ||~   || **N.N.**, an experimental chess system to select reasonable moves in quiet middlegame positions, developed by Bernd Owsnicki and Kai von Luck at University of Hamburg, written in LISP as subject of their Ph.D. theses, further introduced 1984 at the Advances in Computer Chess 4 conference. N.N. is based on hierarchically structured chess knowledge, conceptional divided into three main components, the [|knowledge bases], the planning system, and various dynamic data structures. The knowledge bases represent positional knowledge and associate classes of 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 and the elementary endgame KPK. Three typical areas of possible errors were mentioned - each with its own cause and each with a different level of solvability, 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 : 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 > >  >
 * Home * Engines * N.N.**
 * = 

=Etymology= "N. N." is commonly used in the notation of chess games, not only when one participant's name is genuinely unknown but when an untitled player faces a master, as in a [|simultaneous exhibition]. Another reason is to protect a known player from the insult of a painful defeat.

=See also=
 * Acronym
 * Planning

=Publications=
 * Kai von Luck, Bernd Owsnicki (**1981**). //[|Structures for Knowledge-Based Chess Programs]//. in [|Siekmann] (Ed.), Proc. of [|GWAI-81]
 * Kai von Luck, Bernd Owsnicki (**1982**). //[|N.N.: A View of Planning in Chess]//. in [|Wahlster] (Ed.), Proc. of [|GWAI-82]
 * 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, Kai von Luck (**1986**). //N.N.: A Case Study in Chess Knowledge Representation//. Advances in Computer Chess 4

=External Links=
 * [|Nomen nescio from Wikipedia]
 * [|nomen nescio - Wiktionary]
 * [|No Name from Wikipedia]

=References= =What links here?= include page="N.N." component="backlinks" limit="20"
 * Up one Level**