Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!decvax!decwrl!ucbvax!A.CS.CMU.EDU!Elaine.Atkinson
From: Elaine.Atkinson@A.CS.CMU.EDU.UUCP
Newsgroups: mod.ai
Subject: Seminar - Representations and Checkerboards (CMU)
Message-ID: <8609210655.AA13434@ucbvax.Berkeley.EDU>
Date: Wed, 10-Sep-86 10:19:00 EDT
Article-I.D.: ucbvax.8609210655.AA13434
Posted: Wed Sep 10 10:19:00 1986
Date-Received: Sun, 21-Sep-86 20:30:45 EDT
Sender: daemon@ucbvax.BERKELEY.EDU
Organization: The ARPA Internet
Lines: 18
Approved: ailist@sri-stripe.arpa

SPEAKER:  Craig Kaplan, CMU, Psychology Department
  TITLE:  "Representations and Checkerboards"
   DATE:  Thursday, September 11
   TIME:  4:00 p.m.
  PLACE:  Adamson Wing, BH

	Given the right representation, tricky "insight" problems
often become trivial to solve.  How do people arrive at the right
representations?  What factors affect people's ability to shift
representations, and how can understanding these factors help us
understand why insight problems are so difficult?
 
	 Evidence from studies using the Mutilated Checkerboard
Problem points to Heuristic Search as a powerful way of addressing
these questions.  Specifically, it suggest that the quality of
the match between people's readily available search heuristics
and problem characteristics is a major determinant of problem
difficulty for some problems.