adversarial search Flashcards by Sara Cattaneo

{ "@context": "https://schema.org", "@type": "Organization", "name": "Brainscape", "url": "https://www.brainscape.com/", "logo": "https://www.brainscape.com/pks/images/cms/public-views/shared/Brainscape-logo-c4e172b280b4616f7fda.svg", "sameAs": [ "https://www.facebook.com/Brainscape", "https://x.com/brainscape", "https://www.linkedin.com/company/brainscape", "https://www.instagram.com/brainscape/", "https://www.tiktok.com/@brainscapeu", "https://www.pinterest.com/brainscape/", "https://www.youtube.com/@BrainscapeNY" ], "contactPoint": { "@type": "ContactPoint", "telephone": "(929) 334-4005", "contactType": "customer service", "availableLanguage": ["English"] }, "founder": { "@type": "Person", "name": "Andrew Cohen" }, "description": "Brainscape’s spaced repetition system is proven to DOUBLE learning results! Find, make, and study flashcards online or in our mobile app. Serious learners only.", "address": { "@type": "PostalAddress", "streetAddress": "159 W 25th St, Ste 517", "addressLocality": "New York", "addressRegion": "NY", "postalCode": "10001", "addressCountry": "USA" } }

what is a ply?

a move by a player

How well did you know this?

Not at all

Perfectly

what does b and , stand for? (minimax time complexity=O(bm)
‣

b = (average) branching factor(averane number of children per node)
‣ m = maximum depth of the tree

How well did you know this?

Not at all

Perfectly

why is alpha-beta search useless in Go?

because it would not be possible to see far ahead as Go starts with a branching factor of 361 and continues with an average branching
factor of 150.

How well did you know this?

Not at all

Perfectly

How well did you know this?

Not at all

Perfectly

adversarial search Flashcards

(4 cards)