STRAK
STRAK is an accepted guess. Its modelled answer likelihood is very unlikely; no globally completed appearance is recorded here.
No dictionary definition for STRAK is recorded in our sourced data.
Meaning and pronunciation
We do not have a sourced definition for this word yet.
Use STRAK in a puzzle
As an opener, it rules out about 93.7% 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
YesIncluded in the Wordle guess list used by our tools.
Earlier benchmark pool
NoMembership in the preserved uniform benchmark; it is not a future eligibility rule.
Past Wordle answer
No completed appearanceNo 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.
Wordle Observatory · optional
Played this Wordle?
Add your result to the public totals · about 20 seconds
Wordle Observatory · optional
Played this Wordle?
Add your result to the public totals · about 20 seconds
Add your result and a quick difficulty rating to help explain how this puzzle played.
See the public dataThank you. Your result now helps describe this puzzle.
See what the public sample says →How STRAK performs as a guess
Wordle accepts STRAK 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 83.2% of games, misses completely in 16.8%, and leaves about 150 possible answers on average.
In the previous complete opener benchmark, it ranks #3,378 of 14,855 openers, averaging 3.64 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.
Useful pattern pages
If you only know part of the word, start with one of these matching patterns.
First-turn measures
All four describe STRAK 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.
As an opening guess: previous benchmark
How STRAK 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.
Composition
Feedback chances
When STRAK is useful later
STRAK tied for the smallest expected survivor count in 3 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, STRAK 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 SolverAfter AUDIO: 3 candidates, normal mode
AUDIO: 11200 (0 = grey, 1 = yellow, 2 = green).
Remaining answers: LADDU, SADHU, UNDAM.
With a budget of 5 more guesses, STRAK 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 SolverAfter RAISE: 5 candidates, normal mode
RAISE: 00011 (0 = grey, 1 = yellow, 2 = green).
OUEDS: 00202 (0 = grey, 1 = yellow, 2 = green).
ENEWS: 01202 (0 = grey, 1 = yellow, 2 = green).
GLENS: 00222 (0 = grey, 1 = yellow, 2 = green).
Remaining answers: HYENS, SKENS, STENS, SYENS, THENS.
With a budget of 2 more guesses, STRAK 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 SolverSample 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 the solver finds STRAK
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.
-
The fixed opener tests its five letters.
14,855 before → 12 after. This feedback leaves 12 candidates.
All 12 surviving candidates
AIRTS, SCRAT, SORTA, SPRAT, STRAD, STRAG, STRAK, STRAP, STRAW, STRAY, STRIA, SURAT
Decision measures before feedback
Expected remaining candidates: 414.45. Information: 5.74 bits. These measures describe the decision before its realised feedback.
-
Test STRAP against the 12 candidates consistent with the earlier rows.
12 before → 5 after. This feedback leaves 5 candidates.
All 5 surviving candidates
STRAD, STRAG, STRAK, STRAW, STRAY
Decision measures before feedback
Expected remaining candidates: 3.219. Information: 2.062 bits. These measures describe the decision before its realised feedback.
-
Test STRAW against the 5 candidates consistent with the earlier rows.
5 before → 4 after. This feedback leaves 4 candidates.
All 4 surviving candidates
STRAD, STRAG, STRAK, STRAY
Decision measures before feedback
Expected remaining candidates: 2.879. Information: 0.954 bits. These measures describe the decision before its realised feedback.
-
Test STRAY against the 4 candidates consistent with the earlier rows.
4 before → 3 after. This feedback leaves 3 candidates.
All 3 surviving candidates
STRAD, STRAG, STRAK
Decision measures before feedback
Expected remaining candidates: 1.806. Information: 0.973 bits. These measures describe the decision before its realised feedback.
-
Test STRAD against the 3 candidates consistent with the earlier rows.
3 before → 2 after. This feedback leaves 2 candidates.
All 2 surviving candidates
STRAG, STRAK
Decision measures before feedback
Expected remaining candidates: 1.667. Information: 0.918 bits. These measures describe the decision before its realised feedback.
-
Test STRAG against the 2 candidates consistent with the earlier rows.
2 before → 1 after. This feedback leaves 1 candidate.
All 1 surviving candidates
STRAK
Decision measures before feedback
Expected remaining candidates: 1.0. Information: 1.0 bits. These measures describe the decision before its realised feedback.
This policy did not solve within six guesses. Uniquely identified on turn 6.
Continue this board in the SolverHard Mode
Our solver: bounded weighted policy. Current-pool replay over 14,855 accepted words. Model through 2026-11-05.
-
The fixed opener tests its five letters.
14,855 before → 12 after. This feedback leaves 12 candidates.
All 12 surviving candidates
AIRTS, SCRAT, SORTA, SPRAT, STRAD, STRAG, STRAK, STRAP, STRAW, STRAY, STRIA, SURAT
Decision measures before feedback
Expected remaining candidates: 414.45. Information: 5.74 bits. These measures describe the decision before its realised feedback.
-
Test STRAP against the 12 candidates consistent with the earlier rows.
12 before → 5 after. This feedback leaves 5 candidates.
All 5 surviving candidates
STRAD, STRAG, STRAK, STRAW, STRAY
Decision measures before feedback
Expected remaining candidates: 3.219. Information: 2.062 bits. These measures describe the decision before its realised feedback.
-
Test STRAW against the 5 candidates consistent with the earlier rows.
5 before → 4 after. This feedback leaves 4 candidates.
All 4 surviving candidates
STRAD, STRAG, STRAK, STRAY
Decision measures before feedback
Expected remaining candidates: 2.879. Information: 0.954 bits. These measures describe the decision before its realised feedback.
-
Test STRAY against the 4 candidates consistent with the earlier rows.
4 before → 3 after. This feedback leaves 3 candidates.
All 3 surviving candidates
STRAD, STRAG, STRAK
Decision measures before feedback
Expected remaining candidates: 1.806. Information: 0.973 bits. These measures describe the decision before its realised feedback.
-
Test STRAD against the 3 candidates consistent with the earlier rows.
3 before → 2 after. This feedback leaves 2 candidates.
All 2 surviving candidates
STRAG, STRAK
Decision measures before feedback
Expected remaining candidates: 1.667. Information: 0.918 bits. These measures describe the decision before its realised feedback.
-
Test STRAG against the 2 candidates consistent with the earlier rows.
2 before → 1 after. This feedback leaves 1 candidate.
All 1 surviving candidates
STRAK
Decision measures before feedback
Expected remaining candidates: 1.0. Information: 1.0 bits. These measures describe the decision before its realised feedback.
This policy did not solve within six guesses. Uniquely identified on turn 6.
Continue this board in the SolverHow the fixed opener panel performs on this answer
| Opener | First feedback | Survivors | Normal | Hard Mode |
|---|---|---|---|---|
| TARSE | 11210 (0 grey, 1 yellow, 2 green) | 12 | Not solved in six | Not solved in six |
| CRANE | 01100 (0 grey, 1 yellow, 2 green) | 606 | Not solved in six | Not solved in six |
| SLATE | 20110 (0 grey, 1 yellow, 2 green) | 32 | Not solved in six | Not solved in six |
| ADIEU | 10000 (0 grey, 1 yellow, 2 green) | 2019 | Not solved in six | Not solved in six |
| STARE | 22110 (0 grey, 1 yellow, 2 green) | 7 | Not solved in six | Not solved in six |
| AUDIO | 10000 (0 grey, 1 yellow, 2 green) | 2513 | Not solved in six | Not solved in six |
| RAISE | 11010 (0 grey, 1 yellow, 2 green) | 195 | Not solved in six | Not solved in six |
| ROATE | 10110 (0 grey, 1 yellow, 2 green) | 70 | Not solved in six | Not solved in six |
| SALET | 21001 (0 grey, 1 yellow, 2 green) | 56 | Not solved in six | Not solved in six |
- Normal mode
- 1 guess: 0 · 2 guesses: 0 · 3 guesses: 0 · 4 guesses: 0 · 5 guesses: 0 · 6 guesses: 0 · Failed in six: 9
- Hard Mode
- 1 guess: 0 · 2 guesses: 0 · 3 guesses: 0 · 4 guesses: 0 · 5 guesses: 0 · 6 guesses: 0 · Failed in six: 9
The nine openers use the same pool and continuation policy. Across both modes: no configuration solved within six guesses; 18 of 18 configurations failed. This is performance on this answer, not an overall opener ranking.
63 openers set up a two-turn opportunity; examples include TRACK, MARKS, PARKS, STAKE, SHARK, STARK, SPARK, STEAK, SKIRT, SKATE. 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: AIRTS, SCRAT, SORTA, SPRAT, STRAD, STRAG, STRAK, STRAP, STRAW, STRAY, STRIA, SURAT. 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: AIRTS, SCRAT, SORTA, SPRAT, STRAD, STRAG, STRAK, STRAP, STRAW, STRAY, STRIA, SURAT.
A lesson from this route
Before STRAP, 12 words still fit. Its feedback left 5; 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.
Feedback distribution
STRAK can come back 101 different ways. These are the most likely, and how many of the possible answers give each one:
Letter-value totals
Base letter-value totals for STRAK; these do not show whether either game accepts the word.
Scrabble
Words With Friends
Scores shown are base values without double/triple letter or word bonuses.
Try next
Strategy after playing STRAK
What the solver recommends next for each way the board can respond to STRAK.
Quick reference
Largest feedback groups after playing STRAK:
Research on STRAK
Game-tree analysis and word research for STRAK, with an explanation for each figure.
Optimal play
Opening with STRAK, a proven-optimal strategy averages 3.68 guesses and ranks #3,644 of 14,855 legal openers. The best proven opener, TARSE, averages 3.55.
In hard mode it averages 3.79 guesses at best and is rank #1,133 of the 7,453 openers that can still guarantee a solve within six guesses.
Our six-turn simulation says 3.64, at or below the proven-optimal 3.68, 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).