Problem Solving and Search
Resources
- Solving problems by searching
- Problem solving and search
- Constraint satisfaction problems:
- Constraint satisfaction problems (CSPs) are mathematical questions defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over variables, which is solved by constraint satisfaction methods. CSPs are the subject of intense research in both artificial intelligence and operations research, since the regularity in their formulation provides a common basis to analyze and solve problems of many seemingly unrelated families.
- Constraint satisfaction problems
- Constraint satisfaction problems
- Adversarial Search