1. 24 mar., 2016 1 validation
    • Larry He's avatar
      Fixed Problems in Python 3 Port · a2502be8
      Larry He a écrit
      Problems fixed:
      Replaced cmp: 1 instance in line 323 of search.py
      Convert set() to {}: 3 instances in line 29 of MDP.py, line 181 and 215
      of search.py
      Convert .sort() to sorted(): 1 instance in line 150 of text.py
      Cast map to list: 1 instance in line 47 of grid.py
      a2502be8
  2. 22 mar., 2016 1 validation
  3. 15 mar., 2016 1 validation
  4. 11 mar., 2016 5 validations
  5. 10 mar., 2016 2 validations
  6. 09 mar., 2016 2 validations
  7. 06 mar., 2016 4 validations
  8. 05 mar., 2016 3 validations
  9. 03 nov., 2011 1 validation
  10. 29 oct., 2011 2 validations
    • withal's avatar
    • withal's avatar
      Fixed search bug reported by Matthew Yurka, and others: · 06a94a25
      withal a écrit
       * graph_search missed deduping nodes in the frontier
       * astar_search didn't use 3rd-edition pseudocode
       * InstrumentedProblem didn't forward the path_cost method,
         so all the doctest results on instrumented cost-sensitive
         problems were wrong
      
      Also filled in breadth_first_search and per-node memoization 
      of h (to fulfill the doc comment saying that was done).
      
      There's a remaining problem that sometimes trivial refactorings
      change the amount of search that is done, slightly, which should
      not happen since the code is supposed to be deterministic.
      06a94a25
  11. 28 oct., 2011 1 validation
  12. 26 oct., 2011 5 validations
  13. 23 oct., 2011 3 validations
  14. 17 oct., 2011 2 validations
  15. 11 oct., 2011 2 validations
  16. 10 oct., 2011 2 validations
  17. 08 oct., 2011 2 validations
  18. 07 oct., 2011 1 validation