UserFriendly Strip Comments


	The Daily Static UF Archives Register UF Membership Ad Free Site Postcards Community Geekfinder UFie Gear Advertise on UF Forum Rules & FAQ Username Password Create a New Account

Back to UserFriendly Strip Comments Index

attn william bashless (long)	by gibuu	2004-12-30 12:16:08
Question about finding the solution.	by Tars_Tarkas	2004-12-30 12:38:24
Once you have the solution, testing whether it is a solution or not is pretty simple (you could draw it as a tree for example and see how high the tree is and whether the leafs cover all the coins). I was just wondering, except by (cluefully) testing everything that has a chance of being correct, how would one model the search for a solution? Especially when you have 1 in n coins and want to know the absolute minimum of weighings needed and it's impractical to do it by hand. (How about one in 200 coins...) -- Tars Tarkas, wondering.
[ Reply ]
Hmm... Strange...	by imperito	2004-12-30 12:51:14
Its a good Prolog problem.	by williamashbless	2004-12-30 12:55:44
Ah yes, Prolog...	by Tars_Tarkas	2004-12-30 13:17:47
Interestingly enough... (extension)	by williamashbless	2004-12-30 12:55:01
I did figure out the part with the sets...	by Tars_Tarkas	2004-12-30 13:12:30
Thoughts.	by williamashbless	2004-12-30 13:28:36
I think I would	by gibuu	2004-12-30 15:27:55
I like trees :)	by Tars_Tarkas	2006-11-19 12:55:59
Annotation:	by Tars_Tarkas	2004-12-30 16:07:37
thoughts on a tree	by gibuu	2004-12-30 17:01:55
Trees, Trees everywhere	by Tars_Tarkas	2006-11-19 12:55:59

[Todays Cartoon Discussion] [News Index]

Come get yer ARS (Account Registration System) Source Code here!
All images, characters, content and text are copyrighted and trademarks of J.D. Frazer except where other ownership applies. Don't do bad things, we have lawyers.
UserFriendly.Org and its operators are not liable for comments or content posted by its visitors, and will cheerfully assist the lawful authorities in hunting down script-kiddies, spammers and other net scum. And if you're really bad, we'll call your mom. (We're not kidding, we've done it before.)