Comparing 2 lists of points

Hello World,

I am working on some kind of cellular-automata where I am trying to express interactions like:

The neighbour on top of you should be A/B/whatever.

I can manage to describe a list with every potential neighbour of a cell, but I need my programm to check wether that location is actually existant or not.

Suggestions anyone? I'd rather not rip my points in even more lists, loosing sight...

Attachments:

Question-Comparision.png, 86 KB

Replies to This Discussion

Permalink Reply by Danny Boyes on July 7, 2014 at 3:03am

You should have a look at the Set Components in the Set Tab

Permalink Reply by Andreas Wilde on July 7, 2014 at 3:10am

Merci beaucoup! Exactly what I was looking for! :)

Permalink Reply by Andreas Wilde on July 7, 2014 at 4:31am

The Result of Intersection and other Tools like 'Find similiar member' makes up new lists with new indexes.

I need to set such Items false/true in the first List (Set A) whereas the others become true/false.

Did not find a way myself.

Permalink Reply by Danny Boyes on July 7, 2014 at 4:55am

I don't think I follow exactly what the process is here but if you could dumb it down to an un-ambigous set of rules. i.e

1) Check for point A in SET B

2) IF in SET B then List A = TRUE, List B = False

etc etc

Then I could probably have something working for you.

Permalink Reply by Andreas Wilde on July 8, 2014 at 11:44am

You were right, and luckily I could get myself some help in real life.

That's what I did later on.

In this project I need to combine dozens of checks to express one rule.

Then again I have dozens of rules I try to express.

Then those rules are used to reward or punish different cells, to receive some kind of fitness for the system.

I fear it wont be the last question.

But this forum is great and I'll try to fit in. ;)

I can imagine the way I'm expressing myself must be irritating, just like my screenshots.

That's because I try to get things work for myself, aware that certain ways to do things are not overly efficient and time consuming. But I learn loads.

Anyways, thanks.

RSS