# Questions tagged [puzzles-games]

For questions about OR as it is used to solve puzzles and games.

9 questions
Filter by
Sorted by
Tagged with
172 views

### Bounding function for branch-and-bound in game tree search

The scenario is a game where each round you can buy or sell farms that make a set profit each round. I thought about applying branch-and-bound to a game tree, where each node represents the game state ...
552 views

### How to solve Rogo Puzzle with an extra constraint?

Given a n×m grid with numbered cells and forbidden cells, the objective of the Rogo puzzle is to find a loop of fixed length through the grid such that the sum of the numbers in the cells on the loop ...
641 views

### Common problems/puzzles that can creatively be solved with linear programming?

I am interested in common problems/puzzles that have a clear set of rules/constraints and objective that lends itself to modeled and solved with a linear program. Especially for people new to LPs, I ...
2k views

### Does this game that I invented correspond to a valid optimization problem?

Recently, I thought of the following "game" that I would like to frame as an optimization problem: Assume there are five baskets. The first basket has five discrete objects (e.g., apples), ...
2k views

### Solving Logic puzzles through optimization

I have the following "logic puzzle" (I think this is considered as a "scheduling problem"): In this problem, there are 5 basketball players - provided some clues about their ...
221 views

### Circular reference in states of the Bellman equation

I want to formulate a game of darts as a dynamic program. The goal is to minimize the number of darts thrown while reaching checkout. A dart player has a score s. If his score is s = ...
409 views

### Do you know of any formula to calculate the difficulty score of Sudoku?

I am looking for a formula to measure the difficulty level of a Sudoku solution.
### Might you know any simple puzzles similar to $n$ queens? Anything parametrized worth running to a constraint solver?
In the $n$ queens puzzle, we have to put $n$ queens on an $n \times n$ chessboard, without any $2$ queens being able to attack each other. Finding a single feasible solution is not NP-complete. It's ...