ai

log

age author description
2006-07-22 Emanuele Aina Added a README to illustrate installation and contents of the archivedefault tip
2006-07-02 Emanuele Aina Use the same beta in Queens and QueensDumb
2006-06-30 Emanuele Aina Removed the old implementation of heuristics()
2006-06-30 Emanuele Aina Cleaned the heuristcs() implementation running in parallel with the old impl
2006-06-29 Emanuele Aina Removed an old test which wasn't current anymore
2006-06-29 Emanuele Aina Removed some trailing space
2006-06-29 Emanuele Aina Don't sum up two hash togheter but combine the strings to be hashed
2006-06-29 Emanuele Aina Store in the state rows, col and diags lists to simplify calculations
2006-06-27 Emanuele Aina Count also the number of reachable goals
2006-06-27 Emanuele Aina Added a way to count of the reachable states for each problem
2006-06-26 Emanuele Aina Fixed the unit displayed for the search time (seconds instead of ms)
2006-06-26 Emanuele Aina Evaluate the search behaviour even with dumbed heuristics
2006-06-26 Emanuele Aina Fix inheritance in State by creating new instances of the current class
2006-06-21 Emanuele Aina Test the PruningBreadthSolver with several beta values
2006-06-21 Emanuele Aina Print the beta value while collecting stats for PruningBreadthSolver
2006-06-14 Emanuele Aina Replaced SortedList with a naive implementation of a priority queue (PQueue)
2006-06-14 Emanuele Aina Fixed a typo due to a missing renaming of a variable
2006-06-14 Emanuele Aina Added the runner to collect the statistics for each algorithm
2006-06-13 Emanuele Aina Added the A* solver
2006-06-13 Emanuele Aina Improved the queens heuristic privileging states with more queens
2006-06-13 Emanuele Aina Added an hill-climbing depth solver
2006-06-13 Emanuele Aina Improved the slot heuristic privileging tiles in the board first positions
2006-06-11 Emanuele Aina Added tag sorting-simple-but-slow for changeset 9ed274ba96059987510fbb3f5c983868ec1f1b74
2006-06-11 Emanuele Aina Use __gt__ to make sorting by the heuristic simplersorting-simple-but-slow
2006-06-11 Emanuele Aina Make the Memoized metaclass use __hash__ instead of a homemade function
2006-06-11 Emanuele Aina Use sets to compare two unordered list, instead of relying on sorting
2006-06-08 Emanuele Aina Added some heuristics to the queens problem
2006-06-06 Emanuele Aina Made the solvers consistent with the structure introduced in 356fb2d85a32
2006-06-06 Emanuele Aina Changed how to get the class to be tested, so beta=3 has not to be hardcoded
2006-06-04 Emanuele Aina Check the solution length before checking the path itself
2006-06-04 Emanuele Aina Added a beta pruning breadth first solver using some heuristics
2006-06-04 Emanuele Aina Added a prototype of an UniformCostSolver, doing a min length search
2006-06-04 Emanuele Aina Renamed move_slot() to _move_slot() because it's private
2006-05-18 Emanuele Aina Use NetworkX as graph library instead of the homemade Graph
2006-05-18 Emanuele Aina Use Graph to keep track of the tree of moves
2006-05-17 Emanuele Aina Test the edge functionality of the Graph class
2006-05-17 Emanuele Aina Added a simple Graph implementation
2006-05-04 em Expand the varargs in keyfunc to simplify its implementation
2006-05-03 em Memoized is a metaclass factory with an optional keyfunc parameter
2006-05-03 em Factored out Memoized from slot.py to meke possible its reuse
2006-05-03 em Replaced the semi-singleton machinery with a Memoized metaclass
2006-04-29 em Added a nice string representation for both State objects
2006-04-29 em Added a test for the no solution case and enlarged the complex case
2006-04-29 em Added the tests for the queens problem
2006-04-29 em Fix the creation of a State without queens
2006-04-29 em Renamed test_solvers.py to make room for the queens problem solver
2006-04-29 em Reorganized to make possible to use the solvers to solve the queens problem
2006-04-29 em Renamed some functions and vars from empty to (empty_)slot
2006-04-29 em Added the state representation for the 4 queens problem
2006-04-28 em Added tag state-simple-but-very-slow for changeset 65f6e0c20cb22018ec9432102a2a99ca670c06ac
2006-04-28 em Use a simple but slow __eq__ instead of the complex semi-singletonstate-simple-but-very-slow
2006-04-28 em Renamed solve.py in test_solvers.py
2006-04-28 em Reorganized the solvers in a package
2006-04-28 em Test the start and the end of the states track and its lenght
2006-04-28 em Removed some unused spacing
2006-04-28 em The Solver returns the track of every traversed state instead of the goal
2006-04-28 em Fixed for the last time the BreadthSolver to be really breadth first
2006-04-26 em Use weak references to keep track of the already generated states
2006-04-26 em Use generate() to generate the successors
2006-04-26 em Reordered the directions list to make immediate the simple case

To download these repositories, get Mercurial and then type something like:

hg clone http://techn.ocracy.org/repository-name/

You can also click the "zip" or "gz" links to get an archive of the latest revision without installing anything.

The change logs of the repositories are aggregated at techn.ocracy.org/planet.

We have also some darcs repositories at techn.ocracy.org/darcs.