Skip to Main content Skip to Navigation
Journal articles

On aggregate and comparison functions for Motus/Lingo playing

Abstract : Motus (Lingo) is a TV show based on a word game where each player has to guess a word, of which she knows only the length and the first letter. To do this, the player makes different proposals and she is given some hints based on the positions of the letters. We first show in this article that there is no strategy to find all the words with the available number of proposals. Next, we study different strategies based on aggregate functions and tie-breaks. All these strategies were tested on all the 5 to 10 letter French words, which finally leads us to discuss the respective performance of these strategies. We show that the criteria of average number of tries used, worst case and number of fails are conflicting.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02133698
Contributor : Sylvain Lagrue Connect in order to contact the contributor
Submitted on : Sunday, May 19, 2019 - 5:27:46 PM
Last modification on : Tuesday, November 16, 2021 - 4:30:19 AM

File

cg2018.pdf
Files produced by the author(s)

Identifiers

Citation

Nathalie Chetcuti-Sperandio, Fabien Delorme, Sylvain Lagrue. On aggregate and comparison functions for Motus/Lingo playing. International Computer Games Association Journal, ICGA, 2018, 40 (3), pp.258-268. ⟨10.3233/ICG-180056⟩. ⟨hal-02133698⟩

Share

Metrics

Record views

253

Files downloads

486