\(\)
This research introduces the Stochastic Sequential Queens Elimination Problem, where on the \(n\)-queens board, each activated queen simultaneously attempts to eliminate all queens in her unblocked neighborhood, each independently succeeding with probability \(p\). The objective is to minimize the expected cumulative conflict count over the trajectory. This research proposes a Markov decision process for this problem, as well as a heuristic method for \(p<1\) and a mixed-integer programming model when \(p=1\).
Article
Download
View PDF