On aggregate and comparison functions for Motus/Lingo playing - Archive ouverte HAL Access content directly
Journal Articles International Computer Games Association Journal Year : 2018

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.
Fichier principal
Vignette du fichier
cg2018.pdf (327.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02133698 , version 1 (19-05-2019)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More