Pattern-based representation of chess end-game knowledge
Bratko, L. | Kopec, D. | Michie, D.
Master skill--operational in the sense-t'hat it can be run on Another form of the'Master skill' aspiration aims at correct'strong mastery' in this sense is attainable for the complete None of the above listed endgames contains anything problematical from a Master's point of view and computer programs Using a vocabulary which is defined in Kmoch's (1959) 'An enemy pawn ahead on the same file is a counterpawn, Some of these relations may be very useful if developed further. For expmple, if a pawn is'overloaded', in that it is pefforming Defence Diagram, see Figure 1). A rule is applied'to a position (in a manner familiar to'forcing tree' that guarantees the achievement of better-goals The'and-or' tree search, carried out by module 1 of the AU Figure 1 The ADD corresponding to the position shown in Figure 1. The Computer Journal ' HOW DIFFICULT IS THE KNKR PROBLEM? Longest variation in Fine before capture of the Knight: 24 moves; longest known variation 27 moves.
Feb-1-1978
- Country:
- Europe (0.46)
- Industry:
- Leisure & Entertainment > Games > Chess (1.00)
- Technology:
- Information Technology > Artificial Intelligence
- Games > Chess (0.70)
- Representation & Reasoning > Search (0.68)
- Information Technology > Artificial Intelligence