code:

---

   0 need (ab)cd
   0 need a(bc)d
   0 need ab(cd)
------------------
   1 need (abc)d
------------------
   3 need a(bcd)
  13 need (ab)(cd)
------------------
 131 need at least one '+'
 174 need at least one '-'
 306 need at least one '*'
  36 need at least one '/'

---

So, and for the purpose of this game that is to find ONE
(repeat: ONE) solution, we can eliminate these constructs:
(ab)cd, a(bc)d, ab(cd).

The (abc)d construct is only used for these numbers
(and respective permutations): 1277 == (7*7-1)/2.

The a(bcd) construct is needed for these 3 sets:
1346 == 6/(1-3/4); 1456 == 6/(5/4-1); 1668 == 6/(1-6/8)

As for the (ab)(cd), 13 is too much to test for...
Even 3 may prove to be too much!

Hope this helps you guys, even though I may be shooting myself in the foot,
but hey! this is just a friendly competition...

Gonna do some work, then sleep over it. I'll probably only get back to this
in some 48 hours or so to start (and finish) my coding for this one, so
don't be surprised if you don't read from me for a couple of days...

[ 18. September 2002, 17:31: Message edited by: Fernando Madruga ]