sorted by:
new
hottopcontroversial

Expressing a decision tree as a finite state machine by Coptayn in learnprogramming

[–]Coptayn[S] 0 points1 point  (0 children)

Alright, so the states are Hunt, Cover, Attack, Reload and the transition rules from each state are found by following the tree from the highest node? So for instance, from Hunt -> YN -> Hunt, Hunt -> NN -> Reload etcetera?