Added SIW algorithm, General Serialized Search, Reachability reasoning with h_1 h_2: 0 or inf fixpoint, extra ordering among goals in landmark graph
Merge branch 'master' of https://github.com/miquelramirez/lwaptk
Serialized_Search uses Reachability class instead of h1
SIW: novelty datastructure does not fit in memory, return Unsolved
Merge pull request #3 from gfrances/master

Fixed some problems with the compilation of some examples, added a boost...
SIW: added goal ordering: if all actions adding p edel q, then p must precede q
Added the ability to hash bit arrays
Progress Through has been fixed, the other methods generating successors should be revised accordingly
State hashing is now done from the bit array
Fixed problem with duplicate fluents in state progression
Added a profile script for the ipc-2006 domains.
Extended Landmark Graph Implementation
BFS_f Algorithm: Novelty Partitioned in terms of subspaces, and integration within a gbfs h_lmcount and h_add
Work in progress: GN landmark computation
Merge pull request #1 from haz/profile

Added a profile script for the ipc-2006 domains.
Updated the gitignore.
Put profiling info into the successor generator example.
Merge branch 'master' into match-tree
Set up the skeleton for testing the new match tree implementation.
Adding the actual match tree files (to be filled in later.
Started porting the PRP match tree to the planner. It is still very incomplete / broken.
Added vim temporary files