Redesigned the solver algorithm

The new solver algorithm decreases the size of the search space by combining states. A flood fill is used to find all of the positions accessible by the player without changing the board state, and that flood is considered a node in the search graph, rather than there being a node for every position on every board state. Other optimizations are implemented too, like checking for changes locally instead of using tick, and using unordered_map/unordered_set because bitsets are hashable.

Also changed wrap to use references, finally.

refs #1

1 files changed, 1 insertions, 1 deletions

@@ -5,7 +5,7 @@
 #ifndef UTIL_H
 #define UTIL_H
 
-void wrap(int* x, int* y);
+void wrap(int& x, int& y);
 TTF_Font* loadFont(int size);
 const char* getDataFile();
 SDL_Texture* loadImage(SDL_Renderer* renderer, std::string file);