Stuvia.com - The study-notes marketplace
GRADED A+!! COS3751 EXAM
SOLUTIONS (QUESTIONS
&SOLUTIONS)
Contains The Following Exam Papers: 2018-06, 2017-
10, 2017-06, 2016-06, Practice Paper 1, Practice Paper
2
2018-06
A Rational Agent Is An Agent That Acts In Order To Achieve The Best Outcome, Or Where There Is
Uncertainty, The Best-Expected Outcome. Conceptually Speaking, It Does The “Right Thing”.
Fully Observable, Because The Players’ Sensors Give It Access To The Complete State Of
Downloaded by: stuvia7feva | Want to earn
Distribution of this document is illegal R13,625 per year?
, Stuvia.com - The study-notes marketplace
The Environment At Each Point In Time, I.E. They Can See Every State.
Downloaded by: stuvia7feva | Want to earn
Distribution of this document is illegal R13,625 per year?
, Stuvia.com - The study-notes marketplace
Elements Of The Problem Are The Initial State, Actions And Transition Model Implicitly Defines It,
Together.
State Representation: S ={A1,A2,A3,C1,C2} Which Represents The People Who Have Not Yet
Crossed Yet. The Elements In The Set Represent The People Who Have Not Yet Crossed. An Ampty
Set Represents That Everyone Have Crossed.
The Initial State: S = { A1,A2,A3, C1, C2}
The Notation Represents A Set, The Elements In The Set Are The People Who Want To Cross. If They
Are In The Set It Means That They Have Not Crossed Yet And If They Are Not It Means That They
Have Crossed. Initially No One Has Crossed That Is Why All The People Are In The Set.
The Symbol S Means State. {} Symbols Means The Set.
A1 Representing Adult 1
A2 Representing Adult 2
A3 Representing Adult 3
C1 Representing Child 1
C2 Representiong Child
2
Breadth-First Search Is A Simple Strategy In Which The Root Node Is Expanded First, Then All
The Successors Of The Root Node Are Expanded Next, Then Their Successors, And So On. In
General, All The Nodes Are Expanded At A Given Depth In The Search Tree Before Any Nodes At
The Next Level Are Expanded.
When Applying It To A Tree Or Graph, It Expands The Node With The Shortest Path From The
Frontier.
Breadth First Search (Bfs) Algorithm With A Branching Factor Of Β At Depth Δ:
o Has A Complexity Of O(Β Δ )
o This Is An Exponential
Growth Space/Complexity Gets Large
Quickly
Downloaded by: stuvia7feva | Want to earn
Distribution of this document is illegal R13,625 per year?
, Stuvia.com - The study-notes marketplace
E.G. =B^D
=6^7
=279,94
Breadth-First-Search Uses A Fifo Queue.
Depth -First Search Always Expands The Deepest Node In The Current Frontier Of The Search
Tree. Depth-First Search Uses A Lifo Queue.
The. Search Proceeds Immediately To The Deepest Level Of The Search Tree, Where The Nodes
Have No Successors. As Those Nodes Are Expanded, They Are Dropped From The Frontier, So
Then The Search "Backs Up" To The Next Deepest Node That Still Has Unexplored Successors.
The Space Complexity Is Linear
E.G. = B.D
6x7=42
Dfs Has A Clear Space Complexity Advantage Over Bfs When A Tree Search Is Performed
Property Is Consistency And The Condition For It Is H(N) < Look It Up
For Both Tree-Search And Graph Search A* Needs To Have The Property Of Optimality. For Tree-
Search A* Is Optimal Of H(N) Is Admissible. For Graph-Search Version A* Is Optimal If H(N) Is
Consistent.
Downloaded by: stuvia7feva | Want to earn
Distribution of this document is illegal R13,625 per year?
GRADED A+!! COS3751 EXAM
SOLUTIONS (QUESTIONS
&SOLUTIONS)
Contains The Following Exam Papers: 2018-06, 2017-
10, 2017-06, 2016-06, Practice Paper 1, Practice Paper
2
2018-06
A Rational Agent Is An Agent That Acts In Order To Achieve The Best Outcome, Or Where There Is
Uncertainty, The Best-Expected Outcome. Conceptually Speaking, It Does The “Right Thing”.
Fully Observable, Because The Players’ Sensors Give It Access To The Complete State Of
Downloaded by: stuvia7feva | Want to earn
Distribution of this document is illegal R13,625 per year?
, Stuvia.com - The study-notes marketplace
The Environment At Each Point In Time, I.E. They Can See Every State.
Downloaded by: stuvia7feva | Want to earn
Distribution of this document is illegal R13,625 per year?
, Stuvia.com - The study-notes marketplace
Elements Of The Problem Are The Initial State, Actions And Transition Model Implicitly Defines It,
Together.
State Representation: S ={A1,A2,A3,C1,C2} Which Represents The People Who Have Not Yet
Crossed Yet. The Elements In The Set Represent The People Who Have Not Yet Crossed. An Ampty
Set Represents That Everyone Have Crossed.
The Initial State: S = { A1,A2,A3, C1, C2}
The Notation Represents A Set, The Elements In The Set Are The People Who Want To Cross. If They
Are In The Set It Means That They Have Not Crossed Yet And If They Are Not It Means That They
Have Crossed. Initially No One Has Crossed That Is Why All The People Are In The Set.
The Symbol S Means State. {} Symbols Means The Set.
A1 Representing Adult 1
A2 Representing Adult 2
A3 Representing Adult 3
C1 Representing Child 1
C2 Representiong Child
2
Breadth-First Search Is A Simple Strategy In Which The Root Node Is Expanded First, Then All
The Successors Of The Root Node Are Expanded Next, Then Their Successors, And So On. In
General, All The Nodes Are Expanded At A Given Depth In The Search Tree Before Any Nodes At
The Next Level Are Expanded.
When Applying It To A Tree Or Graph, It Expands The Node With The Shortest Path From The
Frontier.
Breadth First Search (Bfs) Algorithm With A Branching Factor Of Β At Depth Δ:
o Has A Complexity Of O(Β Δ )
o This Is An Exponential
Growth Space/Complexity Gets Large
Quickly
Downloaded by: stuvia7feva | Want to earn
Distribution of this document is illegal R13,625 per year?
, Stuvia.com - The study-notes marketplace
E.G. =B^D
=6^7
=279,94
Breadth-First-Search Uses A Fifo Queue.
Depth -First Search Always Expands The Deepest Node In The Current Frontier Of The Search
Tree. Depth-First Search Uses A Lifo Queue.
The. Search Proceeds Immediately To The Deepest Level Of The Search Tree, Where The Nodes
Have No Successors. As Those Nodes Are Expanded, They Are Dropped From The Frontier, So
Then The Search "Backs Up" To The Next Deepest Node That Still Has Unexplored Successors.
The Space Complexity Is Linear
E.G. = B.D
6x7=42
Dfs Has A Clear Space Complexity Advantage Over Bfs When A Tree Search Is Performed
Property Is Consistency And The Condition For It Is H(N) < Look It Up
For Both Tree-Search And Graph Search A* Needs To Have The Property Of Optimality. For Tree-
Search A* Is Optimal Of H(N) Is Admissible. For Graph-Search Version A* Is Optimal If H(N) Is
Consistent.
Downloaded by: stuvia7feva | Want to earn
Distribution of this document is illegal R13,625 per year?
