A better way to check each row and column matches of 1-Dimensional tiles (Java)

xxMrPHDxx

The current algorithm is such a mess and it's not giving the right answers.

It supposed to check for each type of candy, for at least 3 consecutive candy type it will "break".

May I know a simple or at least a source algorithm for that purpose.

You may see my code on my GitHub here and the part of my algorithm here.

Thanks in advance :D

Chrisir

CAN you tell us the file and line numbers relevant?

And post those lines here also?

It’s good that you posted on github but it’s a lot of code

xxMrPHDxx

@Chrisir Sorry about that. I have added a hyperlink to the code above.

jeremydouglass

@xxMrPHDxx which match3 definition is your goal? Do you want to check for horizontal and vertical matches; do you want to check for diagonals?

See the detectPossibleSwaps method from this tutorial:

• https://www.raywenderlich.com/66877/how-to-make-a-game-like-candy-crush-part-1

Chrisir

and diagonal?

xxMrPHDxx

@jeremydouglass Thank you but that's not what I meant though.

Let say I have

A B C C B A B B C

I want to find all candidate for both horizontal and vertical matches given 3 or more consecutive type (From above let say the 3 B's above) and will have them all to pop out (I know I need to store all matches in an Array) after the checking done.

Anyway thanks for your reply. I appreciated that :D.

xxMrPHDxx

My current code is working but it's not detecting matches if the matches at the last 3 row/col. Please help :-S.

You can find my code here.

Btw this part is not needed:

        if(j == 7 && match.size() >= 3) {
            match.add(tiles[i][j]);
            matches.put(tiles[i][j].getCandy(), match);
            //System.out.println(match);
        }

I thought that could solve the problem but it's not

jeremydouglass

You might find this recent post interesting:

https://forum.processing.org/two/discussion/25413/crumple-a-collapse-like-game-framework