Artificial IntelligenceMcGraw-Hill, 1991 - 621 páginas |
Dentro del libro
Resultados 1-3 de 40
Página 30
... Chess Move For the problem " Play chess , " it is fairly easy to provide a formal and complete problem description . The starting position can be described as an 8 - by - 8 array where each position contains a symbol standing for the ...
... Chess Move For the problem " Play chess , " it is fairly easy to provide a formal and complete problem description . The starting position can be described as an 8 - by - 8 array where each position contains a symbol standing for the ...
Página 31
... Chess Moves then play chess by starting at an initial state , using a set of rules to move from one state to another , and attempting to end up in one of a set of final states . This state space representation seems natural for chess ...
... Chess Moves then play chess by starting at an initial state , using a set of rules to move from one state to another , and attempting to end up in one of a set of final states . This state space representation seems natural for chess ...
Página 600
... Chess 4.5 - the Northwestern University chess program . In Chess Skill in Man and Machine , ed . P. W. Frey . New York : Springer - Verlag . Slocum , J. 1988. Machine Translation Systems . Cambridge : Cambridge University Press ...
... Chess 4.5 - the Northwestern University chess program . In Chess Skill in Man and Machine , ed . P. W. Frey . New York : Springer - Verlag . Slocum , J. 1988. Machine Translation Systems . Cambridge : Cambridge University Press ...
Contenido
Weak SlotandFiller Structures | 9 |
6 | 24 |
Heuristic Search Techniques | 63 |
Derechos de autor | |
Otras 24 secciones no mostradas
Otras ediciones - Ver todas
Términos y frases comunes
Abbott algorithm answer apply approach Artificial Intelligence assertions attributes axioms backpropagation backtracking backward backward reasoning belief best-first search breadth-first search Cabot Caesar Chapter clauses concept consider constraints contains contexts contradiction corresponding define depth-first depth-first search described discussed domain example explicitly fact given goal graph heuristic heuristic function Horn clauses important inference inheritance input instance interpretation justification knowledge base knowledge representation labeled learning logical assertions Marcus match move MYCIN node nonmonotonic reasoning object operators particular path perceptron possible preconditions predicate logic problem problem-solving procedure produce production system PROLOG propagation propositional logic question represent resolution result robot rules Section semantic semantic net sentence shown in Figure simple slot solution solve space specific statements step strategy structure Suppose suspect syntactic task techniques theorem things tree true truth maintenance system variables wff's