Lecture 20 problem reduction search
Download as PPTX, PDF0 likes370 views
Problem reduction search involves recursively decomposing a problem into sub-problems in multiple ways, which can be represented as an AND/OR graph with OR nodes for choice of decompositions and AND nodes for a given decomposition. Game trees similarly use Max and Min nodes to represent the choices of opponents and the decision maker respectively.
1 of 3
Downloaded 15 times
More Related Content
More from Hema Kashyap (20)
Recently uploaded (20)
Ad
Lecture 20 problem reduction search
- 1. Problem Reduction Search AND/OR Search Min-Max Search (Lecture-20) Hema Kashyap 1
- 2. Problem Reduction Search • Planning how best to solve a problem that can be recursively decomposed into sub-problems in multiple ways – Matrix Multiplication problem – Tower of Hanoi 2
- 3. Formulations • AND/OR Graph – An OR node represents a choice between possible decompositions – An AND node represents a given decomposition • Game Trees – Max nodes represent the choice of my opponent – Min nodes represent my choice 3