Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Paper #100
June 16 1967
CH4PTER VI
systesis whose heuristics gave th&m some efficacy in particular task environ-
between their two task environments; in particular, that both task environ-*
ments can be represented as large mazes th&t most be searched very selec-
produced moves of particular types that are known, from chess experience,
to be often effectives developing moves, attacking moves, defending moves ,
pawn moves to control center squares 9 checking moves, and so on. To bs
sure, underlying some of these chess heuristics are general concepts (e.g,*
mobility) that are relevant is iraay competitive situations. These more
general concepts were net used as euch s however, in any of the prograa^s,
but were defined in specific terms appropriate to the game of chess.
In sum, many of the heuristics of LT might be made to carry over,
with little change, into other task environments; fewer of the heuristics
in the chess programs (other than the general se&reh-and-scan strategy)
appear to have direct applicability to other task environments<,
All the experience with chess programs suggests that they must be
provided with specific as well as general heuristics to play a tolerable,
saueh lens a good, game of chess. Nevertheless, heuristics that are general-
over and above its capabilities for handling specific environments for
which it has specific heuristics»
It is generally conceived that normal human beings possess some
measure of general intelligence in this sense seme human beings more than
others« When a subject is brought into the psychological laboratory
or an examination roc a, and confronted with a task somewhat different frctc*
any he has seen be /re, he does not behave randomly 0 His behavior grad-
sou-Id do human tasks in a somewhat humanoid manner (log., *>y u»iug highly
selective search instead of bruta force or systematic algorithms), but to
psroducd one that weald sicsslafe in some detail the processes that people
use to solve problems in a relatively novel task domain»
We need not r«df*e the issue b.ere s debated arsrr^ factor cisslysts,
there is a single factor that accounts for general intelligence, or
and if the latter, whether any one of these is completely general. Even
if we hypothesize a plurality of factors, most of these are not completely
specific to particular task environments.
GIF #100 - &-
2J Many of the ideas in this section are treated more fully in Newell and
Ernst (1965) and Ernst and Newell (1967).
CIF #100 -3-
External Representation
Two ideas hav« been explored for presenting problems to the problem-
solving system as flexibly and "naturally" as possible. One of these is
to use natural language inputs. This is the way that those real-world prob-
lems come to us which are not sensed directly, hence a system prepared to
accept natural-language problem statements can deal with though not nec-
essarily successfully problems of that broad class.
Another attractive input language is one that simulates the stimuli
of visual perception. Visual stimuli, except those produced by strings of
letters or the like, are notoriously hard to describe in language. One
might hope that a problem solver equipped to accept both visual and natural-
language inputs would be prepared for most of the kinds of problems that
arise in th© real world.
Char own research has been only marginal 1j concerned with the gen-
erality of input languages,, so we will put these questions aside here, al-
though we will have something to say about aatuxal-language inputs in
later chapters«
Problem-Solving Techniques
been developed in the previous t&o chapters may be called heuristic search 0
In heuristic search there ai*e two basic kinds of entities: objects and
operatorso A problem to be solved is stated by specifying or describings
(1) an initial situation represented as an object, (2) a desired situation
represented as an object, and (3) a set of operators capable of acting on
objectSo The problem then is to find a sequence of operators whose suc-
cessive application will transform the initial situation into the desired
situation.
The oparators genera£e ne-sr ebj*ets» fr?™ ol-d, ttiwti define a trees
of. objectss each node of the tree representing an object, and each branch
CIP $100 -35-
Conclusioa
©hall try to evaluate how far this program, and to a lesser extent the
programs discussed in previous chapters, can serve as a theory of human
problem solving»