https://www.youtube.com/watch?v=d1KyYyLmGpA Domain Reduction Algorithm Vocabulary Variable v: something that can have an assignment Value x: something that can be assigned Domain d: set of all different values Constraint c: limit on variable values With a depth-first search, the domain reduction algorithm…
7. Constraints: Interpreting Line Drawings
Computer vision Empirical approach Using lines on pictures of real-world objects, the edges between shapes could serve to identify the number of objects in it. The different intersections possible generally form two types of trihedral vertexes to identify shapes: arrow…
6. Search: Games, Minimax, and Alpha-Beta
How a computer can play games (like Chess) How human play chess: mixing analysis, strategy, tactics to choose a move If-Then rules Look ahead and evaluate British museum algorithm To evaluate the potential of the next situation of the board,…
5. Search: Optimal, Branch and Bound, A*
Optimal search trees Finding the best possible sequence of choices. Getting closer to the goal is generally considered good, but it may lead to dead ends or non-optimal choices. Oracle Knowing the minimum path length to the goal, the search…
4. Search: Depth-First, Hill Climbing, Beam
Search trees Search trees represent all the possibilities to search for the quickest path without coming back to previous paths. They are particularly used for quickest paths on maps with nodes (intersections), but not exclusively. They are primarily about choices,…