Class BestFirstSearch< state_t, action_t >

Add branch and bound option

Add pathmax

Make it a bit more general

Are these the return types that we want for BfsExpansionResult

Member BFSNode< state_t, action_t >::BFSNode (const state_t &node_state, NodeID parent, const action_t &action, double g, double h, double node_eval, BFSOpenLocation loc)

Make this more generic.

File combinatorics.h

Figure out proper way to get random numbers.

Add something that checks to make sure read permutations are proper permutations.

Member get64BitnUpperk (unsigned n, unsigned k)

Figure out what should happen when an overflow happens.

Class MapPathfindingTransitions

Set the bottom left corner to be (0, 0)?

Allow for different terrain types.

Allow for different terrain heights.

Class NodeKeyHash

Why does this only compile if I define the function here? Inconsistent with everything else.

Class NodeTable< node_t >

Change the NodeKeyHash so that we can check the state if the hash function isn't injective.

Class OpenClosedList< state_t, action_t >

Make the NodeTable store pointers to BFSNode, so that it can creat things that inherit from them.

Make more generic for OCL algorithm.

Member read_in_pathfinding_probs (std::string file_name, std::vector< MapLocation > &starts, std::vector< MapLocation > &goals)

Add more extensive error checking.

Class SearchStatus

Is this enum really the best way to do this?

Class TilePuzzleState

Is both equality and inequality actually needed?

Class TilePuzzleTransitions

Add operator ordering options.

Check what the default operator ordering should be.

Class TransitionSystem< state_t, action_t >

Add debug mode?