Crossword puzzle solving is a classic constraint satisfaction problem, but, when solving a real puzzle, the mapping from clues to variable domains is not perfectly crisp. At best, clues induce a probability distribution over viable targets, which must somehow be respected along with the constraints of the puzzle. Motivated by this type of problem, we provide a formal model of constraint satisfa...

Sudoku is a notorious logic-based puzzle that is popular with puzzle enthusiasts the world over. From a computational perspective, Sudoku is also a problem that belongs to the set of NP-complete problems, implying that we cannot hope to find a polynomially bounded algorithm for solving the problem in general. Considering this feature, in this paper we demonstrate how a metaheuristic-based metho...

We introduce a new solving method for SameGame puzzles based on Monte-Carlo simulation, that improves the previous best known method. We also cover the chessboard variant, a subclass of the SameGame puzzle for which we can exactly define which puzzles are solvable and which ones are not. Next to this we present a quantitative approach to classify the difficulty of a given puzzle, as well as an ...

The business coaching process is centered on the task of identifying, analyzing and solving problems—not unidimensional puzzles or profound, life-altering mysteries. As a business coach, I make extensive use of a threedimensional model of problem analysis. It can be of great value in addressing the complexities of a client’s problem. This essay concerns the nature of this three-dimensional mode...