![Search Algorithms Benno Stein](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-1.png)
![Contents I. Introduction](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-2.png)
![Objectives](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-3.png)
![Literature Books on Heuristic Search](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-4.png)
![Literature Further Reading](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-5.png)
![Literature Further Reading](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-6.png)
![Literature Further Reading](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-7.png)
![Literature Further Reading](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-8.png)
![Literature Further Reading](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-9.png)
![Literature Further Reading](https://downloads.webis.de/lecturenotes/search/unit-en-search-organization/unit-en-search-organization-10.png)
![Chapter S:I I. Introduction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-1.png)
![Examples for Search Problems 8-Queens Problem: Local Search](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-2.png)
![Examples for Search Problems 8-Queens Problem: Local Search](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-3.png)
![Examples for Search Problems 8-Queens Problem: Local Search](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-4.png)
![Examples for Search Problems 8-Queens Problem: Local Search](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-5.png)
![Examples for Search Problems 8-Queens Problem: Local Search](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-6.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-7.png)
![Examples for Search Problems 8-Queens Problem: Local Search](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-8.png)
![Examples for Search Problems 8-Queens Problem: Solution Construction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-9.png)
![Examples for Search Problems 8-Queens Problem: Solution Construction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-10.png)
![Examples for Search Problems 8-Queens Problem: Solution Construction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-11.png)
![Examples for Search Problems 8-Queens Problem: Solution Construction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-12.png)
![Examples for Search Problems 8-Queens Problem: Solution Construction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-13.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-14.png)
![Examples for Search Problems 8-Queens Problem: Solution Construction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-15.png)
![Examples for Search Problems 8-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-16.png)
![Examples for Search Problems 8-Queens Problem: Solution Construction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-17.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-18.png)
![Examples for Search Problems 8-Puzzle Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-19.png)
![Examples for Search Problems 8-Puzzle Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-20.png)
![Examples for Search Problems 8-Puzzle Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-21.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-22.png)
![Examples for Search Problems 8-Puzzle Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-23.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-24.png)
![Examples for Search Problems Traveling Salesman Problem (TSP)](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-25.png)
![Examples for Search Problems Traveling Salesman Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-26.png)
![Examples for Search Problems Traveling Salesman Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-27.png)
![Examples for Search Problems Traveling Salesman Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-28.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-29.png)
![Examples for Search Problems Traveling Salesman Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-30.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-31.png)
![Examples for Search Problems Minimum Spanning Tree Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-32.png)
![Examples for Search Problems Minimum Spanning Tree](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-33.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-34.png)
![Examples for Search Problems MaxSAT Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-35.png)
![Examples for Search Problems MaxSAT Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-36.png)
![Examples for Search Problems MaxSAT Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-37.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-38.png)
![Examples for Search Problems MaxSAT Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-39.png)
![Examples for Search Problems MaxSAT Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-40.png)
![Examples for Search Problems Road-Map Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-41.png)
![Examples for Search Problems Road-Map Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-42.png)
![Examples for Search Problems Road-Map Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-43.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-44.png)
![Examples for Search Problems Road-Map Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-45.png)
![Examples for Search Problems Road-Map Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-46.png)
![Examples for Search Problems Road-Map Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-47.png)
![Examples for Search Problems Road-Map Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-48.png)
![Examples for Search Problems Blocks-World Planning](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-49.png)
![Examples for Search Problems Blocks-World Planning](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-50.png)
![Examples for Search Problems Blocks-World Planning](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-51.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-52.png)
![Chapter S:I I. Introduction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-53.png)
![Search-Problem Abstraction Local Search Approach](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-54.png)
![Search Problem Abstraction Local Search Approach](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-55.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-56.png)
![Search Problem Abstraction Solution Construction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-57.png)
![Search Problem Abstraction Solution Construction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-58.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-59.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-60.png)
![Search Problem Abstraction Solution Construction: Abstract Problem Setting](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-61.png)
![Search Problem Abstraction Questions in Problem Solving as Search](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-62.png)
![Chapter S:I I. Introduction](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-63.png)
![Examples for AND-OR Search Problems The Counterfeit Coin Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-64.png)
![Examples for AND-OR Search Problems The Counterfeit Coin Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-65.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-66.png)
![Examples for AND-OR Search Problems The Counterfeit Coin Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-67.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-68.png)
![Examples for AND-OR Search Problems The Counterfeit Coin Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-69.png)
![Examples for AND-OR Search Problems The Counterfeit Coin Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-70.png)
![Examples for AND-OR Search Problems Tic-Tac-Toe Game](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-71.png)
![Examples for AND-OR Search Problems Tic-Tac-Toe Game](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-72.png)
![Examples for AND-OR Search Problems Tic-Tac-Toe Game](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-73.png)
![Examples for AND-OR Search Problems Tic-Tac-Toe Game](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-74.png)
![Examples for AND-OR Search Problems Tic-Tac-Toe Game](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-75.png)
![Examples for AND-OR Search Problems UNSAT Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-76.png)
![Examples for AND-OR Search Problems UNSAT Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-77.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-78.png)
![Examples for AND-OR Search Problems UNSAT Problem](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-79.png)
![Search Problem Abstraction Recap: Questions in Problem Solving as Search](https://downloads.webis.de/lecturenotes/search/unit-en-search-introduction/unit-en-search-introduction-80.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-1.png)
![Systematic Search Types of Problems](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-2.png)
![Systematic Search Types of Problems](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-3.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-4.png)
![Systematic Search Modeling Search as Problem Solving](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-5.png)
![Systematic Search Abstract Framework for Search as Problem Solving](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-6.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-7.png)
![Systematic Search Modeling Problem Solving as Reachability Problem for STS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-8.png)
![Systematic Search Modeling Problem Solving as Reachability Problem for STS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-9.png)
![Systematic Search Modeling Problem Solving as Reachability Problem for STS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-10.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-11.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-12.png)
![Graph Theory Basics Definition 2 (Directed Graph)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-13.png)
![Graph Theory Basics Definition 2 (Directed Graph)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-14.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-15.png)
![Graph Theory Basics Definition 3 (Path, Vertex Types, Outdegree, Local Finiteness)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-16.png)
![Graph Theory Basics Definition 3 (Path, Vertex Types, Outdegree, Local Finiteness)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-17.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-18.png)
![Graph Theory Basics Definition 4 (Directed Tree, Uniform Tree)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-19.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-20.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-21.png)
![State Space Search Modeling Problem Solving as Path-Finding Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-22.png)
![State Space Search Modeling Problem Solving as Path-Finding Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-23.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-24.png)
![State Space Search Modeling Problem Solving as Path-Finding Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-25.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-26.png)
![State Space Search Illustration of Solution Paths and Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-27.png)
![State Space Search Illustration of Solution Paths and Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-28.png)
![State Space Search Illustration of Solution Paths and Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-29.png)
![State Space Search Graph Representation](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-30.png)
![State Space Search Graph Representation](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-31.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-32.png)
![State Space Search Graph Algorithms and Back-pointer Structures](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-33.png)
![State Space Search Graph Algorithms and Back-pointer Structures](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-34.png)
![State Space Search Graph Algorithms and Back-pointer Structures](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-35.png)
![State Space Search Illustration of Back-pointer Usage](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-36.png)
![State Space Search Illustration of Back-pointer Usage](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-37.png)
![State Space Search Illustration of Back-pointer Usage](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-38.png)
![State Space Search Illustration of Back-pointer Usage](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-39.png)
![State Space Search Illustration of Back-pointer Usage](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-40.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-41.png)
![State Space Search Definition 7 (Node Generation, Node Expansion)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-42.png)
![State Space Search Node Generation as a Basic Step](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-43.png)
![State Space Search Node Expansion as a Basic Step](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-44.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-45.png)
![State Space Search Explicit Parts of State-Space Subgraphs](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-46.png)
![State Space Search Requirements for an Algorithmization of State-Space Search](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-47.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-48.png)
![Remarks: (continued)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-49.png)
![State Space Search Generic Schema for OR-Graph Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-50.png)
![State Space Search Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-51.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-52.png)
![Remarks: (continued)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-53.png)
![State Space Search Efficient Storage of Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-54.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-55.png)
![State Space Search Efficient Storage of Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-56.png)
![State Space Search Efficient Storage of Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-57.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-58.png)
![State Space Search Efficient Storage of Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-59.png)
![State Space Search Efficient Storage of Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-60.png)
![State Space Search Schema for Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-61.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-62.png)
![State Space Search Searching a Search Space Graph](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-63.png)
![State Space Search Searching a Search Space Graph](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-64.png)
![State Space Search Searching a Search Space Graph](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-65.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-66.png)
![State Space Search Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-67.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-68.png)
![State Space Search Important Properties of Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-69.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-70.png)
![State Space Search Lemma 10 (Termination of Basic-OR for Finite Graphs without Cycles)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-71.png)
![State Space Search Lemma 11 (Completeness of Basic-OR for Finite Graphs without Cycles)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-72.png)
![State Space Search Searching a Search Space Graph](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-73.png)
![State Space Search Uninformed Systematic Search](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-74.png)
![State Space Search Uninformed Systematic Search](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-75.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-76.png)
![State Space Search Basic-OR Search for Optimization](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-77.png)
![State Space Search Basic-Opt-OR(s, successors, ?, cost)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-78.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-79.png)
![State Space Search Optimization Problem Example](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-80.png)
![State Space Search Optimization Problem Example](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-81.png)
![State Space Search Optimization Problem Example](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-82.png)
![State Space Search Optimization Problem Example](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search1/unit-en-basic-search1-83.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-1.png)
![Depth-First Search (DFS) Depth-first search is an uninformed (systematic) search strategy.](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-2.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-3.png)
![Depth-First Search Specification of DFS Algorithm Family](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-4.png)
![Depth-First Search Core Version of DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-5.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-6.png)
![Depth-First Search Example: 4-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-7.png)
![Depth-First Search Example: 4-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-8.png)
![Depth-First Search Example: 4-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-9.png)
![Depth-First Search Example: 4-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-10.png)
![Depth-First Search Search Depth](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-11.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-12.png)
![Depth-First Search Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-13.png)
![Depth-First Search Depth-limited DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-14.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-15.png)
![Depth-First Search Iterative Deepening Framework using DL-DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-16.png)
![Depth-First Search DFS with Pruning](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-17.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-18.png)
![Depth-First Search Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-19.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-20.png)
![Depth-First Search Example: DFS for Optimization (see Basic-OR for Optimization)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-21.png)
![Depth-First Search Example: DFS for Optimization (see Basic-OR for Optimization)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-22.png)
![Depth-First Search Example: DFS for Optimization (see Basic-OR for Optimization)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-23.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-24.png)
![Backtracking (BT) Backtracking is a variant of depth-first search.](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-25.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-26.png)
![Backtracking Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-27.png)
![Backtracking Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-28.png)
![Backtracking Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-29.png)
![Backtracking Monotone Backtracking: 8-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-30.png)
![Backtracking Monotone Backtracking: 8-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-31.png)
![Backtracking Monotone Backtracking: 8-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-32.png)
![Backtracking Non-Monotone Backtracking: 8-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-33.png)
![Backtracking Non-Monotone Backtracking: Generic](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-34.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-35.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-36.png)
![Breadth-First Search (BFS) Breadth-first search is an uninformed, systematic search strategy.](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-37.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-38.png)
![Breadth-First Search Specification of BFS Algorithm Family](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-39.png)
![Breadth-First Search Core Version of BFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-40.png)
![Breadth-First Search Example: 4-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-41.png)
![Breadth-First Search Example: 4-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-42.png)
![Breadth-First Search Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-43.png)
![Breadth-First Search Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-44.png)
![Breadth-First Search BFS with Pruning](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-45.png)
![Breadth-First Search Depth-limited BFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-46.png)
![Breadth-First Search Corollary 13 (Termiantion of Basic-BFS for Finite Graphs without Cycles)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-47.png)
![Breadth-First Search Example: BFS for Optimization (see Basic-OR and DFS for Optimization)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-48.png)
![Breadth-First Search Example: BFS for Optimization (see Basic-OR and DFS for Optimization)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search2/unit-en-basic-search2-49.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-1.png)
![AND-OR Graph Basics Problem Reduction: A Powerful Tool in Problem Solving](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-2.png)
![AND-OR Graph Basics Building Blocks of Problem Reduction](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-3.png)
![AND-OR Graph Basics Graph Representations of Problem Reduction](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-4.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-5.png)
![AND-OR Graph Basics Problem Reduction: Integration into State-Space Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-6.png)
![AND-OR Graph Basics Canonical Representation of AND-OR Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-7.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-8.png)
![AND-OR Graph Basics AND-OR Graph Properties](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-9.png)
![AND-OR Graph Basics Solutions in AND-OR Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-10.png)
![AND-OR Graph Basics Solution Trees: A Generalisation of Solution Paths](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-11.png)
![AND-OR Graph Basics Solution Trees in AND-OR Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-12.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-13.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-14.png)
![Depth-First Search of AND-OR Graphs Differences to OR Graphs Search](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-15.png)
![Depth-First Search of AND-OR Graphs Differences to OR Graphs Search](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-16.png)
![Depth-First Search of AND-OR Graphs Solved Labeling](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-17.png)
![Depth-First Search of AND-OR Graphs Solved Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-18.png)
![Depth-First Search of AND-OR Graphs Solved Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-19.png)
![Depth-First Search of AND-OR Graphs Solved Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-20.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-21.png)
![Depth-First Search of AND-OR Graphs Example: Solved Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-22.png)
![Depth-First Search of AND-OR Graphs Example: Solved Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-23.png)
![Depth-First Search of AND-OR Graphs Example: Solved Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-24.png)
![Depth-First Search of AND-OR Graphs Example: Solved Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-25.png)
![Depth-First Search of AND-OR Graphs Example: Solved Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-26.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-27.png)
![Depth-First Search of AND-OR Graphs Solution Tree Labeling](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-28.png)
![Depth-First Search of AND-OR Graphs Example: Solution Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-29.png)
![Depth-First Search of AND-OR Graphs Example: Solution Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-30.png)
![Depth-First Search of AND-OR Graphs Example: Solution Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-31.png)
![Depth-First Search of AND-OR Graphs Example: Solution Labeling Using DFS](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-32.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-33.png)
![Depth-First Search of AND-OR Graphs Redundant Problem Solving](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-34.png)
![Depth-First Search of AND-OR Graphs Redundant Problem Solving](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-35.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-36.png)
![Depth-First Search of AND-OR Graphs Dealing with Cycles (1)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-37.png)
![Depth-First Search of AND-OR Graphs Dealing with Cycles (1)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-38.png)
![Depth-First Search of AND-OR Graphs Dealing with Cycles (2)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-39.png)
![Depth-First Search of AND-OR Graphs Dealing with Cycles (2)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-40.png)
![Depth-First Search of AND-OR Graphs Dealing with Cycles (2)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-41.png)
![Depth-First Search of AND-OR Graphs Dealing with Cycles (2)](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-42.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-43.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-44.png)
![AND-OR Graph Search Basics Solution-Tree Bases in AND-OR Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-45.png)
![AND-OR Graph Search Basics Requirements for an Algorithmization of AND-OR Graph Search](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-46.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-47.png)
![AND-OR Graph Search Basics Generic Schema for AND-OR-Graph Tree Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-48.png)
![AND-OR Graph Search Basics Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-49.png)
![AND-OR Graph Basics Generic_AND-OR_Tree(s, successors, ?) [Generic_OR]](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-50.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-51.png)
![Chapter S:II II. Basic Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-52.png)
![AND-OR Graph Search Efficient Storage of Solution-Tree Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-53.png)
![AND-OR Graph Search Efficient Storage of Solution-Tree Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-54.png)
![AND-OR Graph Search Efficient Storage of Solution-Tree Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-55.png)
![AND-OR Graph Search Identifying Solution Trees and Solution-Tree Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-56.png)
![AND-OR Graph Search Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-57.png)
![AND-OR Graph Search Basic_AND-OR_Tree(s, successors, is_solved) [Basic_OR]](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-58.png)
![AND-OR Graph Search Illustration of Basic_AND-OR](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-59.png)
![AND-OR Graph Search Illustration of Basic_AND-OR_Tree](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-60.png)
![AND-OR Graph Search Illustration of Basic_AND-OR_Tree](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-61.png)
![AND-OR Graph Search Illustration of Basic_AND-OR_Tree](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-62.png)
![AND-OR Graph Search Illustration of Basic_AND-OR_Tree](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-63.png)
![AND-OR Graph Search Illustration of Basic_AND-OR_Tree](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-64.png)
![AND-OR Graph Search Illustration of Basic_AND-OR_Tree](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-65.png)
![AND-OR Graph Search Illustration of Basic_AND-OR_Tree](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-66.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-67.png)
![AND-OR Graph Search Enfolding of Solution Trees: Compact Representation as AND-OR Graph](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-68.png)
![AND-OR Graph Search Enfolding of Solution Trees](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-69.png)
![AND-OR Graph Search Enfolding of Solution Trees](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-70.png)
![AND-OR Graph Search Enfolding of Solution Trees](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-71.png)
![AND-OR Graph Search Enfolding of Solution Trees](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-72.png)
![AND-OR Graph Search Enfolding of Solution Trees](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-73.png)
![AND-OR Graph Search Enfolding of Solution Trees](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-74.png)
![AND-OR Graph Search Solution Graphs in AND-OR Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-75.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-76.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-77.png)
![AND-OR Graph Search Solution Graphs in AND-OR Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-78.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-79.png)
![AND-OR Graph Search Illustration of Solution Graphs and Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-80.png)
![AND-OR Graph Search Illustration of Solution Graphs and Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-81.png)
![AND-OR Graph Search Illustration of Solution Graphs and Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-82.png)
![AND-OR Graph Search Illustration of Solution Graphs and Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-83.png)
![AND-OR Graph Search Illustration of Solution Graphs and Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-84.png)
![AND-OR Graph Search Illustration of Solution Graphs and Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-85.png)
![AND-OR Graph Search Generic Schema for AND-OR-Graph Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-86.png)
![AND-OR Graph Search Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-87.png)
![AND-OR Graph Search Generic_AND-OR(s, successors, ?) [Generic_AND-OR_Tree] [Generic_OR]](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-88.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-89.png)
![AND-OR Graph Search Efficient Storage of Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-90.png)
![AND-OR Graph Search Efficient Storage of Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-91.png)
![AND-OR Graph Search Efficient Storage of Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-92.png)
![AND-OR Graph Search Efficient Storage of Solution Bases](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-93.png)
![AND-OR Graph Search Foundation of Basic AND-OR Graph Search](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-94.png)
![AND-OR Graph Search Foundation of AND-OR Graph Search](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-95.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-96.png)
![AND-OR Graph Search Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-97.png)
![AND-OR Graph Search Basic_AND-OR(s, successors, is_solved) [Basic_OR]](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-98.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-99.png)
![AND-OR Graph Search Illustration of Basic_AND-OR](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-100.png)
![AND-OR Graph Search Illustration of Basic_AND-OR](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-101.png)
![AND-OR Graph Search Illustration of Basic_AND-OR](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-102.png)
![AND-OR Graph Search Illustration of Basic_AND-OR](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-103.png)
![AND-OR Graph Search Illustration of Basic_AND-OR](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-104.png)
![AND-OR Graph Search Illustration of Basic_AND-OR](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-105.png)
![AND-OR Graph Search Illustration of Basic_AND-OR](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-106.png)
![AND-OR Graph Search Illustration of Basic_AND-OR](https://downloads.webis.de/lecturenotes/search/unit-en-basic-search3/unit-en-basic-search3-107.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-1.png)
![Best-First Search Basics “To enhance the performance of AI’s programs, knowledge [about the problem](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-2.png)
![Best-First Search “To enhance the performance of AI’s programs, knowledge [about the problem](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-3.png)
![Best-First Search “To enhance the performance of AI’s programs, knowledge [about the problem](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-4.png)
![Best-First Search Basics “To enhance the performance of AI’s programs, knowledge [about the problem](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-5.png)
![Best-First Search Basics “The promise of a node is estimated numerically by a heuristic evaluation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-6.png)
![Best-First Search Basics “The promise of a node is estimated numerically by a heuristic evaluation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-7.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-8.png)
![Best-First Search Basics Generic Schema for Best-First Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-9.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-10.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-11.png)
![Best-First Search Algorithms Notation for Evaluation Functions](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-12.png)
![Best-First Search Algorithms Notation for Evaluation Functions](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-13.png)
![Best-First Search Algorithms Basic Principles for an Algorithmization of Best-First Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-14.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-15.png)
![Best-First Search Algorithms (Compare ::::::](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-16.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-17.png)
![Best-First Search Algorithms Uniform-Cost Search (UCS) as Variant of Basic-BF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-18.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-19.png)
![Best-First Search Algorithms Example: Uniform-Cost Search for Optimization](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-20.png)
![Best-First Search Algorithms Example: Uniform-Cost Search for Optimization](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-21.png)
![Best-First Search Algorithms Uniform-Cost Search is an uninformed (systematic) search strategy.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-22.png)
![Best-First Search Algorithms Delayed Termination: Basic-BF for Optimization](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-23.png)
![Best-First Search Algorithms (Compare BF∗ .)](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-24.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-25.png)
![Best-First Search Algorithms Space Efficiency of Basic-BF and Basic-BF*](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-26.png)
![Best-First Search Algorithms Implementing Path Discarding in Basic-BF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-27.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-28.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-29.png)
![Best-First Search Algorithms Path Discarding for a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-30.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-31.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-32.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-33.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-34.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-35.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-36.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-37.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-38.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-39.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-40.png)
![Best-First Search Algorithms Re-evaluation of a Node n0](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-41.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-42.png)
![Best-First Search Algorithms BF∗ (s, successors, ?, f )](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-43.png)
![Best-First Search Algorithms Definition 21 (Cycle-Averse Evaluation Function)](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-44.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-45.png)
![Best-First Search Algorithms Irrevocable Path Discarding in BF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-46.png)
![Best-First Search Algorithms Irrevocable Path Discarding in BF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-47.png)
![Best-First Search Algorithms Definition 22 (Order-preserving Evaluation Function)](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-48.png)
![Best-First Search Algorithms Definition 23 (Optimistic Evaluation Function)](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-49.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-50.png)
![Best-First Search Algorithms Advanced Principles for an Algorithmization of Best-First Search for Optimization](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-51.png)
![State Space Search Important Properties of Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-52.png)
![State Space Search Lemma 25 (Admissibility of BF* for Finite Graphs)](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf1/unit-en-informed-bf1-53.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-1.png)
![Cost Functions for State-Space Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-2.png)
![Cost Functions for State-Space Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-3.png)
![Cost Functions for State-Space Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-4.png)
![Cost Functions for State-Space Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-5.png)
![Cost Functions for State-Space Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-6.png)
![Cost Functions for State-Space Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-7.png)
![Cost Functions for State-Space Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-8.png)
![Cost Functions for State-Space Graphs For a known solution path, the solution cost must be determined.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-9.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-10.png)
![Cost Functions for State-Space Graphs If the entire search space graph rooted at a node s is known, the optimum solution](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-11.png)
![Cost Functions for State-Space Graphs If the entire search space graph rooted at a node s is known, the optimum solution](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-12.png)
![Cost Functions for State-Space Graphs If the search space graph rooted at a node s is known partially, the optimum](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-13.png)
![Cost Functions for State-Space Graphs If the search space graph rooted at a node s is known partially, the optimum](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-14.png)
![Cost Functions for State-Space Graphs Cost Concept used in Uniform-Cost Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-15.png)
![Cost Functions for State-Space Graphs Recursive Cost Functions](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-16.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-17.png)
![Cost Functions for State-Space Graphs Recursive Cost Functions](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-18.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-19.png)
![Cost Functions for State-Space Graphs Recursive Cost Functions](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-20.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-21.png)
![Evaluation of State-Space Graphs Recursive Cost Functions and Efficiency](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-22.png)
![Evaluation of State-Space Graphs Recursive Cost Functions and Efficiency](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-23.png)
![Evaluation of State-Space Graphs Recursive Cost Functions and Efficiency](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-24.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-25.png)
![Evaluation of State-Space Graphs b](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-26.png)
![Evaluation of State-Space Graphs b](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-27.png)
![Evaluation of State-Space Graphs Additive Cost Measures](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-28.png)
![Evaluation of State-Space Graphs Additive Cost Measures](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-29.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-30.png)
![Evaluation of State-Space Graphs Relation to the Algorithm BF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-31.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-32.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-33.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-34.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-35.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-36.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-37.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-38.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-39.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-40.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-41.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-42.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-43.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-44.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-45.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-46.png)
![Evaluation of State-Space Graphs Optimum Solution Cost and Order Preservation](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-47.png)
![Evaluation of State-Space Graphs Examples of simple path cost functions based on non-negative edge cost values](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-48.png)
![Evaluation of State-Space Graphs Taxonomy of Best-First Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-49.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-50.png)
![Algorithm A* ∗](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-51.png)
![Algorithm A* A∗ (s, successors, ?, c, h) // A special case of :::::](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-52.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-53.png)
![Algorithm A* Example: Knight Moves Search a shortest sequence of knight moves leading from s to X.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-54.png)
![Algorithm A* Example: Knight Moves Search a shortest sequence of knight moves leading from s to X.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-55.png)
![Algorithm A* Example: Knight Moves](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-56.png)
![Algorithm A* Example: Knight Moves](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-57.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-58.png)
![Algorithm A* Example: Knight Moves](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-59.png)
![Algorithm A* Example: Knight Moves](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-60.png)
![Algorithm A* Example: Knight Moves](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-61.png)
![Algorithm A* Example: Knight Moves](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-62.png)
![Algorithm A* Example: Knight Moves](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-63.png)
![Algorithm A* Exponential Runtime Example](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-64.png)
![Algorithm A* Exponential Runtime Example](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-65.png)
![Algorithm A* Exponential Runtime Example](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-66.png)
![Algorithm A* Exponential Runtime Example](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf2/unit-en-informed-bf2-67.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-1.png)
![BF* Variants For trees G: Breadth-first search is a special case of A*, where h = 0 and](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-2.png)
![BF* Variants For trees G: Breadth-first search is a special case of A*, where h = 0 and](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-3.png)
![BF* Variants For trees G: Breadth-first search is a special case of A*, where h = 0 and](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-4.png)
![BF* Variants For trees G: Breadth-first search is a special case of A*, where h = 0 and](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-5.png)
![BF* Variants For trees G: Uniform-cost search is a special case of A*, where h = 0.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-6.png)
![BF* Variants For trees G: Depth-first search is a special case of A*, where h = 0 and](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-7.png)
![BF* Variants For trees G: Depth-first search is a special case of A*, where h = 0 and](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-8.png)
![BF* Variants For trees G: Depth-first search is a special case of A*, where h = 0 and](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-9.png)
![BF* Variants For trees G: Depth-first search is a special case of A*, where h = 0 and](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-10.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-11.png)
![BF* Variants Greedy best-first search is a special case of BF*, where f (n) = h(n), for all nodes n.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-12.png)
![BF* Variants Greedy best-first search is a special case of BF*, where f (n) = h(n), for all nodes n.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-13.png)
![BF* Variants Greedy best-first search is a special case of BF*, where f (n) = h(n), for all nodes n.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-14.png)
![BF* Variants Greedy best-first search is a special case of BF*, where f (n) = h(n), for all nodes n.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-15.png)
![BF* Variants OPEN List Size Restriction:: Hill-Climbing (HC)](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-16.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-17.png)
![BF* Variants OPEN List Size Restriction: Best-First Beam Search [Rich & Knight 1991]](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-18.png)
![BF* Variants Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-19.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-20.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-21.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-22.png)
![Hybrid Strategies Spectrum of Search Strategies](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-23.png)
![Hybrid Strategies Spectrum of Search Strategies](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-24.png)
![Hybrid Strategies Spectrum of Search Strategies](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-25.png)
![Hybrid Strategies Spectrum of Search Strategies](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-26.png)
![Hybrid Strategies Spectrum of Search Strategies](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-27.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-28.png)
![Hybrid Strategies Strategy 1: BF at Top](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-29.png)
![Hybrid Strategies](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-30.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-31.png)
![Hybrid Strategies Strategy 3: Extended Expansion](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-32.png)
![Hybrid Strategies Strategy 3: Extended Expansion](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-33.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-34.png)
![Hybrid Strategies Strategy 4: Focal Search [Ibaraki 1978]](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-35.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-36.png)
![Hybrid Strategies Strategy 5: Staged Search [Nilson 1971]](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-37.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-38.png)
![Hybrid Strategies Strategy 6: Iterative Deepening A* – IDA* [Korf 1985]](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-39.png)
![Hybrid Strategies f -value-limited DFS](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-40.png)
![Hybrid Strategies Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-41.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf3/unit-en-informed-bf3-42.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-1.png)
![Best-First Search for AND-OR Graphs Principles of Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-2.png)
![Best-First Search for AND-OR Graphs Principles of Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-3.png)
![Best-First Search for AND-OR Graphs Principles of Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-4.png)
![Best-First Search for AND-OR Graphs Principles of Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-5.png)
![Best-First Search for AND-OR Graphs Principles of Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-6.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-7.png)
![Best-First Search for AND-OR Graphs Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-8.png)
![Best-First Search for AND-OR Graphs GBF(s, successors, is_solved, f1 , f2 )](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-9.png)
![Best-First Search for AND-OR Graphs GBF(s, successors, is_solved, f1 , f2 )](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-10.png)
![Best-First Search for AND-OR Graphs GBF(s, successors, is_solved, f1 , f2 )](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-11.png)
![Best-First Search for AND-OR Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-12.png)
![Remarks: IF ( ⊥ (n0 )](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-13.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-14.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-15.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-16.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-17.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-18.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-19.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-20.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-21.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-22.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-23.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-24.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-25.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-26.png)
![Best-First Search for AND-OR Graphs Illustration of GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-27.png)
![Best-First Search for AND-OR Graphs Multiple Accounting of a Node](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-28.png)
![Best-First Search for AND-OR Graphs Multiple Accounting of a Node](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-29.png)
![Best-First Search for AND-OR Graphs Multiple Accounting of a Node](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-30.png)
![Best-First Search for AND-OR Graphs Multiple Accounting of a Node](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-31.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-32.png)
![Best-First Search for AND-OR Graphs Optimality of Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-33.png)
![Best-First Search for AND-OR Graphs Optimality of Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-34.png)
![Best-First Search for AND-OR Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-35.png)
![Best-First Search for AND-OR Graphs Illustration of GBF*](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-36.png)
![Best-First Search for AND-OR Graphs Illustration of GBF*](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-37.png)
![Best-First Search for AND-OR Graphs Illustration of GBF*](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-38.png)
![Best-First Search for AND-OR Graphs Illustration of GBF*](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-39.png)
![Best-First Search for AND-OR Graphs Illustration of GBF*](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-40.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-41.png)
![Relation between GBF and BF Algorithm GBF applied to a state-space graph will simulate Algorithm BF.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-42.png)
![Relation between GBF and BF Algorithm GBF applied to a state-space graph will simulate Algorithm BF.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-43.png)
![Relation between GBF and BF Algorithm GBF applied to a state-space graph will simulate Algorithm BF.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-44.png)
![Relation between GBF and BF Algorithm GBF applied to a state-space graph will simulate Algorithm BF.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-45.png)
![Relation between GBF and BF Algorithm GBF applied to a state-space graph will simulate Algorithm BF.](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-46.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-47.png)
![Relation between GBF and BF Irrevocability is not Amenable to Problem Reduction Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-48.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf4/unit-en-informed-bf4-49.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-1.png)
![Cost Functions for AND-OR Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-2.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-3.png)
![Cost Functions for AND-OR Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-4.png)
![Cost Functions for AND-OR Graphs Overview](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-5.png)
![Cost Functions for AND-OR Graphs If solution graphs are known, the solution cost for a solution graph can be](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-6.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-7.png)
![Cost Functions for AND-OR Graphs If the entire search space graph rooted at a node s is known, the optimum solution](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-8.png)
![Cost Functions for AND-OR Graphs If the entire search space graph rooted at a node s is known, the optimum solution](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-9.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-10.png)
![Cost Functions for AND-OR Graphs If the entire search space graph rooted at a node s is known, the optimum solution](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-11.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-12.png)
![Cost Functions for AND-OR Graphs If the search space graph rooted at a node s is known partially, the optimum](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-13.png)
![Cost Functions for AND-OR Graphs If the search space graph rooted at a node s is known partially, the optimum](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-14.png)
![Cost Functions for AND-OR Graphs If the search space graph rooted at a node s is known partially, the optimum](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-15.png)
![Cost Functions for AND-OR Graphs If the search space graph rooted at a node s is known partially, the optimum](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-16.png)
![Cost Functions for AND-OR Graphs Recursive Cost Functions](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-17.png)
![Cost Functions for AND-OR Graphs Recursive Cost Functions](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-18.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-19.png)
![Cost Functions for AND-OR Graphs Illustration of CH](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-20.png)
![Cost Functions for AND-OR Graphs Illustration of CH](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-21.png)
![Cost Functions for AND-OR Graphs Illustration of CH](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-22.png)
![Cost Functions for AND-OR Graphs Illustration of CH](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-23.png)
![Cost Functions for AND-OR Graphs Illustration of CH](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-24.png)
![Cost Functions for AND-OR Graphs Illustration of CH](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-25.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-26.png)
![Cost Functions for AND-OR Graphs Recursive Cost Functions](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-27.png)
![Cost Functions for AND-OR Graphs Recursive Cost Functions](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-28.png)
![Chapter S:III III. Informed Search](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-29.png)
![Evaluation of AND-OR Graphs Recursive Cost Functions and Efficiency](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-30.png)
![Evaluation of AND-OR Graphs Recursive Cost Functions and Efficiency](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-31.png)
![Evaluation of AND-OR Graphs Illustration of C ∗](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-32.png)
![Evaluation of AND-OR Graphs Illustration of C ∗](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-33.png)
![Evaluation of AND-OR Graphs Illustration of C ∗](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-34.png)
![Evaluation of AND-OR Graphs ] Illustration of C ∗](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-35.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-36.png)
![Evaluation of AND-OR Graphs Recursive Cost Functions and Efficiency](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-37.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-38.png)
![Evaluation of AND-OR Graphs b](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-39.png)
![Evaluation of AND-OR Graphs Relation to the Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-40.png)
![Evaluation of AND-OR Graphs Relation to the Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-41.png)
![Evaluation of AND-OR Graphs Relation to the Algorithm GBF](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-42.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-43.png)
![Evaluation of AND-OR Graphs Taxonomy of Best-First Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-informed-bf5/unit-en-informed-bf5-44.png)
![Chapter S:IV IV. Search Space Representation](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-1.png)
![Problem Solving Problem Characterization](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-2.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-3.png)
![Problem Solving Problem Characterization](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-4.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-5.png)
![Problem Solving Problem Characterization](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-6.png)
![Problem Solving Decision Problem: Abstract Definition](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-7.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-8.png)
![Problem Solving Search Problem: Abstract Definition](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-9.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-10.png)
![Remarks: (continued)](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-11.png)
![Problem Solving Optimization Problem: Abstract Definition](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-12.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-13.png)
![Chapter S:IV IV. Search Space Representation](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-14.png)
![Systematic Search Search Building Blocks](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-15.png)
![Systematic Search Search Building Blocks](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-16.png)
![Systematic Search Definition 1 (Systematic Control Strategy, Systematic Search)](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-17.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-18.png)
![Systematic Search Categorization of Heuristic [Problem Solving] Methods](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-19.png)
![Systematic Search Categorization of Heuristic [Problem Solving] Methods](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-20.png)
![Chapter S:IV IV. Search Space Representation](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-21.png)
![Search Space Encoding Encoding of Solution Candidates](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-22.png)
![Search Space Encoding Encoding of Solution Candidates](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-23.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-24.png)
![Search Space Encoding Applicable Heuristic Problem Solving Methods](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-25.png)
![Search Space Encoding OPEN List Restriction: Hill-Climbing (HC)](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-26.png)
![Search Space Encoding Hill-Climbing](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-27.png)
![Search Space Encoding Hill-Climbing](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-28.png)
![Search Space Encoding Hill-Climbing: Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-29.png)
![Search Space Encoding Hill-Climbing: Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-30.png)
![Search Space Encoding Hill-Climbing: Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-31.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-32.png)
![Search Space Encoding Encoding of Solution Candidates](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-33.png)
![Search Space Encoding Encoding of Solution Candidates](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-34.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-35.png)
![Remarks: (continued)](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-36.png)
![Search Space Encoding Encoding of Solution Candidates](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-37.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-38.png)
![Search Space Encoding Subset Encoding for the 8-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-39.png)
![Search Space Encoding Subset Encoding for the 8-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-40.png)
![Search Space Encoding Subset Encoding for the 8-Puzzle Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-41.png)
![Search Space Encoding Subset Encoding for the 8-Puzzle Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-42.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-43.png)
![Chapter S:IV IV. Search Space Representation](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-44.png)
![State-Space Representation Subset Encoding in Search](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-45.png)
![State-Space Representation Subset Encoding in Search](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-46.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-47.png)
![State-Space Representation Subset Encoding in Search](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-48.png)
![State-Space Representation Subset Encoding in Search](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-49.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-50.png)
![State-Space Representation Traveling Salesman Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-51.png)
![State-Space Representation Traveling Salesman Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-52.png)
![State-Space Representation Summary: Solving Search Problems by State Space Search](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-53.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-54.png)
![State-Space Representation 8-Queens Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-55.png)
![State-Space Representation 8-Puzzle Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-56.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-57.png)
![Search Space Encoding Applicable Heuristic Problem Solving Methods](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-58.png)
![State-Space Representation Search Problem: Constraint-Satisfaction or Optimization](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-59.png)
![State-Space Representation Search Problem: Constraint-Satisfaction or Optimization](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-60.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation1/unit-en-representation1-61.png)
![Chapter S:IV IV. Search Space Representation](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-1.png)
![Problem-Reduction Representation Problem Solving: Constructing Solutions](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-2.png)
![Problem-Reduction Representation Disadvantage of State-Space Search](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-3.png)
![Problem-Reduction Representation Applicable Heuristic Problem Solving Methods](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-4.png)
![Problem-Reduction Representation Problem Solving: Solution Steps](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-5.png)
![Problem-Reduction Representation Problem Solving Steps as Different Link Types](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-6.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-7.png)
![Problem-Reduction Representation Counterfeit Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-8.png)
![Problem-Reduction Representation Counterfeit Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-9.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-10.png)
![Problem-Reduction Representation The Different Node types](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-11.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-12.png)
![Problem-Reduction Representation Search Building Blocks [State-Space]](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-13.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-14.png)
![Problem-Reduction Representation Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-15.png)
![Problem-Reduction Representation Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-16.png)
![Problem-Reduction Representation Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-17.png)
![Problem-Reduction Representation Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-18.png)
![Problem-Reduction Representation Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-19.png)
![Problem-Reduction Representation Solution Graphs with Cycles (1)](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-20.png)
![Problem-Reduction Representation Solution Graphs with Cycles (1)](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-21.png)
![Problem-Reduction Representation Solution Graphs with Cycles (1)](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-22.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-23.png)
![Problem-Reduction Representation Hypergraphs](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-24.png)
![Chapter S:IV IV. Search Space Representation](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-25.png)
![Choosing a Representation Problem-Reduction Graphs with Alternating Node Types](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-26.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-27.png)
![Choosing a Representation Problem-Reduction Graphs with Alternating Node Types](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-28.png)
![Choosing a Representation Transforming Problem-Reduction into State-Space Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-29.png)
![Choosing a Representation Transforming Problem-Reduction into State-Space Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-30.png)
![Choosing a Representation Transforming Problem-Reduction into State-Space Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-31.png)
![Choosing a Representation Transforming Problem-Reduction into State-Space Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-32.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-33.png)
![Choosing a Representation Transformed Counterfeit Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-34.png)
![Choosing a Representation State-Space versus Problem-Reduction Representation](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-35.png)
![Choosing a Representation State-Space versus Problem-Reduction Representation](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-36.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-37.png)
![Choosing a Representation Tower of Hanoi Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-38.png)
![Choosing a Representation Tower of Hanoi Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-39.png)
![Choosing a Representation Tower of Hanoi Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-40.png)
![Choosing a Representation Tower of Hanoi Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-41.png)
![Choosing a Representation Tower of Hanoi Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-42.png)
![Choosing a Representation Tower of Hanoi Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-43.png)
![Choosing a Representation Tower of Hanoi Problem](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-44.png)
![Choosing a Representation Means-End Analysis](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-45.png)
![Choosing a Representation Means-End Analysis](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-46.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-47.png)
![Chapter S:IV IV. Search Space Representation](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-48.png)
![Relation to Dynamic Programming Optimum Solution Cost and Bellman’s Principle of Optimality](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-49.png)
![Relation to Dynamic Programming Optimum Solution Cost and Bellman’s Principle of Optimality](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-50.png)
![Relation to Dynamic Programming Optimum Solution Cost and Bellman’s Principle of Optimality](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-51.png)
![Relation to Dynamic Programming Optimum Solution Cost and Bellman’s Principle of Optimality](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-52.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-53.png)
![Relation to Dynamic Programming Optimum Solution Cost and Bellman’s Principle of Optimality](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-54.png)
![Relation to Dynamic Programming Optimum Solution Cost and Bellman’s Principle of Optimality](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-55.png)
![Relation to Dynamic Programming Partially Explored State Spaces](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-56.png)
![Relation to Dynamic Programming Partially Explored State Spaces](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-57.png)
![Relation to Dynamic Programming Partially Explored State Spaces](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-58.png)
![Relation to Dynamic Programming Partially Explored State Spaces](https://downloads.webis.de/lecturenotes/search/unit-en-representation2/unit-en-representation2-59.png)
![Chapter S:V V. Formal Properties of A*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-1.png)
![Remarks (outline) :](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-2.png)
![Properties of Search Space Graphs Properties for Node Expansion](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-3.png)
![Properties of Search Space Graphs Additional Required Properties](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-4.png)
![Properties of Search Space Graphs Additional Required Properties](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-5.png)
![Properties of Search Space Graphs Non-Existence of Optimum Solution Paths](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-6.png)
![Properties of Search Space Graphs Problems in the Search for Optimum Solution Paths](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-7.png)
![Properties of Search Space Graphs PropA∗ (G): Required Properties of G for A* Search](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-8.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-9.png)
![Properties of Search Space Graphs Existence of Optimum Solution Path](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-10.png)
![Properties of Search Space Graphs Existence of Optimum Solution Path](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-11.png)
![Properties of Search Space Graphs Existence of Optimum Solution Path](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-12.png)
![Chapter S:V V. Formal Properties of A*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-13.png)
![Auxiliary Concepts Search Space Graph versus Traversal Tree](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-14.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-15.png)
![Auxiliary Concepts Illustration of Traversal Trees](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-16.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-17.png)
![Auxiliary Concepts Definition 56 (Specific Paths and Functions)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-18.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-19.png)
![Auxiliary Concepts Definition 56 (Specific Paths and Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-20.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-21.png)
![Auxiliary Concepts Definition 56 (Specific Paths and Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-22.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-23.png)
![Auxiliary Concepts Definition 56 (Specific Paths and Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-24.png)
![Auxiliary Concepts Definition 56 (Specific Paths and Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-25.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-26.png)
![Auxiliary Concepts Definition 56 (Specific Paths and Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-27.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-28.png)
![Auxiliary Concepts Lemma 57 (Basic Observations)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-29.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-30.png)
![Chapter S:V V. Formal Properties of A*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-31.png)
![Roadmap Important Lemmas and Theorems](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-32.png)
![Chapter S:V V. Formal Properties of A*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-33.png)
![Completeness of A* Two important concepts for algorithms with regard to the returned solutions are](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-34.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-35.png)
![Completeness of A* Termination](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-36.png)
![Completeness of A* Termination](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-37.png)
![Remarks: 1. Since G has PropA∗ (G), the evaluation function f is cycle-avers. Therefore, we only have to](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-38.png)
![Completeness of A* Shallowest OPEN Node](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-39.png)
![Completeness of A* Shallowest OPEN Node](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-40.png)
![Completeness of A* Illustration of Shallowest OPEN Node](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-41.png)
![Completeness of A* Illustration of Shallowest OPEN Node](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-42.png)
![Completeness of A* Illustration of Shallowest OPEN Node](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-43.png)
![Completeness of A* Illustration of Shallowest OPEN Node](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-44.png)
![Completeness of A* Shallowest OPEN Node](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-45.png)
![Completeness of A* Shallowest OPEN Node](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-46.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-47.png)
![Completeness of A* Lemma 61 (Completeness for Finite Graph)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-48.png)
![Completeness of A* Lemma 61 (Completeness for Finite Graph)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-49.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-50.png)
![Completeness of A* Lemma 62 (Shallowest OPEN Node on Path)?](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-51.png)
![Completeness of A* Lemma 62 (Shallowest OPEN Node on Path)?](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-52.png)
![Completeness of A* Theorem 63 (Completeness)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-53.png)
![Completeness of A* Theorem 63 (Completeness)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-54.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-55.png)
![Chapter S:V V. Formal Properties of A*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-56.png)
![Admissibility of A* Lemma 64 (Node Cost on Optimum Path)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-57.png)
![Admissibility of A* Lemma 64 (Node Cost on Optimum Path)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-58.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-59.png)
![Admissibility of A* Corollary 65 (Implications of Lemma 64)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-60.png)
![Admissibility of A* Definition 66 (Admissibility of h)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-61.png)
![Admissibility of A* Corollary 67 (Shallowest OPEN Node on Optimum Path [Lemma 62])?](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-62.png)
![Admissibility of A* Corollary 67 (Shallowest OPEN Node on Optimum Path [Lemma 62])?](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-63.png)
![Remarks: ? The Lemma states that nodes on optimum paths are reached by A* with optimum cost when](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-64.png)
![Admissibility of A* Lemma 68 (C ∗-Bounded OPEN Node)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-65.png)
![Admissibility of A* Lemma 68 (C ∗-Bounded OPEN Node)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-66.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-67.png)
![Admissibility of A* Theorem 69 (Admissibility [Hart, Nilsson, Raphael 1968,1972])](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-68.png)
![Admissibility of A* Theorem 69 (Admissibility [Hart, Nilsson, Raphael 1968,1972])](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-69.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal1/unit-en-astar-formal1-70.png)
![Chapter S:V V. Formal Properties of A*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-1.png)
![Efficiency of A* Efficiency of Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-2.png)
![Efficiency of A* Efficiency of Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-3.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-4.png)
![Efficiency of A* Efficiency of Search Algorithms](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-5.png)
![Efficiency of A* Conditions for Node Expansion I](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-6.png)
![Efficiency of A* Conditions for Node Expansion I](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-7.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-8.png)
![Efficiency of A* Conditions for Node Expansion I](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-9.png)
![Efficiency of A* Conditions for Node Expansion I](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-10.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-11.png)
![Efficiency of A* Conditions for Node Expansion I](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-12.png)
![Efficiency of A* Conditions for Node Expansion I](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-13.png)
![Efficiency of A* Conditions for Node Expansion II](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-14.png)
![Efficiency of A* Conditions for Node Expansion II](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-15.png)
![Efficiency of A* Conditions for Node Expansion II](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-16.png)
![Efficiency of A* Conditions for Node Expansion II](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-17.png)
![Efficiency of A* Conditions for Node Expansion II](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-18.png)
![Efficiency of A* Conditions for Node Expansion II](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-19.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-20.png)
![Efficiency of A* Conditions for Node Expansion II](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-21.png)
![Efficiency of A* Informedness and Dominance](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-22.png)
![Efficiency of A* Informedness and Dominance](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-23.png)
![Efficiency of A* Informedness and Dominance](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-24.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-25.png)
![Efficiency of A* Informedness and Dominance: Discussion](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-26.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-27.png)
![Chapter S:V V. Formal Properties of A*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-28.png)
![Monotone Heuristic Functions Motivation](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-29.png)
![Monotone Heuristic Functions Motivation](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-30.png)
![Monotone Heuristic Functions Motivation](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-31.png)
![Monotone Heuristic Functions Motivation](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-32.png)
![Monotone Heuristic Functions Illustration of the Global Triangle Inequality](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-33.png)
![Monotone Heuristic Functions Illustration of the Local Triangle Inequality](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-34.png)
![Monotone Heuristic Functions Definition 79 (Consistency Condition)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-35.png)
![Monotone Heuristic Functions Definition 79 (Consistency Condition)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-36.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-37.png)
![Monotone Heuristic Functions Theorem 81 (Consistency Equivalent to Monotonicity)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-38.png)
![Monotone Heuristic Functions Theorem 81 (Consistency Equivalent to Monotonicity)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-39.png)
![Monotone Heuristic Functions Illustration of a Monotone h](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-40.png)
![Monotone Heuristic Functions Illustration of a Monotone h](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-41.png)
![Monotone Heuristic Functions Theorem 82 (Monotone Heuristic Functions)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-42.png)
![Monotone Heuristic Functions Theorem 82 (Monotone Heuristic Functions)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-43.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-44.png)
![Monotone Heuristic Functions Theorem 83 (No Reopening)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-45.png)
![Monotone Heuristic Functions Theorem 83 (No Reopening)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-46.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-47.png)
![Monotone Heuristic Functions Illustration of a Non-Monotone h](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-48.png)
![Monotone Heuristic Functions Illustration of a Non-Monotone h](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-49.png)
![Monotone Heuristic Functions Illustration of a Non-Monotone h](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-50.png)
![Monotone Heuristic Functions Illustration of a Non-Monotone h](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-51.png)
![Monotone Heuristic Functions Illustration of a Non-Monotone h](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-52.png)
![Monotone Heuristic Functions Theorem 84 (Non-Decreasing f -Values)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-53.png)
![Monotone Heuristic Functions Theorem 84 (Non-Decreasing f -Values)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-54.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-55.png)
![Monotone Heuristic Functions Illustration of Non-Decreasing f -Values](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-56.png)
![Monotone Heuristic Functions Illustration of Non-Decreasing f -Values](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-57.png)
![Monotone Heuristic Functions Example: Knight Moves (revisited)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-58.png)
![Monotone Heuristic Functions Example: Knight Moves (revisited)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-59.png)
![Monotone Heuristic Functions Example: Knight Moves (revisited)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-60.png)
![Monotone Heuristic Functions Coping with non-monotonicity](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-61.png)
![Monotone Heuristic Functions Coping with non-monotonicity](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-62.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-63.png)
![Monotone Heuristic Functions Conditions for Node Expansion III](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-64.png)
![Monotone Heuristic Functions Conditions for Node Expansion III](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-65.png)
![Monotone Heuristic Functions Conditions for Node Expansion III](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-66.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-67.png)
![Monotone Heuristic Functions Definition 86 (Largely Dominating Algorithms)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-68.png)
![Monotone Heuristic Functions Definition 86 (Largely Dominating Algorithms)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-69.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-formal2/unit-en-astar-formal2-70.png)
![Chapter S:VI VI. Relaxed Models](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-1.png)
![Motivation](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-2.png)
![Motivation Basic Questions from Search Theory](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-3.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-4.png)
![Motivation Examination of g and h](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-5.png)
![Motivation Examination of g and h](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-6.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-7.png)
![Chapter S:VI VI. Relaxed Models](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-8.png)
![ε-Admissible Speedup Versions of A* Bounded Decrease in Solution Quality](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-9.png)
![ε-Admissible Speedup Versions of A* Bounded Decrease in Solution Quality](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-10.png)
![ε-Admissible Speedup Versions of A* Static Weighting A* Search: WA*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-11.png)
![ε-Admissible Speedup Versions of A* Static Weighting A* Search: WA*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-12.png)
![ε-Admissible Speedup Versions of A* Static Weighting A* Search: WA*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-13.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-14.png)
![ε-Admissible Speedup Versions of A* Static Weighting A* Search: WA*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-15.png)
![ε-Admissible Speedup Versions of A* Static Weighting A* Search: WA*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-16.png)
![ε-Admissible Speedup Versions of A* Dynamic Weighting A* Search: DWA*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-17.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-18.png)
![ε-Admissible Speedup Versions of A* Dynamic Weighting A* Search: DWA*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-19.png)
![ε-Admissible Speedup Versions of A* Dynamic Weighting A* Search: DWA*](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-20.png)
![ε-Admissible Speedup Versions of A* Node Selection by hF (n): A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-21.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-22.png)
![ε-Admissible Speedup Versions of A* Node Selection by hF (n): A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-23.png)
![ε-Admissible Speedup Versions of A* Node Selection by hF (n): A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-24.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-25.png)
![ε-Admissible Speedup Versions of A* Comparison of DWA* and A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-26.png)
![ε-Admissible Speedup Versions of A* Comparison of DWA* and A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-27.png)
![ε-Admissible Speedup Versions of A* Comparison of DWA* and A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-28.png)
![ε-Admissible Speedup Versions of A* Comparison of DWA* and A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-29.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-30.png)
![ε-Admissible Speedup Versions of A* Unifying View: WA* and DWA* as Variants of A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-31.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-32.png)
![ε-Admissible Speedup Versions of A* Lemma 92 (WA* and DWA* are variants of A*ε)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-33.png)
![ε-Admissible Speedup Versions of A* Lemma 92 (WA* and DWA* are variants of A*ε)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-34.png)
![ε-Admissible Speedup Versions of A* Pruning Power of h for A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-35.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-36.png)
![ε-Admissible Speedup Versions of A* Using Monotone Heuristic Functions h in A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-37.png)
![ε-Admissible Speedup Versions of A* Using Monotone Heuristic Functions h in A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-38.png)
![ε-Admissible Speedup Versions of A* Example: Monotone Heuristic Function h in A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-39.png)
![ε-Admissible Speedup Versions of A* Using Monotone Heuristic Functions h in A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-40.png)
![ε-Admissible Speedup Versions of A* Using Monotone Heuristic Functions h in A*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-41.png)
![ε-Admissible Speedup Versions of A* Example: Monotone heuristic function h in NRA*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-42.png)
![ε-Admissible Speedup Versions of A* Using Monotone Heuristic Functions h in NRA*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-43.png)
![ε-Admissible Speedup Versions of A* Using Monotone Heuristic Functions h in NRA*ε](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed1/unit-en-astar-relaxed1-44.png)
![Chapter S:VI VI. Relaxed Models](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-1.png)
![Using Information about Uncertainty of h Using a Non-admissible Heuristic Function](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-2.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-3.png)
![Using Information about Uncertainty of h Illustration of Underestimating and Overestimating Estimation Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-4.png)
![Using Information about Uncertainty of h Example: Search in “Random” Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-5.png)
![Using Information about Uncertainty of h Example: Search in “Random” Graphs](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-6.png)
![Using Information about Uncertainty of h Describing the Estimation Uncertainty Using Density Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-7.png)
![Using Information about Uncertainty of h Describing the Estimation Uncertainty Using Density Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-8.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-9.png)
![Using Information about Uncertainty of h Describing the Estimation Uncertainty Using Density Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-10.png)
![Using Information about Uncertainty of h Describing the Estimation Uncertainty Using Density Functions](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-11.png)
![Remarks: (a) If the density functions do not overlap, the node for which the corresponding density function](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-12.png)
![Chapter S:VI VI. Relaxed Models](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-13.png)
![Risk Measures Defining the Order of Node Evaluations](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-14.png)
![Risk Measures Principle of the Algorithm R*δ](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-15.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-16.png)
![Risk Measures Potential for Improvement to a Current Solution](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-17.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-18.png)
![Risk Measures Risk Threshold and Cost Treshold](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-19.png)
![Risk Measures Definition 96 (Risk Measure)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-20.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-21.png)
![Risk Measures Definition 98 (δ-Risk-Admissibility)](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-22.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-23.png)
![Risk Measures Risk Measures of Type R(C) = %[C − f +]](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-24.png)
![Risk Measures Risk Measures of Type R(C) = %[C − f +]](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-25.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-26.png)
![Risk Measures Example](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-27.png)
![Risk Measures Example](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-28.png)
![S:VI-73](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-29.png)
![Risk Measures Example](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-30.png)
![S:VI-75](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-31.png)
![Risk Measures Example](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-32.png)
![Risk Measures Example](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-33.png)
![Risk Measures Example](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-34.png)
![Risk Measures δ-Risk-Admissibility](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-35.png)
![Risk Measures δ-Risk-Admissibility](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-36.png)
![Risk Measures δ-Risk-Admissibility](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-37.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-astar-relaxed2/unit-en-astar-relaxed2-38.png)
![Kapitel S:VI VI. Relaxed Models](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-1.png)
![Heuristiken aus Modellvereinfachungen Beispiel: Modellvereinfachung für das 8-Puzzle](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-2.png)
![Heuristiken aus Modellvereinfachungen Beispiel: Modellvereinfachung für das 8-Puzzle](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-3.png)
![Heuristiken aus Modellvereinfachungen Beispiel: Modellvereinfachung für TSP](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-4.png)
![Heuristiken aus Modellvereinfachungen Beispiel: Modellvereinfachung für TSP](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-5.png)
![Heuristiken aus Modellvereinfachungen Relaxation](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-6.png)
![Heuristiken aus Modellvereinfachungen Relaxation](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-7.png)
![Heuristiken aus Modellvereinfachungen Zulässigkeit, Konsistenz und Monotonie](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-8.png)
![Heuristiken aus Modellvereinfachungen Over-Constraining](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-9.png)
![Kapitel S:VI VI. Relaxed Models](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-10.png)
![Automatische Generierung von Heuristiken Systematisches Relaxieren von Suchproblemen](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-11.png)
![Automatische Generierung von Heuristiken Beispiel: 8er-Puzzle](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-12.png)
![Automatische Generierung von Heuristiken Beispiel: 8er-Puzzle](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-13.png)
![Automatische Generierung von Heuristiken Systematisches Relaxieren von Suchproblemen](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-14.png)
![Automatische Generierung von Heuristiken Einfache Probleme: kompositionale Probleme](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-15.png)
![Automatische Generierung von Heuristiken Einfache Probleme: semikompositionale Probleme](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-16.png)
![Kapitel S:VI VI. Relaxed Models](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-17.png)
![Probabilistische Heuristiken Probabilistisch definierte Probleme](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-18.png)
![Probabilistische Heuristiken Probabilistisch definierte Probleme](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-19.png)
![Probabilistische Heuristiken Probabilistisch definierte Probleme](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-20.png)
![Bemerkungen:](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-21.png)
![Probabilistische Heuristiken Asymptotische Verteilung von C(N, p)](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-22.png)
![Probabilistische Heuristiken Asymptotische Verteilung von C(N, p)](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-23.png)
![Probabilistische Heuristiken Asymptotische Verteilung von C(N, p)](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-24.png)
![Probabilistische Heuristiken Heuristiken aus der Analyse von Stichproben](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-25.png)
![Probabilistische Heuristiken Heuristiken aus der Analyse von Stichproben](https://downloads.webis.de/lecturenotes/search/unit-de-designing-heuristics/unit-de-designing-heuristics-26.png)
![Chapter S:VII VII. Game Playing](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-1.png)
![Game Playing Introduction The game tree search here focuses on two-player perfect-information games:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-2.png)
![Game Playing Introduction The game tree search here focuses on two-player perfect-information games:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-3.png)
![Game Playing Introduction Definition 103 (Game Tree)](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-4.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-5.png)
![Game Playing Introduction Illustration:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-6.png)
![Game Playing Introduction Illustration:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-7.png)
![Game Playing Introduction Definition 104 (Status Labeling Procedure)](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-8.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-9.png)
![Game Playing Introduction Definition 105 (Game Strategy, Solution Tree, Winning Strategy)](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-10.png)
![Game Playing Introduction Illustration](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-11.png)
![Game Playing Introduction Two strategies T +, T −, of Max and Min respectively, share at each level either one](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-12.png)
![Game Playing Introduction Strategy considerations for two-player, perfect-information games:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-13.png)
![Game Playing Introduction Strategy considerations for two-player, perfect-information games:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-14.png)
![Game Playing Introduction Strategy considerations for two-player, perfect-information games:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-15.png)
![Game Playing Introduction Strategy considerations for two-player, perfect-information games:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-16.png)
![Game Playing Introduction Strategy considerations for two-player, perfect-information games:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-17.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-18.png)
![Game Playing Introduction The labeling of game trees is possible without distinguishing between Max and](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-19.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-20.png)
![Chapter S:VII VII. Game Playing](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-21.png)
![Evaluation Functions for Game Trees Status labeling requires the generation of nearly the complete game tree. The](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-22.png)
![Evaluation Functions for Game Trees Status labeling requires the generation of nearly the complete game tree. The](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-23.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-24.png)
![Evaluation Functions for Game Trees Handling Huge or Even Infinite Game Trees](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-25.png)
![Evaluation Functions for Game Trees Definition 107 (Minimax Rule)](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-26.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-27.png)
![Chapter S:VII VII. Game Playing](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-28.png)
![Propagation Algorithms for Game Trees](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-29.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-30.png)
![Propagation Algorithms for Game Trees](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-31.png)
![Propagation Algorithms for Game Trees The pruning rationale used by the algorithm SOLVE is not restricted to two-valued](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-32.png)
![Propagation Algorithms for Game Trees Game tree with propagated minimax values:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-33.png)
![Propagation Algorithms for Game Trees Game tree with propagated minimax values:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-34.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-35.png)
![Propagation Algorithms for Game Trees Intuition of α-Bounds](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-36.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-37.png)
![Propagation Algorithms for Game Trees Intuition of β-Bounds](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-38.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-39.png)
![Propagation Algorithms for Game Trees The α-β-pruning scheme:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-40.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-41.png)
![Propagation Algorithms for Game Trees Algorithm:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-42.png)
![Propagation Algorithms for Game Trees](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-43.png)
![Remarks:](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-44.png)
![Propagation Algorithms for Game Trees Example: Propagating evaluations with ALPHA-BETA](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-45.png)
![Propagation Algorithms for Game Trees Example: Propagating evaluations with ALPHA-BETA](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-46.png)
![Propagation Algorithms for Game Trees Example: Propagating evaluations with ALPHA-BETA](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-47.png)
![Propagation Algorithms for Game Trees Example: Propagating evaluations with ALPHA-BETA](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-48.png)
![Propagation Algorithms for Game Trees Example: Propagating evaluations with ALPHA-BETA](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-49.png)
![Propagation Algorithms for Game Trees Example: Propagating evaluations with ALPHA-BETA](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-50.png)
![Propagation Algorithms for Game Trees Example: Propagating evaluations with ALPHA-BETA](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-51.png)
![Propagation Algorithms for Game Trees Example: Propagating evaluations with ALPHA-BETA](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-52.png)
![Propagation Algorithms for Game Trees Example: Propagating evaluations with ALPHA-BETA](https://downloads.webis.de/lecturenotes/search/unit-en-game-playing-basics/unit-en-game-playing-basics-53.png)
Shortcut | Documents |
---|---|
↑/↓
|
Navigate documents |
Shift + ↑/↓
|
Navigate 3 documents |
Shortcut | Pages |
---|---|
←/→
|
Navigate pages |
Shift + MouseWheel
|
Navigate pages |
Shift + ←/→
|
Navigate 3 pages |