Skip to content
lectern.tv
1/15

Search with Other Agents: Minimax

Pieter AbbeelDistinguishedUC Berkeley

Professor of Electrical Engineering and Computer Sciences

1:25:00·2018·undergraduate level

This lecture introduces formal game theory concepts, detailing the Minimax algorithm for optimal decision-making in zero-sum games. It thoroughly covers Alpha-Beta Pruning as an optimization technique for Minimax search trees, alongside discussions of depth-limited search and heuristic evaluation functions.

Theory & AlgosAlgorithms & Data StructuresGame Theory & Mechanism DesignAdversarial SearchMinimax Algorithm

COMPSCI 188, LEC 001 - Fall 2018 COMPSCI 188, LEC 001 - Pieter Abbeel, Daniel Klein Copyright @2018 UC Regents; all rights reserved

Source: Webcast Departmental via YouTubeWatch on YouTube
LecturerAll lecturers →
Pieter AbbeelDistinguished

Professor of EECS & Director of Berkeley Robot Learning Lab, UC Berkeley

Professor of EECS at UC Berkeley and ACM Prize in Computing recipient for deep reinforcement learning and apprenticeship robotics.

1 course · 22 lecturesCanon
Previous · Lecture 5

Constraint Satisfaction Problems (CSPs) Part 2/2

Next · Lecture 7

Search with Other Agents: Expectimax, Utilities

Comments

Add a comment...Sign in