nyt-digits-solver 0.2.0

Riddle solver algorithms for the NYT Digits game

nyt-digits-solver

Puzzle solver for the NYT Digits game (no longer active).

Given a set of numbers and a target, finds the sequence of arithmetic operations (+, -, *, /) that produces the target. Also lets you explore all values reachable from a given input, with the steps to get there.

Installation

pip install nyt-digits-solver

Usage

solve

Returns a list of solutions. Each solution is a list of Step(numbers, operation) where operation is the step that produced that state (None for the initial state).

import nyt_digits_solver as ds

solutions = ds.solve([1, 2, 3], target=6)
# [
#   [
#     Step(numbers=[1, 2, 3], operation=None),
#     Step(numbers=[3, 3],    operation='2+1'),
#     Step(numbers=[6],       operation='3+3'),
#   ]
# ]

for step in solutions[0]:
    if step.operation:
        print(f"{step.operation} → {step.numbers}")
# 2+1 → [3, 3]
# 3+3 → [6]

Find all solutions instead of just the first:

all_solutions = ds.solve([1, 2, 3, 4, 5, 25], target=452, how_many_sols=None)

explore

Returns a dict mapping every reachable value to the shortest list of Steps that produces it.

result = ds.explore([2, 3])
# {
#   5: [Step(numbers=[2, 3], operation=None), Step(numbers=[5], operation='3+2')],
#   1: [Step(numbers=[2, 3], operation=None), Step(numbers=[1], operation='3-2')],
#   6: [Step(numbers=[2, 3], operation=None), Step(numbers=[6], operation='3*2')],
# }

# Check if a target is reachable
if 452 in ds.explore([1, 2, 3, 4, 5, 25]):
    print("reachable!")

# Get the steps to a specific value
steps = ds.explore([1, 2, 3, 4, 5, 25])[452]
for step in steps:
    if step.operation:
        print(f"{step.operation} → {step.numbers}")

CLI

python -m nyt_digits_solver.main -n 1,2,3 -t 6
# Found 1 solution. Took 0.0 seconds.
# Start: [1, 2, 3]
# 2+1 → [3, 3]
# 3+3 → [6]