100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
COS3751 Assignment 2 2023 - DUE 21 July R50,00   Add to cart

Exam (elaborations)

COS3751 Assignment 2 2023 - DUE 21 July

 12 views  1 purchase

COS3751 Assignment 2 2023 - DUE 21 July QUESTIONS AND ANSWERS

Preview 2 out of 7  pages

  • July 14, 2023
  • 7
  • 2022/2023
  • Exam (elaborations)
  • Questions & answers
All documents for this subject (26)
avatar-seller
pablitoh11
COS3751
Assignment 2
2023 - DUE 21
July 2023
QUESTIONS AND ANSWERS

, QUESTION 1
What is utility function and why is it used in adversarial searches.
Also called an objective function or a payoff function.

Defines the final numeric value for a game that ends in a terminal state s for a player p.

An agent’s utility function is essentially an internalisation of the performance measure.

It captures the preferences of an agent and assigns a single number to express the
desirability of a state.

The utility function allows us to determine the apparent desirability of a state



Explain how forward pruning works. Provide at least one approach to
forward pruning in your explanation, as well as a problem that may be
encountered with forward pruning.
Allows us to ignore portions of the search tree that make no difference to the final choice.
Forward pruning, meaning that some moves at a given node are pruned immediately
without consideration.
Beam search: on each ply, consider only a “beam” of the n best moves rather than
considering all possible moves. This approach is rather dangerous because there’s no
guarantee that the best move won’t be pruned away.

Does the order in which nodes are examined in minimax matter? Explain your
answer.
Yes.

Minimax algorithm is a depth first, so at any one time we just have to consider the nodes
along a single path in the tree.

Also it uses a simple recursive computation of the minimax values of each successor state,
directly implementing the defining equations.

The right order of nodes could result in pruning earlier. For example: if a _value of 2 (low
values are worse for MAX) is returned for the first child of a MIN node, and a subsequent
child’s child returns 5, then no more children of the child need to be examined. On the other
hand, if that first child returned 10, and the following child returned 5, all the child’s children
may have to be examined.

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 EFT, 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 this summary from?

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

Will I be stuck with a subscription?

No, you only buy this summary for R50,00. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

73216 documents were sold in the last 30 days

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

Start selling
R50,00  1x  sold
  • (0)
  Buy now