On 8/4/06, ridvansg <[EMAIL PROTECTED]> wrote: > > Hi, > Lately I saw an interesting game and wonder is there a good algorithem > to find the best solition. > > You have 5 type of bubbles in a matrix. You can select 2 or more > neighboring bubbles with the same color and remove them. The bubbles > are neighboring if they have common border.(no diagonals) > If a column of bubbles disappears the matrix is reduced to a matrix > without this column. > Am,n -> Am,n-1. > Do you mean SameGame? http://en.wikipedia.org/wiki/SameGame
> The best solution is the solution removeing max bubbles. > > I will be happy to see a solution. This is NP-Complete problem. http://theory.lcs.mit.edu/~edemaine/clickomania/ > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
