Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.

Topics - Carca_Maker

Pages: [1]
General / The two big ROUNDED LABYRINTHS tiles, doubt.
« on: September 15, 2019, 03:17:14 AM »
Does anyone know how do they work both this two ROUNDED  LABYRINTH tiles?. Where can I find theirs rules?. Thanks!.

I'm not sure if the uploaded image is right.

The first tile is the big labyrinth in the middle of a CCCC tile (with a small buildings around, such a cathedral or something like that).

The second tile is a RFFF with a road that ends in a big rounded labyrinth.

Hi everybody!
I'm working on my Carcassonne variant about some "elements", but I'm stopped at this point:

To build a sets of 3, (and in the other side) , sets of 4 of this “elements". ("Triple",  and "Quaterna" respectively?).  Sets of one, and two elements are trivial.

So we are at this starting point:

*We have got an amount of 10 elements: one "1", two "2", three "3", and finally four "4“.

A) If we extract randomly  THREE of them without replacement, how many cases are at all at every single branch?. (See my accompanying trees of three extracted elements).

I think that repeated sets of this  three elements are considered as "different" cases, although they have got the same composition.

So it looks that it doesn't matter the way, the order in that this elements are considered.

Every branch of this could be ordered in any order. It only matters its composition and how many repeated times appears every case inside its own branch.

Very important: although for example, we have extracted one "2", this is DIFFERENT  from the other existing "2", this means that at the end we could have got apparently some "repeated cases", but they have to be seen as "DIFFERENT", although belonging to the same  branch, of course.

I estimated approximately among 720 cases at all, at all the "triplets" trees, but I'm not sure if it's true.

I followed my own describing graphical order, where I began by the most unusual, uncommon element to the most frequent elements, in my trees.

B)The same for the sets, branches,  of FOUR of this extracted elements from the total amount of this 10 possible elements, (without replacement, etc).

Finally, a basic question:
It would be a  clarification for me to knowing how many cases are the most representative branches "1234", and "4444“,  separately, for example. Thanks.

I would include the helpers and solvers of this questions at the acknowledgements of my variant, and I would give a "+1“s thanks to them.

POSDATA: I wonder also if anyone can tell me if I could write all this in Spanish, my usual language. Is it possible too?. Greetings from Carca_Maker.

Pages: [1]