100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Summary CPSC 322 Assignment 3 Solutions CA$31.30   Add to cart

Summary

Summary CPSC 322 Assignment 3 Solutions

 7 views  0 purchase

Solutions for CPSC 322 Assignment 3

Preview 2 out of 8  pages

  • July 6, 2023
  • 8
  • 2022/2023
  • Summary
  • cpsc
  • cpsc322
  • 322
All documents for this subject (2)
avatar-seller
travissmith1
Question 1: Heuristics in STRIPS: a video game example

(a)

Loc_i = {T/F} for i = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, and Boolean variables Loc3 free, Loc9 free,
Weapon charged, Charge1Available, Charge4Available

(b)

- move right4: preconditions {Loc4=T }, effects: { Loc4=F, Loc5=T}
- move left4: preconditions {Loc4=T, loc3 free = T }, effects: { Loc4=F, Loc3= T}
- pickup4: preconditions {Loc4 = T, charge4 available=T}, effects: {weapon charged =T, charge4
available = F}
- fire4: preconditions {Loc4 = T ,weapon charged = T}, effects: {loc3 free = T; weapon charged =
F}

(c)

Optimal path: fire, right, right. Figure 1 shows the corresponding search graph.




(d)


The following are some possible answers:
• The agent’s distance to the goal
• Add to the above the number of monsters standing in between the agent and the goal (location 10).
• Add to the above the minimal number of extra steps required to recharge the weapon for each monster
between the agent’s position and the goal location.




1

, (e,f,g)

State in e: (¬Loc_1, ¬Loc_2, ¬Loc_3, ¬Loc_4, ¬Loc_5, ¬Loc_6, ¬Loc_7, ¬Loc_8, Loc_9, ¬Loc_10,
Loc3 free, Loc9 free, Weapon charged, Charge1Available, Charge4Available)
State in f: (¬Loc_1, ¬Loc_2, ¬Loc_3, ¬Loc_4, ¬Loc_5, ¬Loc_6, ¬Loc_7, Loc_8, ¬Loc_9, ¬Loc_10,
¬Loc3 free, ¬Loc9 free, Weapon charged, Charge1Available, Charge4Available)

This heuristic is 1 everywhere except in goal states: if the precondition of move right9 is empty, we can
apply this regardless of the state we’re in, and it will make the location 10. This does not help us
distinguish good states from bad states.


(h,i,j)

Relaxed plan for n=(8, ¬3 free, ¬9 free, charged, c1, c4): fire8, move right8, move right9.
h(n) = 3.
Relaxed plan for n’=(9, 3 free, 9 free, charged, c1, c4): move right 9. h(n) = 1.
The heuristic is more useful since it provides more guidance towards useful states




2

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller travissmith1. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for CA$31.30. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

79976 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
CA$31.30
  • (0)
  Add to cart