rummibot is a rummikub solver

The 13 tiles in 4 colors are represented as integers from 1 to 52 in this implementation. Jokers are represented by 0. There are two of each tile. Runs can be constructed by comparing size, just one comparison, as opposed to both size and color.

Groups will all have the same modulo 13 as the other members of the group. Note that care must be taken to not confuse 0, Jokers, with 13 % 13, the black 13 tiles, mainly in the context of printing to the stdout.

Current goal is to use a greedy algorithm to create as many valid runs/groups per turn. Future revision may include withholding tiles for strategic purposes.

The initial meld and each subsequent turn are functionally identical problems, so they can be solved with the same algorithm. However, they have different constraints: the initial meld must sum to over 30, while subsequent turns must use all the tiles on the table and at least one from the player's hand.

• set - a run or group
• run - 3 or 4 tiles of the same number, all diffrent colors
• group - 3 or more tiles in ascending order, all same color
• initial meld - first turn, sum of points must be at least 30
• hand - also called rack, tiles
• table - sets placed on by players on their turn

No arguments or options currently.

python rummibot.py

• Colored tiles
• Game setup
• Select initial valid meld from hand

• Backtracking
• Count cards (tiles?)
• Count each players remaining tiles
• Solve user inputed games
• Plot and scheme

• Tile shuffling animation
• Easy to use GUI/TUI
• Rewrite in hylang

rummibot is a work in progress

• The Complexity of Rummikub Problems
• slides for the above paper