



|
|
Byron's CSC212 Web Site
|
Class Notes
Monday September 11 , 2000
|
|
|
Goal Directed Programming
Class Notes --
Monday September 11 , 2000
CSC212 - September 11, 2000
======================================
Lecture Topic: GOAL DIRECTED PLANNING
DEF: GOAL DIRECTED PLANNING is the problem solving
strategy of first identifying a goal.
1. Identify a goal.
2. Determine the information needed to achieve
the goal.
3. Establish as subgoals the problems of securing
the information needed to achieve the goal.
4. "Recursively" apply this same method to the
problems established as subgoals.
Another Problem:
The squares in the folowing figure are congruent.
Their collective area is 187.32 sq. units.
__
|__|__
|__|__|__
|__|__|__|__
|__|__|__|__|__
|__|__|__|__|__|
What is the perimeter of the figure?
Remark:
This problem can be readily solved by the application
of the problem solving symbology known as
"Goal Directed Planning".
Remark:
Goal Directed Planning is a "Procedural" variant of
Problem Decomposition, which was discussed last class.
Declaritive vs Procedural
=========================================================
123456789112345678921234567893123456789412345678951234567
|
|
|