

(En) Artificial Intelligence Algorithm - Search A*. Finite state problem, with exact solution. In each round answers three questions: (1) Is the current state the goal? If so, it closes. If not, go to question 2. (2) Does the current state have children? If so, it expands the current state and goes on to question 3. If not, it closes. (3) Which state among the open states has the lowest value f(n)? Selects the lowest value state and moves on to the next round. (Pt) Algoritmo de Inteligência Arti...

Tap to see all activity →
No reviews for IA Busca A* yet
Be the first to write one.