Curr We add extra info to our stack. For this problem, a string “” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “” 0 Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “” 0 3 “c” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “” 0 3 “c” 2 “b” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “” 0 3 “c” 2 “b” 1 “a” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “a” 0 3 “c” 2 “b” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “a” 0 1 3 “c” 2 “b” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “a” 0 1 1 “ab” 3 “c” 2 “b” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “a” 0 1 1 “ab” 3 “c” 2 “b” 1 “ac” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
Curr We add extra info to our stack. For this problem, a string “a” 0 1 1 “ab” 3 “c” 2 “b” 1 “ac” 2 “aa” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
We add extra info to our stack. For this problem, a string 0 1 2 “aa” 1 “ab” 3 “c” 2 “b” 1 “ac” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
We add extra info to our stack. For this problem, a string 0 1 2 “aa” 2 1 “ab” 3 “c” 2 “b” 1 “ac” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
We add extra info to our stack. For this problem, a string 0 1 2 “aa” 2 1 “ab” 3 “c” 2 “b” 1 “ac” 3 “aac” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
We add extra info to our stack. For this problem, a string 0 1 2 “aa” 2 1 “ab” 3 “c” 2 “b” 1 “ac” 3 “aac” 4 “aab” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
We add extra info to our stack. For this problem, a string 0 1 2 “aa” 2 1 “ab” 3 “c” 2 “b” 1 “ac” 3 “aac” 4 “aab” 1 “aaa” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
We add extra info to our stack. For this problem, a string 0 1 2 1 “ab” 3 “c” 2 “b” 1 “ac” 3 “aac” 4 “aab” 1 “aaa” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
We add extra info to our stack. For this problem, a string 0 1 2 1 “ab” 3 “c” 2 “b” 1 “ac” 3 “aac” 4 “aab” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo
0 1 2 1 “ab” 3 “c” 2 “b” 1 “ac” 3 “aac” 4 “aab” Repeat until goal is met curr, info = pop from stack if curr is not in visited add curr to visited for each v adjacent to curr push v, newinfo For this problem, goal = accepting state, The info is the string to get us there.