AlexMassenzio / AlexMassenzio/wordchain

Support Branching Paths Implicitly

未关闭
#29 1 条评论 0 个 reaction 已指派 0 人 在 GitHub 查看
enhancement
主要语言
TypeScript
星标
3
派生
1
PR 合并指标
30 天内没有已合并 PR

描述

### Describe the problem

Some wordchains have branching paths (anagrams which start with the same letter). Iterating over all possible wordchains in advance and numbering then via an alphabetical order depth-first search for all anagrams would make this feel less confusing.

### Describe the proposed solution

Firstly, remove or modify the feature that only allows a single play a day - this would allow players to try and find alternate paths. Folks tend to want to try again anyway, so one way or another being allowed to retry could be cool?

Next, iterate over the wordchain. If a chosen word has any anagrams which start with the same letter, iterate over each in alphabetical order, continuing their respective wordchains from there.

Number these finished wordchains, and if there exists more than one, add a new row to the results copy/paste. Maybe something like:

Wordchain #X (MM/DD)
✅ 7/7
🏁 75.11s
🔀 Branch #2
https://wordcha.in/

### Alternatives considered

Alternatively, we could write a script to go through the dictionary to remove any instances of words which are anagrams and share a first letter. There probably aren't *all* that many, and it would remove the possibility of branching paths.

ALTERNATIVELY alternatively, you could do what Wordle does and just prescribe a correct word for the wordchain, ignoring alternate valid words. In such a case it would probably be worthwhile to change the error red flash to a yellow warning flash with a message like "Wrong Word!"

### Additional Information

_No response_

贡献指南

这个仓库没有索引到贡献指南

评估

这个 Issue 还没有评估数据。

把新 issue 发到你的邮箱

精选适合新手参与的 GitHub issue 摘要。