
Queens Solver is a desktop application built for the IF2211 Algorithm Strategy course at STEI ITB, aimed at observing the behavior and performance of pure brute force algorithms. The program solves LinkedIn's Queens puzzle, a logic game where each row, column, and color region must contain exactly one queen with no two queens adjacent, by generating all possible placements via Cartesian Product across color regions, then validating each combination exhaustively without any optimization such as backtracking or constraint propagation.
Exhaustive Cartesian Product search with no backtracking, pruning, or heuristics
Live GUI updates every 50 iterations showing the solver's current state on the board
Tracks iteration count and execution time across board sizes from 4×4 up to 12x12
Frontend: Fyne GUI framework
Backend: Go
Deployment: Local desktop application