Simple Combo/Permute calculation

In summary, the conversation discusses a Steam game called Shapez where the goal is to produce and deliver shapes to a hub using conveyor belts. The game involves using four primary shape resources (square, disc, star, and windmill) in various colors and up to four layers. The number of possible symmetrical products is 112, while the number of asymmetrical products is much larger. The conversation also delves into the complexities of rotational symmetry and layer dependencies when trying to determine the total number of possible configurations in the game.
  • #36
I think I'd be satisfied with just knowing the possible symmetrical shapes, which I think is simply
(4x8)+(4x8)2+(4x8)3+(4x8)4, as you eluded to way back at the start.
 
  • Like
Likes erobz
Mathematics news on Phys.org
  • #37
DaveC426913 said:
And I just realized that vastly complicates the calculations of the total permutations. Not I'm no longer sure that there are simply static rules, so much as there are procedures (algorithms).
We are operating under the assumption that you can in theory get to every configuration, we aren't talking about the likelihood of reaching a particular configuration.
 
  • #38
erobz said:
We are operating under the assumption that you can in theory get to every configuration, we aren't talking about the likelihood of reaching a particular configuration.
We don't even know what "every" configuration is. That trick, where a layer 2 shape is melted into layer 1, throws the combinations count into chaos because it means the "rules" for validity are ambiguous.

eg.: how many combinations are added if you melt a layer 4 all the way down to level 1? What about melting a level 4 down to level 3 and a level 2 down to level 1? The possibilities are virtually limitless.

Regardless of how it might be done or even if it can be done, simply counting them becomes an intractable problem.
 
  • #39
DaveC426913 said:
We don't even know what "every" configuration is. That trick, where a layer 2 shape is melted into layer 1, throws the combinations count into chaos because it means the "rules" for validity are ambiguous.

eg.: how many combinations are added if you melt a layer 4 all the way down to level 1? What about melting a level 4 down to level 3 and a level 2 down to level 1? The possibilities are virtually limitless.

Counting "every" configuration suddenly becomes an intractable problem.
Well, if some higher level converts like that, the new configuration was already counted. Probably safe to say what @pbuk computed ##2.0 \times 10^{24}~\rm{shapes} ## is an upper bound and leave it at that.
 
  • Like
Likes DaveC426913
  • #40
I feel like I've led you guys on a wild goose chase, only to find we're back where we started. :woot:
 
  • #41
DaveC426913 said:
I feel like I've led you guys on a wild goose chase, only to find we're back where we started. :woot:
Overall forward progress was made!
 
  • #42
Yes, ultimately the answer to the question: Would it be tactically useful to create factories that produce each type of major shape in anticipation of future levels needing them? is: probably not.
 
  • #43
DaveC426913 said:
Yes, ultimately the answer to the question: Would it be tactically useful to create factories that produce each type of major shape in anticipation of future levels needing them? is: probably not.
:oldsurprised: I didn't even realize there was a point to this beyond trying to figure out how may shapes there are!
 
  • #44
DaveC426913 said:
We don't even know what "every" configuration is. That trick, where a layer 2 shape is melted into layer 1, throws the combinations count into chaos because it means the "rules" for validity are ambiguous.

eg.: how many combinations are added if you melt a layer 4 all the way down to level 1? What about melting a level 4 down to level 3 and a level 2 down to level 1? The possibilities are virtually limitless.

Regardless of how it might be done or even if it can be done, simply counting them becomes an intractable problem.
I don't know what you mean by "melting down". There is no trick, now I've played the game the rules are simple: every layer must have at least one quadrant occupied.

That's it.

I think you are missing the simple trick that enables you to make the "hanging" quadrant in the 'logo' shape: it is made in two halves.

There is an open access wiki on Fandom, I haven't looked at it much (it spoils the fun) but it's easy enough to figure out the game mechanics if you have played things like SpaceChem, Factorio etc.
 
  • #45
pbuk said:
I don't know what you mean by "melting down". There is no trick, now I've played the game the rules are simple: every layer must have at least one quadrant occupied.

That's it.

To make this shape:
1683861714500.png


I assume you concur with this:
1683861319393.png
When layer 2 is stacked on top of layer 1, they "melt" together to become one layer. But, importantly, the blue square will not shrink. i.e. you cannot build the requested shape this way.

There is a trick to it, but it requires multiple steps. I wouldn't call it "simple" if I had to discover it on my own. To you, being more experienced with similar games, I guess it is not new.
 
Last edited:
  • #46
DaveC426913 said:
I assume you concur with this:
View attachment 326413

Yes of course, but shape(1).png plus shape(2).png equals shape(4).png.

You can easily make the first shape by cutting a shape(3).png in half.

DaveC426913 said:
To you, being more experienced with similar games, I guess it is not new.
Perhaps, although I find that this type of game exercises the same parts of my brain as I use when writing code - particularly in a low level languge with RISC machine code at the far end of that spectrum! For a game with a more explicit link to coding, try https://en.wikipedia.org/wiki/TIS-100.
 

Similar threads

Replies
13
Views
2K
Replies
5
Views
2K
Replies
1
Views
3K
Replies
1
Views
3K
Back
Top