5
votes
Accepted
Winnability of an urn-ball game with restricted two-urn moves
The conjecture is indeed true.
Build a graph $G$, where vertices are urns, and urns are connected if there was a move that uses both of them. This graph is acyclic: if there is cycle $U_1, \ldots, U_t$...
- 18k
2
votes
Accepted
How many big and small marbles are not used?
The name of these questions is integer programming (IP), and from what I was able to infer, it is infeasible to design a general algorithm, mainly because of the integer constraint is hard to handle ...
- 413
Only top scored, non community-wiki answers of a minimum length are eligible