Is the number of tiles fixed - i.e. is it always seven?
The least you can score is always zero: it's always a legal move to lay tiles which differ in every place from the ones above
Err ... isn't it always one? You can always score one by laying tiles which differ in every place but the right-hand one.
It looks like the problem ought to be related to adding but I can't make the connection.
If the number of tiles we play with is always seven (or even just small), my first choice for an algorithm to find the highest score would be simple brute force, sad to say! With only a little bit-twiddling for each instance it's not going to take long, and I'm usually more confident in the completeness of brute force algorithms than more subtle ones.
![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png)
timeasmymeasure
no subject
Date: 2005-11-01 05:21 pm (UTC)The least you can score is always zero: it's always a legal move to lay tiles which differ in every place from the ones above
Err ... isn't it always one? You can always score one by laying tiles which differ in every place but the right-hand one.
It looks like the problem ought to be related to adding but I can't make the connection.
If the number of tiles we play with is always seven (or even just small), my first choice for an algorithm to find the highest score would be simple brute force, sad to say! With only a little bit-twiddling for each instance it's not going to take long, and I'm usually more confident in the completeness of brute force algorithms than more subtle ones.