3x3
1 tile with 6 neighbors
4 tiles with 2 neighbors
4 tiles with with 3 neighbors.
4 x 4
4 tiles with 6 neighbors
8 tiles with 3 neighbors
4 tiles with 2 neighbors
1 Like
It's not like I'm making it up, I'm just speaking from what I saw testing the game with different tile counts and board sizes. If a board is populated with only 3 tiles this is what you get basically every single time:
The edges make a huge difference, believe it or not
literally interpolate that function right there
figure out whatever 5x5 is
and then interpolate to 10x10 or whatever.
You are a lot less likely to even make 3-match tiles, most of your matches will result in 4 or 5 per color and cause chains that will hit multiple colors.
Then the dropping algorithm (being completely random) is very likely to just generate matches on its own.
i'll just do this
2 Likes
Jones game output suggestion is really great
Why do you even try to make some le puzzle game instead of literally just making a crawl port
I wrote a simulator for this abstract problem we're having.
It's genuinely a fun game to play, if you have access to a computer you should try it out.
1 Like
Yeah I'm excited to see it come along. It's genuinely good!
@CulturedUrbanite Same thing on a 4x4 board. Of course tile count matters a lot too - as I'm only using 2 unique tiles, but board size is a big compounding multiplier here.
Does the game work on android?
It's not "good", don't try to compliment me too hard - it's just a little fun right now. Good is still a long way to go.
1 Like
What are you working on?
writing a neighbors function
Sorry for being stupid and not understanding your argument, but how does that factor in number of colors?
1 Like
for a single point there are what 8 places to check?
I was just going to randomize boards for a certain number of colors/width and average the number of matches on a board.