Talk:Wordiff

AI?

Perhaps AI could be a stretch goal. This game sounds fun, but I suffer from a dearth of people willing to play text games with me on a single device. Idea for a simple AI: it has a 1/(x^2 + 2) chance of losing each turn, where x is the number of possible answers. (Tweak the numbers to your satisfaction). --Chunes (talk) 18:27, 30 July 2021 (UTC)

Hi Chunes, your question got me thinking about making programs to play the game, and what strategies or algorithms could be used.

Initially I thought a simple strategy of choosing the next wordiff with the most mossible wordiff from that word would be best - it would be a quick algorithm as count of wordiff from a word could be pre calculated and just looked up each turn leading to a fast response likely to not loose in a timed-out game against another program.

But then I thought about if an algorithm tried to actively steariits opponent by trying to choose a wordiff that has no wordiff response -that algo might force the first to loose given enough time - especially as most of the dictionary is used up.

An interesting question...

--Paddy3118 (talk) 07:30, 31 July 2021 (UTC)

Are we to assume what is meant by "checking"

After checking,   then what?

In the task's description,   are we to assume what is meant by "checking"?

•   A player loses if the   wordiff   word:

•   isn't in the dictionary,   or
•   is a repeat of a past word,   or
•   differs from the last word inappropriately.

-- Gerard Schildberger (talk) 02:44, 31 July 2021 (UTC)

HI Gérard. The intro before the Task heading, especially "The change can be either:"... Has the extra info.

--Paddy3118 (talk) 07:13, 31 July 2021 (UTC)