I couldn't stop thinking about this last night so I wrote a SQL solution that appears work based off some assumptions I made about the questions I posed. SQL can be handy for brute forcing since Cartesian products represent all possible combination of 2 or more vectors. That, and SQL Server handles lots of rows easily.
It actually performs decent considering the millions of possible combination you can quickly rack up. Let me know how you handle the scenarios I asked about and I'll show you the code for a starting point. Actually, I might just paste it in a blog entry since it's kind of messy to paste all that SQL here. ~Brad -------- Original Message -------- Subject: RE: getting min value based on inputs From: b...@bradwood.com Date: Sat, September 05, 2009 10:50 pm To: cf-talk <cf-talk@houseoffusion.com> We can help you come up with an algorithm, but first some questions. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~| Want to reach the ColdFusion community with something they want? Let them know on the House of Fusion mailing lists Archive: http://www.houseoffusion.com/groups/cf-talk/message.cfm/messageid:326051 Subscription: http://www.houseoffusion.com/groups/cf-talk/subscribe.cfm Unsubscribe: http://www.houseoffusion.com/cf_lists/unsubscribe.cfm?user=89.70.4
