Cheating Hangman in Java that keeps every possible word alive and always picks the largest surviving set to stall the player
-
Updated
Jul 22, 2026 - Java
Cheating Hangman in Java that keeps every possible word alive and always picks the largest surviving set to stall the player
Set Partitioning Problem solver using Tabu Search with experimental benchmarking and heuristic optimization analysis.
Metaheuristic optimisation for airline crew scheduling (set partitioning problem) — Simulated Annealing, Binary GA, and Improved Binary GA with stochastic ranking and heuristic repair
QUBO-to-neutral-atom register design with AMPL models, Pulser visualization, and fixed-layout heuristics.
To associate your repository with the set-partitioning topic, visit your repo's landing page and select "manage topics."