For bookkeeping, weĬount the number of nodes expanded. We will be defining subtypes of PROBLEM later on. ttt-agent.lisp An Agent for Playing Tic-Tac-Toeįile search/test-search.lisp Test Cases for Searchįile search/algorithms/problems.lisp Defining ProblemsĪ problem is defined by the initial state, and the type of problem it is.vacuum.lisp Definitions for Searching in the Vacuum-World Domain search/agents/:.tsp.lisp The Travelling Salesperson Problem (TSP).route-finding.lisp Find a Route Between Cities on a Map.path-planning.lisp Path Planning in 2 Dimensions with Convex Polygonal Obstacles.nqueens.lisp The N-Queens Puzzle as a Constraint Satisfaction Problem.cannibals.lisp The Missionaries and Cannibals Domain.prob-solve.lisp Problem-Solving Environments search/domains/:.minimax.lisp Deciding What Move to Make in a Game by Minimax or Alpha-Beta Search search/environments/:.iterative.lisp Iterative Improvement Search Algorithms.ida.lisp Iterative Deepening A* (IDA*) Search.csp.lisp Definition of CSPs (Constraint Satisfaction Problems).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |