Embedded Files
Discuss this question on aiqus. When posting use the tag 'unit2-1'
Unit 2, Topic 2, Route Finding Question
Discuss this question on aiqus. When posting use the tag 'unit2-2'
Unit 2, Topic 3, Route Finding
Discuss this question on aiqus. When posting use the tag 'unit2-3'
Discuss this question on aiqus. When posting use the tag 'unit2-4'
Unit 2, Topic 5, Tree Search Answer
Discuss this question on aiqus. When posting use the tag 'unit2-5'
Discuss this question on aiqus. When posting use the tag 'unit2-6'
Unit 2, Topic 7, Graph Search Answer
Discuss this question on aiqus. When posting use the tag 'unit2-7'
Unit 2, Topic 8, Graph Search Answer
Discuss this question on aiqus. When posting use the tag 'unit2-8'
Unit 2, Topic 9, More Graph Search
Discuss this question on aiqus. When posting use the tag 'unit2-9'
Unit 2, Topic 10, Graph Search Answer
Discuss this question on aiqus. When posting use the tag 'unit2-10'
Unit 2, Topic 11, Graph Search Termination
Discuss this question on aiqus. When posting use the tag 'unit2-11'
Unit 2, Topic 12, Uniform Cost Search
Discuss this question on aiqus. When posting use the tag 'unit2-12'
Unit 2, Topic 13, Uniform Cost Search
Discuss this question on aiqus. When posting use the tag 'unit2-13'
Unit 2, Topic 14, Uniform Cost Search
Discuss this question on aiqus. When posting use the tag 'unit2-14'
Unit 2, Topic 15, Uniform Cost Search
Discuss this question on aiqus. When posting use the tag 'unit2-15'
Unit 2, Topic 16, Uniform Cost Termination
Correction:
The total into Bucharest via Fagaras should be 450, not 460.
Discuss this question on aiqus. When posting use the tag 'unit2-16'
Unit 2, Topic 17, Uniform Cost Termination Answer
Correction:
0:41. Pitesti should have been marked as explored and thus the path from Pitesti to Craiona should be added to the frontier.
1:11 Because of the previous error, the path Craiona to Pitesti should not be added to the frontier since it should already have been added.
Discuss this question on aiqus. When posting use the tag 'unit2-17'
Unit 2, Topic 18, Depth First Search
Discuss this question on aiqus. When posting use the tag 'unit2-18'
Unit 2, Topic 19, Search Optimality Answer
Discuss this question on aiqus. When posting use the tag 'unit2-19'
Unit 2, Topic 20, Storage Requirements, Completeness
Clarification on cheapest first search:
Consider an infinite path whose costs sum as follows: 1 + 1/2 + 1/4 + 1/8 + 1/16 + 1/32 + ... The infinite sum of this series is 2. If the shortest path to the goal node has cost greater than 2, cheapest first search will be incomplete.
In the case of an infinite tree, cheapest first is complete only if
(1) each action has a non-zero cost separate from the path cost and
(2) no node has an infinite number of successors.
Peter's answer of complete is correct only if you assume a non-zero action cost, this was not clearly specified. If you assume a zero action cost then the answer is incomplete.
Discuss this question on aiqus. When posting use the tag 'unit2-20'
Unit 2, Topic 21, Completeness Answer
Discuss this question on aiqus. When posting use the tag 'unit2-21'
Unit 2, Topic 22, More on Uniform Cost Search
Discuss this question on aiqus. When posting use the tag 'unit2-22'
Unit 2, Topic 23, A-Star Search
Discuss this question on aiqus. When posting use the tag 'unit2-23'
Unit 2, Topic 23, A-Star Search ANSWER
Discuss this question on aiqus. When posting use the tag 'unit2-23'
Unit 2, Topic 24, A-Star Second Question
Discuss this question on aiqus. When posting use the tag 'unit2-24'
Unit 2, Topic 24, A-Star Second Question ANSWER
Discuss this question on aiqus. When posting use the tag 'unit2-24'
Unit 2, Topic 25, A-Star Third Question
Discuss this question on aiqus. When posting use the tag 'unit2-25'
Unit 2, Topic 25, A-Star Third Question ANSWER
Discuss this question on aiqus. When posting use the tag 'unit2-25'
Unit 2, Topic 26, A-Star Fourth Question
Discuss this question on aiqus. When posting use the tag 'unit2-26'
Unit 2, Topic 26, A-Star Fourth Question ANSWER
Discuss this question on aiqus. When posting use the tag 'unit2-26'
Unit 2, Topic 27, A-Star Fifth Question
Discuss this question on aiqus. When posting use the tag 'unit2-27'
Unit 2, Topic 27, A-Star Fifth Question ANSWER Mandatory
Correction:
h(s) <= true cost, not h(s) < true cost
Discuss this question on aiqus. When posting use the tag 'unit2-28'
Unit 2, Topic 28, Optimistic Heuristics
Discuss this question on aiqus. When posting use the tag 'unit2-29'
Unit 2, Topic 29, State Spaces
Discuss this question on aiqus. When posting use the tag 'unit2-30'
Unit 2, Topic 29, State Spaces ANSWER
Discuss this question on aiqus. When posting use the tag 'unit2-31'
Unit 2, Topic 30, State Space Diagram and More Complexity
Discuss this question on aiqus. When posting use the tag 'unit2-32'
Unit 2, Topic 30, State Space Diagram and More Complexity ANSWER
Discuss this question on aiqus. When posting use the tag 'unit2-33'
Unit 2, Topic 31, Sliding Blocks Puzzle
Discuss this question on aiqus. When posting use the tag 'unit2-34'
Unit 2, Topic 31, Sliding Blocks Puzzle ANSWER
Discuss this question on aiqus. When posting use the tag 'unit2-35'
Unit 2, Topic 32, Where is the Intelligence
Discuss this question on aiqus. When posting use the tag 'unit2-36'
Unit 2, Topic 33, What Can't Search Do
Discuss this question on aiqus. When posting use the tag 'unit2-37'
Unit 2, Topic 34, Note on Implementation
Discuss this question on aiqus. When posting use the tag 'unit2-38'
Page updated
Google Sites
Report abuse