Brute force
planned
An exhaustive search over bridge assignments between islands, used as a correctness baseline. It will confirm solvability and report how many states it explored. It will be far too slow for large boards, which is exactly its job: a reference to measure the other two against.
State of the art
planned
The published constraint-programming / branch-and-cut approach used for benchmark Hashiwokakero instances. It will encode the degree, non-crossing and connectivity rules as constraints and solve them with a modern combinatorial solver. This is the target for both correctness and speed.
AI / ML
planned
A learned model trained on many generated puzzles — the project's namesake idea. It will learn to propose bridges (or prune the search) from patterns in solved boards and be compared against the exact solvers. Not implemented yet; no model has been trained.