A basic rummikub solver that uses linear programming to find the best move (and ideally place all tiles in our hand)
b = black
l = blue
r = red
y = yellow
j = joker
blyr1 r9-11 y4-12 yrj13 # tiles on board
b1 r2 y2 y3 l9 l9 j # tiles in our hand
j # joker
y1 # yellow one
bry2 # black two, red two, yellow two
ryj6 # red 6, yellow 6, joker
r1-5 # red 1, 2, 3, 4, 5
ry1-3 # red 1, 2, 3 and yellow 1, 2, 3
- Learn Rust
- Compute optimal solution in < 1s
- Parallelise what I can
- Easy to use
- Ideas drawn from Solving Rummikub Problems by Integer Linear Programming by D. Hertog and P. Hulshof.
- Some inspiration from gregorias/rummikubsolver for generating tile combinations.