Domains

Topics
	astar/Domain.h
	Concepts a search problem has to satisfy in order to be searched by the algorithms of the library, and for the few type helpers built upon them.
	astar/SlidingTile.h
	The sliding-tile puzzle on a board of at most 25 cells.
	astar/PatternDatabase.h
	Pattern databases of the sliding-tile puzzles, i.e., the heuristics that store the exact distances of an abstraction of the puzzle.
	astar/Grid.h
	Pathfinding on a GridMap with 4 (Moves == 4) or 8 (Moves == 8) moves.
	astar/ExplicitGraph.h
	A weighted graph given explicitly, searched from a source to a target.
	astar/SlowDomain.h
	A Domain whose expansions cost a given amount of extra work.
	astar/SequenceScore.h
	The sliding-tile puzzle with the sequence score heuristic of Nilsson.
	astar/Romania.h
	A trip on the road map of Romania.
	astar/NQueens.h
	The n-queens problem, with at most 32 queens.
	astar/VacuumWorld.h
	The vacuum world on a row of at most 32 cells.
	astar/MissionariesCannibals.h
	The missionaries and cannibals problem.
	astar/WaterJugs.h
	The water jugs problem, with up to 4 jugs of at most 65535 units.
	astar/TravelingSalesman.h
	The traveling salesperson problem on at most 32 cities.

Detailed Description