Code and Results for Chapter 9:

Introduction:
These are results and code for the problems and examples found in Chapter 9 of this famous book.

1. A Comparison of the number of planning steps in Dyna maze planning:
   • mk_ex_9_1_mz.m (makes the maze for this example)
     
   • dynaQ_maze.m (implements DynaQ learning on mazes)
     
   • plot_mz_policy.m (plots the given policy on a maze)
     
   • dynaQ_maze_Script.m (runs the above function)
     
   • do_ex_9_1_exps.m (does the experiments of Example 9.1)
     
   • sample output using the above codes
     
2. The blocking maze example:
   • mk_ex_9_2_mz.m (makes the maze for this example)
     
   • dynaQplus_maze.m (implements DynaQ Plus learning on mazes)
     
   • dynaQplus_maze_Script.m (runs the above function)
     
   • blocking_mz_Script.m (does the blocking maze experiments of Example 9.2)
     
   • sample output using the above codes
     
3. The shortcut maze:
   • mk_ex_9_3_mz.m (makes the maze for this example)
     
   • sample output using the above codes
     
4. Exercise 9.4:
   • ex_9_4_dynaQplus.m (implements the suggestion from this exercise)
     
   • ex_9_4_dynaQplus_Script.m (runs the above code)
     
   • sample output using the above codes