See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
15 cards from this deck
If optimal path is A→C through B, then B→C is also optimal (optimal paths contain optimal sub-paths)
Graph with nodes organised into distinct stages or levels
Solving sequential decision problems
Starting point of the journey
Final destination
To use backward induction from destination to source
Start calculations from destination and work backwards
Stage, State, Action, Value
Stage number (reverse from destination to source)
Current node or position
Possible moves or edges from this state
Optimal value from this state to destination
Work backwards from destination
Edge weight +++ optimal value from destination node
Weight of edge connecting to T
Select your subjects, and get access to A+ resources today.