Haven't played dominoes in years, daresay I don't know all the rules anymore. If you know the rules to the game, and you know how to play, then show what your algorithm is stuck on.
>From what I do recall, the object is to optimize your play for the highest numbers. I don't get the "shortest common substring", idea, at all. You have your set of dominoes, and you have the set that has already been played laying on the table. You want to play your domino so as to get the highest point value. So just calculate all the possible plays you currently have, and their final values, and select the highest play possible for your turn. Substrings be damned. :) This would be a good domino player, but not the strongest one. A great one would take into account all the dominoes that have already been played, and would calculate from that data, all the possible probabilities for future play, in a depth first search perhaps. Then it would recommend a play which should be (but may not be), slightly more optimized. This would be similar to a checkers or chess game, and very complicated. On Jul 9, 1:03 am, carmelo <[EMAIL PROTECTED]> wrote: > Hi guys, anyone knows the algorithm of the domino game? i was thinking > at the shortest common substring algorithm, but it doesn't works > because when you play, you can turn the dominos ,it must be something > with dymanic programming.. anyone has an idea? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
