Math Help Forum

Math Help Forum Feed Site Feed

Go Back   Math Help Forum > University Math Help > Discrete Mathematics, Set Theory and Logic
Reply
 
Thread Tools Display Modes
  #1  
Old April 11th, 2009, 08:09 AM
Newbie
 
Join Date: Apr 2009
Posts: 1
Country:
Thanks: 0
Thanked 0 Times in 0 Posts
Calculoso is on a distinguished road
Arrow Combinatorics Problem: Enumeration of large solution set

Hello, I am working on a project and am trying to finalize some of the more difficult math work. This is based off of a card game "Challenge 24"

The basic premise is you are given 4 numbers (1-9) and you must perform any of the basic mathematical operations in order to produce "24" from those numbers. As an example:

Given 8 2 6 4

8 x 4 = 32; 32 - 6 = 26; 26 - 2 = 24

OR

4 / 2 = 2; 6 / 2 = 3; 8 * 3 = 24 (note all numbers must be used)

As you can see the number of solutions can get large rather quickly. I am trying to determine the best way of A: making sure that the numbers generated HAVE a solution (i.e. 1 1 1 1 cannot come up) and B: enumerating all possible solutions for every 4-number combination without repetition (i.e. 4 4 6 8 is the same as 4 6 4 8; order does not matter).

Thanks for your help
Reply With Quote
Advertisement
 
Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are Off
Pingbacks are Off
Refbacks are Off
Forum Jump


All times are GMT -7. The time now is 02:55 PM.


Powered by vBulletin® Version 3.7.3
Copyright ©2000 - 2010, Jelsoft Enterprises Ltd.
SEO by vBSEO 3.2.0 ©2008, Crawlability, Inc.
©2005 - 2009 Math Help Forum


Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics.
Register to post your math questions or just hang out and try some of our math games or visit the arcade.