Math nerds; I have a problem for you to work on

I want to see if I can figure out how to do this or if it's even possible or not.

This was how I formed this idea:

At first I wanted to try to make a level that has a large number of solutions (but not infinite). I want a lemmings level that has a definitive finite number of solutions that are certainty different from each other*.

Then I got to thinking why not make the level as small and limited as you can and see how many solutions you can fit into one tiny level? Two extremes: smallest level; smallest skill set, (possibly) smallest time limit but largest number of solutions.

Obstacles:

*The first major obvious problem here is defining how solutions differ from each other. I'm not sure if this was discussed in the NP hard thread but it goes without saying that every level has a huge number of solutions if you consider e.g. placing a builder bridge 1 pixel differently to be different.

**For this to even be worth considering I think we need to come up with a good definition of what constitutes a "different" solution. ** But this is not easy. Some important factors:

-Each objective of each skill might have to be factored into this consideration. For example; in the above example; this would not constitute different because if the object was to cross a gap and placing the bridge with a leeway of 5 or so pixels still reaches said objective; then only one of those count. Placing the bridge on any of those pixels is the same solution.

However; if the bridge crosses a gap in one example; then in another; is placed 1 pixel to the left and still crosses the gap but the builder doesn't turn from hitting something above (which he did if one pixel to the right) then this in turn allows him to do something else not possible otherwise etc etc.) this could allow for a 'certainty different' solution. Already it's gotten pretty complicated.

I'm not exactly sure how to even begin. I'm curious if there's a way to compute this or make some kind of educated estimate/ballpark/upper & lower bound on what a possible answer might be.

IMO the best way to start would be to make the smallest possible solvable level (which I believe namida did posted a while ago in discord); work out the number of possible solutions; then make the level slightly bigger; adding only 1 new element or possibility etc. and go from there?

I got the idea for this while watching a video about the Tree3 problem. Maybe we will be able to create another new huge number while doing this