Welcome to GameHourz.com!
FAQFAQ   SearchSearch      ProfileProfile    Private MessagesPrivate Messages   Log inLog in

Set algorithm

 
   Game Forums (Home) -> AI Games RSS
Related Topics:
[REQUEST] Minimax alpa beta algorithm for Othello games - any body help me please... i want to implement minimax alpa beta algorithm for othello games... anybody have the source code.... please share it to me, please ;-) please mail me at Thanks for alllllll ;)

TBC Fast Package(1-70) - Any Class Free 2000G - Wow per level per level. Dear Sir or Madam Hot Sale!For all of our news and are some Special Package! We now provide measured by..

A* and multi-goals - Hello, I am using A* to find the shortest path in a 3D I have waypoints at each rooms, points to create the graph. At the moment I can select a start and goal node, the A* algorithm do the rest and my

bigtest - bigtest

AI and C# - HI all... does anybody know a book about AI, which includes examples in c#? thx for reading ;)
Next:  Stipends available for MSc Intelligent Systems  
Author Message
Enkh

External


Since: Dec 03, 2004
Posts: 1



(Msg. 1) Posted: Fri Dec 03, 2004 10:24 pm
Post subject: Set algorithm
Archived from groups: comp>ai>games (more info?)

Hi,

I'm looking for a algorithm that creates unique sets from distinct
sets. For example, I have the following 3 sets that I want to create
different sets from.

Car: Mercedes, Honda, Toyota
Drink: water, juice, soda
Country: Brazil, Canada, England

The sets should have only one set item from the set. For example the
sets generated would be like:

Mercedes
Honda
Toyota
water
juice
soday
Brazil
Canada
England
Mercedes, water, Brazil
water, Brazil
Mercedes, Brazil

So these sets would be necessarily unique and will be all
possible-combinations of sets without two elements of one set being
together:

Mercedes, Honda, Brazil (invalid because Mercedes, Honda are from the
same set)

What kind of algorithm should I use for creating this.

Any suggestions?

Thanks,

Enkh

 >> Stay informed about: Set algorithm 
Back to top
Login to vote
AngleWyrm

External


Since: May 01, 2004
Posts: 11



(Msg. 2) Posted: Wed Dec 08, 2004 3:01 pm
Post subject: Re: Set algorithm [Login to view extended thread Info.]
Archived from groups: per prev. post (more info?)

"Enkh" <enkhtr.DeleteThis@yahoo.com> wrote in message
news:7643fe57.0412032224.2cb10ad0@posting.google.com...
> Hi,
>
> I'm looking for a algorithm that creates unique sets from distinct
> sets. For example, I have the following 3 sets that I want to create
> different sets from.
>
> Car: Mercedes, Honda, Toyota
> Drink: water, juice, soda
> Country: Brazil, Canada, England
>
> The sets should have only one set item from the set. For example the
> sets generated would be like:
>
> Mercedes
> Honda
> Toyota
> water
> juice
> soday
> Brazil
> Canada
> England
> Mercedes, water, Brazil
> water, Brazil
> Mercedes, Brazil
>
> So these sets would be necessarily unique and will be all
> possible-combinations of sets without two elements of one set being
> together:

Ok, so the Permutation{water, Brazil} and the Permutation {Brazil, water} are to
be considered the same thing? If the ordering is irrelevant, (the two should be
counted only once) then this is probably a Combination:
{ Mercedes|Honda|Toyota, water|juice|soda, Brazil|Canada|England }.

This could be implemented as a nested loop structure, in pseudocode like so:
for( Cars= 0..Toyota )
for( Drinks= 0..soda )
for( Countries= 0..England )
append_result(Cars, Drinks, Countries);

Note that I've used 0 to indicate an empty, so that {0,0,England} represents the
set {England}.

-Neutral:-
AngleWyrm

 >> Stay informed about: Set algorithm 
Back to top
Login to vote
AngleWyrm

External


Since: May 01, 2004
Posts: 11



(Msg. 3) Posted: Wed Dec 08, 2004 3:15 pm
Post subject: Re: Set algorithm [Login to view extended thread Info.]
Archived from groups: per prev. post (more info?)

"AngleWyrm" <no_spam_anglewyrm.DeleteThis@hotmail.com> wrote in message
news:MGEtd.157171$V41.115107@attbi_s52...
>
> This could be implemented as a nested loop structure, in pseudocode like so:
> for( Cars= 0..Toyota )
> for( Drinks= 0..soda )
> for( Countries= 0..England )
> append_result(Cars, Drinks, Countries);
>
> Note that I've used 0 to indicate an empty, so that {0,0,England} represents
the
> set {England}.

Also, the length of the result set will be:
(length_list1 +1) * (length_list2 +1) * ... * (length_listN + 1) for N lists.
In the example this is:
(3+1) * (3+1) * (3+1) = 4*4*4 = 64 results.

-Neutral:-
AngleWyrm
 >> Stay informed about: Set algorithm 
Back to top
Login to vote
Display posts from previous:   
   Game Forums (Home) -> AI Games All times are: Ekaterinburg, Islamabad, Karachi, Tashkent (change)
Page 1 of 1

 
You can post new topics in this forum
You can reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum



[ Contact us | Terms of Service/Privacy Policy ]