Hacker News new | ask | show | jobs
by Vetch 1626 days ago
My simple 12 line solver maintains a list of rejected letters, letters that must be contained and constraints on form (where letter must be and where letters cannot be). There was an additional step where words are weighted by spelling distance before sampling but this usually results in minute and more often no adjustments. This was meant for regular worldle. Works in 5 - 8 (often 6) guesses for adversarial wordle. Example runs:

    F I L L S (0 green, 0 yellow)
    W H E R E (0 green, 0 yellow)
    D O U B T (0 green, 0 yellow)
    M A N N A (3 green, 0 yellow)
    C A N N Y (4 green, 0 yellow)
    N A N N Y (5 green, 0 yellow)

    A L L O Y (0 green, 0 yellow)
    F E T C H (0 green, 1 yellow)
    I N D E X (0 green, 2 yellow)
    P R I Z E (3 green, 0 yellow)
    B R I B E (3 green, 0 yellow)
    G R I M E (5 green, 0 yellow)