ai

log

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