Computer Science, asked by 03132427038z, 7 months ago

III. What will be the complexity of adversarial search for LUDO?

Answers

Answered by snehakumari4534581

1

Answer:

Adversarial search is search when there is an "enemy" or "opponent" changing the state of the problem every step in a direction you do not want. Examples: Chess, business, trading, war. You change state, but then you don't control the next state. Opponent will change the next state in a way: unpredictable...

hope it helps you

Previous Question

Next Question

Similar questions

Science, 3 months ago

explain why does a sharp knife cut a fruit easily than blunt knife?

Accountancy, 3 months ago

The term debit come from the italian word ...

Math, 3 months ago

If two digit numbers are formed using the digits 1, 2, 3, 4 without repeating them, then n(S) =...

Math, 7 months ago

n upon 2 - 3 n upon 4 + 5 n upon 6 is equal to 21 ...

Geography, 7 months ago

B. Fill in the blanks: 1. The age of voting in India is.IR 2. Elections are conducted in India by. I continuommission 3. Voting in India takes place through.......... 4. .......amendment of Indian constitution reduced the age of voting from twenty one years to eighteen years. 5. Universal Adult Franchise gives... power to the people.

English, 10 months ago

how useful the computer is? .. which kind of sentence is it exclamatory or interrogative?

Math, 10 months ago

The highest common factor of 97 and 80 ...

Science, 10 months ago

what are the linitstions of a glove ?