Comments: 16
DarknessArising [2015-03-21 22:51:31 +0000 UTC]
WaIt, again? What do you mean AGAIN?!?
👍: 1 ⏩: 0
valkiriforce [2012-08-13 03:16:20 +0000 UTC]
That is one depressed ant.
👍: 1 ⏩: 0
0202inferno [2011-03-14 20:41:40 +0000 UTC]
Wife: EEEP A BUG ITS A GIANT BUG*grabs broom and starts beating husband with it*
Husmand: OW OW OW OW OW(i knew this was going to happen)
👍: 1 ⏩: 0
BetrayerOfNihil [2009-04-08 12:37:56 +0000 UTC]
I like how he covers his eyes with his little arms.
👍: 1 ⏩: 0
tfproxy [2005-07-06 22:57:30 +0000 UTC]
Well.. I bowed to the pressures that be, and re-uploaded a brighter version of the picture.. Guess I'm going to have to re-calibrate meh monitor....
👍: 0 ⏩: 0
twonjosh [2005-07-06 04:26:01 +0000 UTC]
TSP?
👍: 0 ⏩: 1
tfproxy In reply to twonjosh [2005-07-06 04:42:16 +0000 UTC]
TSP: (Travelling Salesman Problem)
A well-known problem in Computer Science which has no known efficient solution. The problem is to find a tour of N cities (visiting all cities once) with the shortest length. Sounds easy, but once you get to a possible set of cities of 64, there's 64! (factorial) possible paths to evaluate if you do a 'generate all tours and search to find the smallest' approach. If you don't have a calculator, 64! ~= 1,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000,000 (ie. a really big number).
Using virtual 'ants' (aka. agents) a (non-proven) optimal solution can be found in a few minutes, as apposed to a few billion years it would take to brute-force search the tours.
Thats the general idea anyways
👍: 0 ⏩: 1
Dragoniade [2005-07-05 22:47:21 +0000 UTC]
Nice work Proxy. Though, the picture is a bit dark. When you crank the Gamma a little, you can see quite a lot more detail, especially the light red marking.
👍: 0 ⏩: 1
Thrashwolf [2005-07-05 06:17:33 +0000 UTC]
hehehe.
So I'm wondering if the wife is a "queen" ant. Might make a nice companion piece.
👍: 0 ⏩: 0