Skip to content

Different approach -> Tree #5

@visch

Description

@visch

Ok first definition of each bin (vertex/node) is:

Wordle responds to whatever guess you submit with 5 letters in 1 of 3 states (Gray, Yellow, Green), that gives you 3^5 potential answers Wordle can give you. 3^5 = 243 which is hard to illustrate so let's make 2-letter wordle, so we are down to 9 states.

Let's say the answer for this game of 2 letter wordle is "AS"

Our first guess is "MF"

All of the potential bins of answers are as follows.

GRAY GRAY
GRAY YELLOW
GRAY GREEN
YELLOW GRAY
YELLOW YELLOW
YELLOW GREEN
GREEN GRAY
GREEN YELLOW
GREEN GREEN

In this case our answer is in the GRAY GRAY "bin". Each potential answer has to exist in one of the 9 bins. Let's say for the first guess of MF the distribution is something like this

Bins - Num of answers in Bin
GRAY GRAY - 100
GRAY YELLOW - 0
GRAY GREEN - 0
YELLOW GRAY - 7
YELLOW YELLOW - 0
YELLOW GREEN - 0
GREEN GRAY - 3
GREEN YELLOW - 0
GREEN GREEN - 0

And let's compare MF to a guess like "AR"

GRAY GRAY - 20
GRAY YELLOW - 0
GRAY GREEN - 0
YELLOW GRAY - 50
YELLOW YELLOW - 50
YELLOW GREEN - 1
GREEN GRAY - 50
GREEN YELLOW - 50
GREEN GREEN - 0

In this case AR would be a better answer because the maximum "bin" (vertex if we are talking about this as a Tree) is 50, while the maximum bin for "AR" is 100, sending your down a path with less options.

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions