3 ms·
In Hungary we have this table top game, iiuc this has the same mechanics just with colors. It was (maybe still is) popular in primary school aged 8-12. https:/
by a_imho 5y ago
In Hungary we have this table top game, iiuc this has the same mechanics just with colors. It was (maybe still is) popular in primary school aged 8-12.
https://okosjatek.cdn.shoprenter.hu/custom/okosjatek/image/data/product/Retro%20j%C3%A1t%C3%A9kok/retro_mesterlogika_kek_550_550.jpg?lastmod=1631023233.1639238329 https://okosjatek.cdn.shoprenter.hu/custom/okosjatek/image/d...
- jhgb 5y agoBasically Mastermind. We had Logik instead: https://cs.wikipedia.org/wiki/Logik_(hra) https://cs.wikipedia.org/wiki/Logik_(hra) But in Mastermind, you for example aren't told which pins are in correct positions, whereas in Wordle you are told that.
- croon 5y agoYes, it's called Mastermind [0]. Just fewer colors than letters. [0] https://en.wikipedia.org/wiki/Mastermind_(board_game) https://en.wikipedia.org/wiki/Mastermind_(board_game)
- schnitzelstoat 5y agoI'd argue it's harder though as colors can form any sequence - they don't have to form legal words.
- theFco 5y agoI'd argue that at the same time it is easier because you do not need to find valid colour sequences (in wordle you can only enter actual words to explore the solution). I wonder if the result is easier or harder overall?
- dekhn 5y agoAnd for the nerds: https://en.wikipedia.org/wiki/Mastermind_(board_game)#Worst_case:_Five-guess_algorithm https://en.wikipedia.org/wiki/Mastermind_(board_game)#Worst_... (Knuth) and In November 2004, Michiel de Bondt proved that solving a Mastermind board is an NP-complete problem when played with n pegs per row and two colors, by showing how to represent any one-in-three 3SAT problem in it.