You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
To avoid cycles in the DFS traversal, modifying the following conditional from:
… ifs is not null then result[s, a] ← s'
add s to front of unbacktracked[s']
…
to:
ifs is not null ands′ ≠ result[s, a] then result[s, a] ← s'
add s to front of unbacktracked[s']
…
without this additional check it is very easy to end up cycling between states, depending on the order of the actions that are tried from each state. Both the current aima-java and aima-python reference implementations contain this additional check.
The text was updated successfully, but these errors were encountered:
To avoid cycles in the DFS traversal, modifying the following conditional from:
…
if s is not null then
result[s, a] ← s'
add s to front of unbacktracked[s']
…
to:
if s is not null and s′ ≠ result[s, a] then
result[s, a] ← s'
add s to front of unbacktracked[s']
…
without this additional check it is very easy to end up cycling between states, depending on the order of the actions that are tried from each state. Both the current aima-java and aima-python reference implementations contain this additional check.
The text was updated successfully, but these errors were encountered: