Jump to content
  • Advertisement


This topic is now archived and is closed to further replies.



This topic is 5464 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Anyone know how to solve this efficiently? I have a group of, say, 200 objects. I want to know how many groups of 6 I can make with those objects. The limitation is that there is a list of object pairs, whose objects can''t be in the same set of 6. Anyway to do this without listing all possible sets of 6 and testing if any pairs that can''t be together are in there? Thanks

Share this post

Link to post
Share on other sites
Guest Anonymous Poster
Yes, yes there is.

This is whats known as a Constraint Satisfaction Problem (CSP). Google for it.

There''s a few different ways to go about it. Try using techniques such as backtracking, and heuristics like "Least Constrainint First", and "Most Constrained First".

Its a pretty cool problem to play around with. Also, depending on the number of objects and the number of constraints this could take a very long time to solve.

Share this post

Link to post
Share on other sites

  • Advertisement

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!