Very unlikely Accepted guess C tier for first-turn info

TRAYF

TRAYF is an accepted guess. Its modelled answer likelihood is very unlikely; no globally completed appearance is recorded here.

Meaning and pronunciation

Adjective

Alternative spelling of treyf.

Source: Wiktionary contributors · CC BY-SA 4.0. Corrections.

Use TRAYF in a puzzle

As an opener, it rules out about 93.4% of possible answers.

Wordle status

Answer chance: very unlikely. Roughly 0.05% within a year (about 1 in 2,113), under the model through 2026-11-05. This is an estimate, not a publisher forecast. How this is calculated.

Playable guess

Yes

Included in the Wordle guess list used by our tools.

Earlier benchmark pool

No

Membership in the preserved uniform benchmark; it is not a future eligibility rule.

Past Wordle answer

No completed appearance

No appearance in our globally completed history. A recent puzzle may still be live elsewhere.

The possible-answer list is the solver's current list and may change when Wordle adds new answers.

How TRAYF performs as a guess

Wordle accepts TRAYF as a guess. It is outside this preserved uniform benchmark’s answer pool; that is not a claim about future eligibility.

Played as an opener, it lands at least one colored tile in 82.4% of games, misses completely in 17.6%, and leaves about 157 possible answers on average.

In the previous complete opener benchmark, it ranks #4,274 of 14,855 openers, averaging 3.66 guesses in games solved within six turns.

Try your feedback pattern

Tap the tiles to match your feedback, then see the ranked follow-up guesses.

All gray? Tap a tile to cycle gray → yellow → green.

First-turn measures

All four describe TRAYF used as an opening guess. Entropy is the same idea as “avg ruled out” on a log scale: a higher number means the guess splits the possible answers into more, smaller groups.

4.75 Entropy (bits)
157 Avg remaining
0.0% Exact match
93.4% Avg ruled out

As an opening guess: previous benchmark

How TRAYF performed in the previous complete opener benchmark, against its captured answer snapshot. These research figures are separate from today's solver recommendations. See the data page for the method.

3.66 Avg guesses
99.96% Solved within six
0.67 Spread of game lengths
#4,274 Rank among openers
Opening with TRAYF left 1 of the snapshot's answers unsolved after six guesses. A spread of 0.67 means those games clustered within about 0.67 of a guess of the 3.66 average. It ranks #4,274 of 14,855 openers by average guesses in games solved within six.
1 guess
0
2 guesses
49
3 guesses
905
4 guesses
1,215
5 guesses
170
6 guesses
14

Composition

5/5 unique
1 vowels
Common:
ART

Feedback chances

Any hit (G/Y)
82%
Green tile
27%
All gray
18%

When TRAYF is useful later

TRAYF tied for the smallest expected survivor count in 1 of 55 sampled positions where it was legal. This designed sample is not a measure of how often real players should use it.

After ADIEU: 3 candidates, normal mode

ADIEU: 00000 (0 = grey, 1 = yellow, 2 = green).

SLOPS: 00202 (0 = grey, 1 = yellow, 2 = green).

NOOBS: 02202 (0 = grey, 1 = yellow, 2 = green).

COOMS: 02212 (0 = grey, 1 = yellow, 2 = green).

Remaining answers: MOOKS, MOORS, MOOTS.

With a budget of 2 more guesses, TRAYF is an information probe, outside this survivor list. It leaves 1.00 candidates on average under the model. Every feedback identifies a single candidate; another turn may be needed to submit it.

Try this position in the Solver
Sample and method

Every saved board is reachable within a six-turn game. Remaining turns equal six minus the saved history length. The sampling policy is independent of the expected-survivor metric. Two states at each of three depths per opener were selected by a fixed hash from an independent candidate-only sampling policy. Every accepted guess was evaluated. Model answer-model-2026-11-05-9183a914c959, data through 2026-11-05. The score measures expected survivors, not proved solve length or human difficulty.

How this is calculated.

How the solver finds TRAYF

The strategy receives only earlier guesses and their feedback. It does not know the answer before choosing a move. Guessing the answer itself on turn one is a lucky one-turn result, not a recommended general strategy.

Normal mode

Our solver: bounded weighted policy. Current-pool replay over 14,855 accepted words. Model through 2026-11-05.

  1. The fixed opener tests its five letters.

    14,855 before → 35 after. This feedback leaves 35 candidates.

    All 35 surviving candidates

    THARM, TIARA, TITAR, TOLAR, TRACK, TRACT, TRADY, TRAGA, TRAGI, TRAGU, TRAIK, TRAIL, TRAIN, TRAIT, TRAMP, TRANK, TRANQ, TRANT, TRAPO, TRAPT, TRATT, TRAWL, TRAYF, TRIAC, TRIAD, TRIAL, TRIFA, TROAD, TROAK, TROAT, TRONA, TRYMA, TUART, TUBAR, TUGRA

    Decision measures before feedback

    Expected remaining candidates: 414.45. Information: 5.74 bits. These measures describe the decision before its realised feedback.

  2. Test TRAPT against the 35 candidates consistent with the earlier rows.

    35 before → 12 after. This feedback leaves 12 candidates.

    All 12 surviving candidates

    TRACK, TRADY, TRAGA, TRAGI, TRAGU, TRAIK, TRAIL, TRAIN, TRANK, TRANQ, TRAWL, TRAYF

    Decision measures before feedback

    Expected remaining candidates: 4.7. Information: 1.508 bits. These measures describe the decision before its realised feedback.

  3. Test TRAIL against the 12 candidates consistent with the earlier rows.

    12 before → 7 after. This feedback leaves 7 candidates.

    All 7 surviving candidates

    TRACK, TRADY, TRAGA, TRAGU, TRANK, TRANQ, TRAYF

    Decision measures before feedback

    Expected remaining candidates: 1.187. Information: 0.421 bits. These measures describe the decision before its realised feedback.

  4. Test TRANK against the 7 candidates consistent with the earlier rows.

    7 before → 4 after. This feedback leaves 4 candidates.

    All 4 surviving candidates

    TRADY, TRAGA, TRAGU, TRAYF

    Decision measures before feedback

    Expected remaining candidates: 2.149. Information: 1.703 bits. These measures describe the decision before its realised feedback.

  5. Test TRADY against the 4 candidates consistent with the earlier rows.

    4 before → 1 after. This feedback leaves 1 candidate.

    All 1 surviving candidates

    TRAYF

    Decision measures before feedback

    Expected remaining candidates: 1.5. Information: 1.5 bits. These measures describe the decision before its realised feedback.

  6. Submit the only remaining candidate.

    1 before → 1 after. The answer is submitted and solved.

    All 1 surviving candidates

    TRAYF

    Decision measures before feedback

    Expected remaining candidates: 1.0. Information: 0.0 bits. These measures describe the decision before its realised feedback.

Solved in 6 guesses. Uniquely identified on turn 5.

Continue this board in the Solver

Hard Mode

Our solver: bounded weighted policy. Current-pool replay over 14,855 accepted words. Model through 2026-11-05.

  1. The fixed opener tests its five letters.

    14,855 before → 35 after. This feedback leaves 35 candidates.

    All 35 surviving candidates

    THARM, TIARA, TITAR, TOLAR, TRACK, TRACT, TRADY, TRAGA, TRAGI, TRAGU, TRAIK, TRAIL, TRAIN, TRAIT, TRAMP, TRANK, TRANQ, TRANT, TRAPO, TRAPT, TRATT, TRAWL, TRAYF, TRIAC, TRIAD, TRIAL, TRIFA, TROAD, TROAK, TROAT, TRONA, TRYMA, TUART, TUBAR, TUGRA

    Decision measures before feedback

    Expected remaining candidates: 414.45. Information: 5.74 bits. These measures describe the decision before its realised feedback.

  2. Test TRAPT against the 35 candidates consistent with the earlier rows.

    35 before → 12 after. This feedback leaves 12 candidates.

    All 12 surviving candidates

    TRACK, TRADY, TRAGA, TRAGI, TRAGU, TRAIK, TRAIL, TRAIN, TRANK, TRANQ, TRAWL, TRAYF

    Decision measures before feedback

    Expected remaining candidates: 4.7. Information: 1.508 bits. These measures describe the decision before its realised feedback.

  3. Test TRAIL against the 12 candidates consistent with the earlier rows.

    12 before → 7 after. This feedback leaves 7 candidates.

    All 7 surviving candidates

    TRACK, TRADY, TRAGA, TRAGU, TRANK, TRANQ, TRAYF

    Decision measures before feedback

    Expected remaining candidates: 1.187. Information: 0.421 bits. These measures describe the decision before its realised feedback.

  4. Test TRANK against the 7 candidates consistent with the earlier rows.

    7 before → 4 after. This feedback leaves 4 candidates.

    All 4 surviving candidates

    TRADY, TRAGA, TRAGU, TRAYF

    Decision measures before feedback

    Expected remaining candidates: 2.149. Information: 1.703 bits. These measures describe the decision before its realised feedback.

  5. Test TRADY against the 4 candidates consistent with the earlier rows.

    4 before → 1 after. This feedback leaves 1 candidate.

    All 1 surviving candidates

    TRAYF

    Decision measures before feedback

    Expected remaining candidates: 1.5. Information: 1.5 bits. These measures describe the decision before its realised feedback.

  6. Submit the only remaining candidate.

    1 before → 1 after. The answer is submitted and solved.

    All 1 surviving candidates

    TRAYF

    Decision measures before feedback

    Expected remaining candidates: 1.0. Information: 0.0 bits. These measures describe the decision before its realised feedback.

Solved in 6 guesses. Uniquely identified on turn 5.

Continue this board in the Solver

How the fixed opener panel performs on this answer

OpenerFirst feedbackSurvivorsNormalHard Mode
TARSE21100 (0 grey, 1 yellow, 2 green)3566
CRANE02200 (0 grey, 1 yellow, 2 green)12066
SLATE00210 (0 grey, 1 yellow, 2 green)7644
ADIEU10000 (0 grey, 1 yellow, 2 green)201966
STARE01210 (0 grey, 1 yellow, 2 green)4155
AUDIO10000 (0 grey, 1 yellow, 2 green)251366
RAISE11000 (0 grey, 1 yellow, 2 green)350Not solved in sixNot solved in six
ROATE10210 (0 grey, 1 yellow, 2 green)6966
SALET01001 (0 grey, 1 yellow, 2 green)15466
Normal mode
1 guess: 0 · 2 guesses: 0 · 3 guesses: 0 · 4 guesses: 1 · 5 guesses: 1 · 6 guesses: 6 · Failed in six: 1
Hard Mode
1 guess: 0 · 2 guesses: 0 · 3 guesses: 0 · 4 guesses: 1 · 5 guesses: 1 · 6 guesses: 6 · Failed in six: 1

The nine openers use the same pool and continuation policy. Across both modes: 4–6 guesses among successes; 2 of 18 configurations failed. This is performance on this answer, not an overall opener ranking.

102 openers set up a two-turn opportunity; examples include STAFF, SCARY, FANCY, FIFTY, STAYS, FORTY, FAIRY, FERRY, FEAST, THIEF. After their feedback, this answer is among the most likely survivors with at least half the model probability. This is an opportunity, not a guarantee. An opener that immediately solves is excluded.

Why this answer can be difficult

The worked board still allows 12 different answers at one later decision: TRACK, TRADY, TRAGA, TRAGI, TRAGU, TRAIK, TRAIL, TRAIN, TRANK, TRANQ, TRAWL, TRAYF. These are mechanical alternatives, not a judgement of vocabulary difficulty.

Vocabulary evidence and voluntary player results are reported separately from these solver observations.

Closest competing answers in this board

These words all fit the earlier feedback, rather than merely sharing similar spelling: TRACK, TRADY, TRAGA, TRAGI, TRAGU, TRAIK, TRAIL, TRAIN, TRANK, TRANQ, TRAWL, TRAYF.

A lesson from this route

Before TRAIL, 12 words still fit. Its feedback left 7; check the full survivor list before choosing the next answer.

Try another opener or a different move

How this is calculated

The current policy checks all remaining candidates and up to 128 fixed probes. At six or fewer candidates it uses bounded lookahead, preferring modelled six-turn success, then speed among successes. Larger states use expected survivors as a heuristic. These are recommendations, not proofs of optimal play. Hard Mode retains green positions and revealed letter counts; it allows grey letters and a yellow in the same position. Candidate-only play is stricter.

Methods and limitations

Feedback distribution

TRAYF can come back 86 different ways. These are the most likely, and how many of the possible answers give each one:

420 answers
206 answers
192 answers
175 answers
156 answers
109 answers
106 answers
101 answers
83 answers
62 answers
57 answers
48 answers
47 answers
43 answers
42 answers
31 answers
30 answers
29 answers
24 answers
24 answers
23 answers
22 answers
22 answers
21 answers
20 answers
19 answers
18 answers
18 answers
13 answers
13 answers

Letter-value totals

Base letter-value totals for TRAYF; these do not show whether either game accepts the word.

Scrabble

T1R1A1Y4F4
Total: 11 points

Words With Friends

Total: 10 points

Scores shown are base values without double/triple letter or word bonuses.

Strategy after playing TRAYF

What the solver recommends next for each way the board can respond to TRAYF.

Quick reference

Largest feedback groups after playing TRAYF:

18% chance
Suggested:
NOISE
9% chance
Suggested:
LANCE
8% chance
Suggested:
NOISE

Follow-ups for common patterns

Ranked follow-up guesses for the 10 most common feedback patterns.

17.6% →
NOISE 6.03 bits
8.6% →
LANCE 5.32 bits
8.0% →
NOISE 5.12 bits
7.3% →
SIENT 5.36 bits
6.5% →
SOLDE 4.83 bits
4.6% →
SLICE 5.16 bits
4.4% →
CARER 4.60 bits
4.2% →
SPICE 4.71 bits
3.5% →
SALUE 4.64 bits
2.6% →
SADLY 4.19 bits

Research on TRAYF

Game-tree analysis and word research for TRAYF, with an explanation for each figure.

Optimal play

Opening with TRAYF, a proven-optimal strategy averages 3.71 guesses and ranks #5,650 of 14,855 legal openers. The best proven opener, TARSE, averages 3.55.

In hard mode it averages 3.84 guesses at best and is rank #2,566 of the 7,453 openers that can still guarantee a solve within six guesses.

Our six-turn simulation says 3.66, at or below the proven-optimal 3.71, because the two figures score different answer lists.

These figures come from exhaustive game-tree search and are exact for the NYT lists of July 2023 (3,158 answers). They do not use the site's working answer pool.

Sources: Optimal-play values: Alex Selby's exhaustive Wordle analysis (MIT).