Talk:Teacup rim text: Difference between revisions
Content added Content deleted
(No longer clear that only one permutation of each set of qualifying words should be printed. Suggested a wording to deal with this.) |
|||
| Line 19: | Line 19: | ||
: Well I've just had a go at making the task less prescriptive yet with a view to limiting the output. It wasn't easy and I would have been nice to have a nice mathematical way of representing the permutation technique, in the same way that one can with big sigma and big pi for arithmetic formulae. [[User:Axtens|Axtens]] ([[User talk:Axtens|talk]]) 07:44, 6 August 2019 (UTC) |
: Well I've just had a go at making the task less prescriptive yet with a view to limiting the output. It wasn't easy and I would have been nice to have a nice mathematical way of representing the permutation technique, in the same way that one can with big sigma and big pi for arithmetic formulae. [[User:Axtens|Axtens]] ([[User talk:Axtens|talk]]) 07:44, 6 August 2019 (UTC) |
||
:: Unfortunately, following the rewording, it's no longer clear that only one permutation of each set of qualifying words should be printed. After: "Display one line for each set of teacup rim words." I suggest you add the following: |
|||
::: "Having listed a set, for example [ate tea eat], refrain from displaying permutations of that set, e.g. [eat tea ate] etc." |
|||
:: --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 09:10, 6 August 2019 (UTC) |
|||
== should programming solutions be assuming caseless words? == |
== should programming solutions be assuming caseless words? == |
||