Koofers

Lecture Notes for CS 440 - Artificial Intelligence at Illinois (UIUC)

Notes Information

Material Type:Class Note
Professor:Staff
Class:CS 440 - Artificial Intelligence
Subject:Computer Science
University:University of Illinois - Urbana-Champaign
Term:--
Keywords:
  • Average Children
  • Formal Structure
  • Propositional
  • Enumeration
  • Inference Rules
  • Propositional Logic
  • Conjunction
  • Environment
  • The Environment
  • Epistemological
Login / Sign Up to View Document
Preview Page 1Preview Page 2Preview Page 3Preview Page 4Preview Page 5Preview Page 6

Sample Document Text

Logic Introduction to Artificial Intelligence CS440/ECE448 Lecture 9 SECOND HOMEWORK DUE MONDAY Last lecture . Nondeterministic games . Logic - The Wumpusworld - Entailment Today . Logic - Entailment and inference - Propositional logic: Syntax and semantics - Inference rules Reading . Chapters 7 and 8 Minimaxfor nondeterministic games 1. For min node, compute min of children. 2. For chance node, compute weighted average of children. 3. For max node, compute max of children. 3 Function MINIMAX-VALUE (state, game) returns a utility value If TERMINAL-TEST[game](state) then return UTILITY[game](state) else if MAX is to move in state then return the highest MINIMAX-VALUE of Successors[state] else return the lowest MINIMAX-VALUE of Successors[state] Function EXPECTIMINIMAX-VALUE (state, game) returns a utility value If TERMINAL-TEST[game](state) then return UTILITY[game](state) else if state is a chance node then return average of EXPECTIMINMAX-VALUE of Successors(state) else ...

Related Documents

Forward Chaining Notes
Constructive Dilemma Notes
Function Symbols Notes
Propositional Notes
Definite Truth Values Notes
Average Children Notes
Binding List Notes
Propositional Exam
Propositional Logic Notes
Performance Measurement Notes
Performance Measurement Exam
Performance Measurement Notes
Alcoholic Beverage Notes
Complete Formulas Notes
Propositional Notes
Propositional Notes
155, "/var/app/current/tmp/"