How loganoberk/8tilesolver works
This is a console 8-tile puzzle solver: a user enters initial and goal boards, an A* agent searches for a least-cost path using wind-weighted moves, and the solution is printed. The code separates input/output, search management, and board-state representation. Main.cpp is present in the tree but was not sampled, so its orchestration links are omitted; the README provides no additional capability details.
Main entry points: UI.cpp Input and output · AStarAgent.cpp A* search · Agent.cpp Search management · State.cpp Puzzle state
Components 6
Console interface
- Input and output
8tilesolver/ui/UI.cpp
Search
- A* search
8tilesolver/model/AStarAgent.cpp - Search management
8tilesolver/model/Agent.cpp
Board state
- Puzzle state
8tilesolver/model/State.cpp
Other components
- User
- Application entry
8tilesolver/main/Main.cpp
Connections 4
- Input and output → User: prompts and prints
- A* search → Puzzle state: moves and updates
- A* search → Search management: populates solution
- Input and output → Search management: prints solution