00:53:17 *** zxcvbnm has quit (Ping timeout) 00:53:37 guys 00:53:39 guess what 00:53:44 TreeSheets is now open-source! :D 00:53:45 http://treesheets.com/ 00:53:50 https://github.com/aardappel/treesheets 00:56:18 *** ElectRo` (x@cryto-D181503A.torservers.net) has joined #crytocc 00:57:06 *** why_slap_option has quit (Ping timeout) 00:58:26 *** why_slap_option (thespartan@B6238662.680BA07C.DE6EDE27.IP) has joined #crytocc 01:02:27 i would like prezi goes opensource someday too :9 01:12:15 *** Ari (Ari@Ari.users.cryto) has joined #crytocc 02:07:34 *** why_slap_option has quit (Ping timeout) 02:20:22 *** why_slap_option (thespartan@B6238662.680BA07C.DE6EDE27.IP) has joined #crytocc 02:20:55 hello? 02:28:27 hey 02:33:39 hi 02:33:54 are you good in pc stuff 02:53:58 uh 02:54:00 yeah i guess 03:05:25 *** Ari has quit (Ping timeout) 03:23:08 *** AnonO_o (AnonO_o@anonO_o) has joined #crytocc 03:35:58 *** AnonyOps has quit (Connection reset by peer) 04:00:03 *** why_slap_option has quit (User quit: if i do not leave im dead) 04:10:04 *** why_slap_option (thespartan@B6238662.680BA07C.DE6EDE27.IP) has joined #crytocc 04:11:32 *** ilikeapricot (app@ilikeapricot.users.cryto) has joined #crytocc 04:21:29 *** HiveResearch has quit (Connection reset by peer) 04:25:42 *** why_slap_option has quit (User quit: if i do not leave im dead) 04:42:19 *** HiveResearch (HiveResear@developers.developers.developers) has joined #crytocc 04:53:15 *** AnonO_o has quit (User quit: twitter: @anonO_o) 07:53:12 *** mama has quit (Ping timeout) 08:02:30 *** mama (anon@47649B90.8D44884B.9FBD6124.IP) has joined #crytocc 08:05:03 *** S1renide (S1renide@cryto-2301C9CF.us-west-1.compute.amazonaws.com) has joined #crytocc 08:06:25 *** S1renide has quit (User quit: Connection closed) 10:04:13 *** mikaa has quit (Input/output error) 10:04:32 *** mikaa (mikaa@cryto-BE25F493.noisetor.net) has joined #crytocc 11:27:41 *** cr[a]tes (crates@cryto-C482EFD6.zworg.com) has joined #crytocc 11:28:18 *** crates has quit (Ping timeout) 13:20:04 *** mikaa has quit (Ping timeout) 13:21:15 *** mikaa (mikaa@cryto-4E0C48D2.noisetor.net) has joined #crytocc 13:24:08 *** Anon0x31337x (Anon0x3133@cryto-75BB7685.sub-70-192-65.myvzw.com) has joined #crytocc 13:28:15 joepie91: Checked Treesheets... Nice! 13:28:29 joepie91: If works well it might replace Pnotes 13:28:31 for me 13:28:33 :D 13:29:49 Hmm, so it's like a sort of some XML or XHTML like solution? 13:31:37 no 13:31:43 it can export to XML though 13:32:01 *** Anon0x31337x has quit (User quit: Leaving) 13:52:29 *** LastOneStanding (lalalala@5C0B2CEF.B458528D.147E7205.IP) has joined #crytocc 14:04:06 joepie91: i hope reality is being less retarded in your neck of the woods 14:09:58 joepie91: Checked the tool, I need to get use to it, that is for sure 14:18:46 norbert79: well yes, it works differently from pretty much everything else 14:18:49 I haven't seen anything alike it 14:18:52 but it's quite intuitive :P 14:19:01 (imo) 14:19:12 keybindings that make sense and such 14:19:44 Yeah, I just find it pity I can't use it like Pnote, so a nested notepad like application staying constantly on the screen 14:19:54 like how Pnotes works 14:20:43 there's probably a window manager hack for that :) 14:20:48 of some kind 14:21:14 nah, office lappy, can't really extend it 14:21:25 that's why I found Pnotes a blessing 14:21:35 otherwise it's useful 14:21:39 really 14:21:40 aha :P 14:26:14 *** mama has quit (Ping timeout) 14:30:14 *** DaSpirit (DaSpirit@cryto-27A17A57.nycmny.fios.verizon.net) has joined #crytocc 14:35:43 *** mama (anon@F0845C18.5982FCB.42C12FD2.IP) has joined #crytocc 14:42:53 *** ilikeapricot has quit (Input/output error) 14:49:30 *** LastOneStanding has quit (No route to host) 14:50:02 *** LastOneStanding (lalalala@5C0B2CEF.B458528D.147E7205.IP) has joined #crytocc 14:56:37 *** why_slap_option (thespartan@B6238662.680BA07C.DE6EDE27.IP) has joined #crytocc 15:00:07 *** why_slap_option has quit (User quit: if i do not leave im dead) 15:00:18 *** why_slap_option (thespartan@B6238662.680BA07C.DE6EDE27.IP) has joined #crytocc 15:01:11 *** zxcvbnm (~crack7765@zxcvbnm.users.cryto) has joined #crytocc 15:45:13 https://static.googleusercontent.com/external_content/untrusted_dlcp/www.itasoftware.com/en//pdf/ComplexityofArlineTravelPlanning_Carl_Sep-03.pdf 15:45:18 why is this shit so stupidly complex 15:52:05 *** ilikeapricot (app@ilikeapricot.users.cryto) has joined #crytocc 15:55:18 *** mama_ (anon@cryto-C630644E.is.a.tor.exit.server.torland.is) has joined #crytocc 15:56:47 *** mama has quit (Ping timeout) 15:56:56 *** mama_ is now known as mama 16:02:17 *** LadyOscar (zzzzzz@LadyOscar.users.cryto) has joined #crytocc 16:04:09 *** LadyOscar has parted #crytocc () 16:09:58 https://soundcloud.com/dubstep/nothing-at-all-by-time-flies 16:17:36 *** why_slap_option has quit (Input/output error) 16:26:27 *** mama has quit (Client exited) 16:27:01 *** why_slap_option (thespartan@B6238662.680BA07C.DE6EDE27.IP) has joined #crytocc 16:33:51 *** DaSpirit has quit (User quit: I have to go, bye!) 16:39:34 *** why_slap_option has quit (Input/output error) 16:42:59 *** mama (anon@cryto-1199A66F.static.contabo.net) has joined #crytocc 17:03:56 yay im st0ked! 17:04:07 joepie91, the shop offers a reward 17:04:11 unbelievable 17:05:49 happy :)) ending 17:09:49 mikaa: congratulations :) 17:17:02 *** Max (Max@cryto-235478EC.xen.vps.regruhosting.ru) has joined #crytocc 17:19:13 *** Max has quit (User quit: Sto andando via) 17:19:27 halloes joepie91 :> 17:19:44 hai 17:32:27 *** ebola has quit (Ping timeout) 17:44:02 *** Yolo has quit (Ping timeout) 17:47:37 *** ebola (ebola@ebola.users.cryto) has joined #crytocc 18:00:15 *** dpk (dpk@cryto-BDFC78BC.infologie.co) has joined #crytocc 18:00:30 pfft, *PUBLICALLY 18:03:59 *** dpk has quit (User quit: ZNC - http://znc.in) 18:04:10 *** dpk (dpk@dpk.users.cryto) has joined #crytocc 18:06:09 dpk:) you're a failed grammar nazi, nice! 18:06:27 publicly is the word :) 18:06:33 i'm not a failed grammar nazi 18:06:47 publically is an acceptable variant, and the only variant that makes sense 18:06:52 would you use "basicly"? 18:07:05 no, and that's not a useful argument 18:07:08 why boxes not boxen? 18:07:14 english isn't supposed to make sense 18:07:14 :P 18:07:21 because this isn't anglo-saxon any more 18:07:34 It's much more fluid than that 18:08:38 "publicly" is a historical mistake of the 16th century which was corrected in 1797 18:08:51 unfortunately news of this has yet to reach the ears of most people 18:09:08 wonderful, you can be the siren of that song 18:09:17 i am being 18:09:26 until everyone else accepts that spelling, I'm going to continue spelling it correctly 18:09:33 *incorrectly 18:09:41 well, correctly. but illogically 18:09:48 (note: not illogicly) 18:09:55 logic has very little to do with it 18:10:02 you're just pointing out inconsistencies in english 18:10:29 shall we take a jaunt through every other language too? they're all inconsistent 18:10:45 i'm pointing out one inconsistency in English orthography 18:10:48 there are many others 18:10:51 but this one is mine 18:10:58 yeah okay 18:10:58 :P 18:11:04 boxes not boxen, I rest my case 18:11:11 * lady-3jane walks off 18:11:13 and it's only hard to correct because people continute to insist that "publically" is incorrect 18:11:13 *** Ari (Ari@Ari.users.cryto) has joined #crytocc 18:11:29 hello Ari, welcome to CrytoCC, a publically-logged channel 18:11:40 public-ally no 18:11:43 wat 18:11:45 * lady-3jane grins 18:11:49 why is there a joinbot? 18:11:56 he's not 18:12:01 he's a join asshat 18:12:01 haha 18:12:03 hai dpk 18:12:06 lol 18:12:07 :> 18:12:07 and hai Ari :P 18:12:11 dpk is human? 18:12:14 aye 18:12:15 yes, he is 18:12:23 (theoretically, anyway) 18:12:30 well 18:12:30 hai der 18:12:52 this is not the first time i've been mistaken for a join-welcoming automaton. though on this particular channel, it is the first time 18:13:03 i am 100% humon 18:13:17 well 18:13:21 nice to meet you humon 18:13:26 dpk: then again, it's the first time you act like an automaton here! 18:13:41 :) 18:14:14 1797 in Catal. Prints: Polit. & Personal Satires (Brit. Mus.) (1942) VII. 328, I do not Consider myself accountable for them after thus publically Warning every Person. 18:14:24 is first recorded use of the "publicly" spelling 18:14:29 err, "publically" even 18:14:35 according to the OED 18:14:44 publicly: 1559 in P. F. Tytler Hist. Scotl. (1864) III. 391 Their minister shall have full liberty..to ministrate the sacraments, publicly and privately. 18:15:18 ("publictlie", a Middle English-ism was used in 1534) 18:15:32 man i love tafting the OED 18:25:46 *** Anon0x31337x (Anon0x3133@cryto-EAE23253.sub-70-192-68.myvzw.com) has joined #crytocc 18:58:18 wat 18:58:25 does [off] work with /me? 18:59:02 yes. 18:59:03 yes it does. 19:07:29 lol, wow 19:07:31 "Obscene language offends both children and adults. A ban on its use is not an infringement of human rights. This is a direction towards a civilized lifestyle. If we do not use foul language in real life, then why do we use it on the Internet? Deputy Mizulina calls to protect vulnerable layers of the population - particularly children. I think that this initiative should be supported," the lawyer told Pravda.Ru. 19:07:41 http://english.pravda.ru/society/family/26-07-2013/125277-foul_language-0/ 19:10:15 https://www.youtube.com/watch?v=s_osQvkeNRM 19:11:17 *** monod (~pmpf@monod.users.cryto) has joined #crytocc 19:19:20 *** mama has quit (Client exited) 19:23:20 oh wow 19:23:36 it looks weird, but it works :D 19:32:10 *** mama (anon@cryto-C630644E.is.a.tor.exit.server.torland.is) has joined #crytocc 19:35:22 *** HiveResearch has quit (Ping timeout) 19:38:24 hey uh, dpk, look what I found: http://gtfs.ovapi.nl/ 19:38:49 transit data for -all- Dutch transport companies 19:38:57 oh, wow 19:39:02 and some Belgian ones also, it seems 19:39:05 De Lijn is Belgian 19:39:13 and there's a few I don't recognize 19:39:31 look what else I found: http://www.gtfs-data-exchange.com/ 19:39:47 *** LastOneStanding has quit (User quit: you guys, I'm going home.) 19:40:30 in particular, http://www.gtfs-data-exchange.com/agencies 19:41:01 London being notably absent 19:41:05 (of course) 19:42:01 bunch of US and Australia data: https://code.google.com/p/googletransitdatafeed/wiki/PublicFeedsNonGTFS 19:42:26 oh hey, also some London stuff linked 19:42:35 and some other countries it seems... 19:43:39 https://github.com/OneBusAway/onebusaway-uk 19:44:43 https://code.google.com/p/googletransitdatafeed/wiki/LondonConvertScript 19:44:49 loggy, pointer? 19:44:49 http://wire.cryto.net/logs/crytocc/2013-07-30#T19-44-49 19:45:07 dpk, see ^ 19:45:27 nice 19:45:34 for NL stuff: http://9292opendata.org/datacollecties 19:45:44 which is the organization that wrote the actual 9292 planner 19:45:50 looks like NL got their shit in order 19:45:51 heh 19:45:53 for once 19:53:48 110 WPM / 99.6% accuracy, YAY! 19:57:04 err 19:57:07 * zxcvbnm bangs out 143 on the reg 19:57:31 143 wpm?? 19:57:36 yesssir 19:57:39 my top is 156 19:57:40 monstar 19:57:43 but that was when i was a kid 19:57:47 i'm slow now 19:57:57 what does "on the reg" mean? 19:58:02 on the regular.. i was just being stupid 19:58:03 :) 19:58:09 hahahaha 19:58:13 lulz 19:58:15 its american slang 19:58:22 murican 19:58:25 yessir 19:59:29 in the aptitude repo there's a program called typespeed 19:59:44 it also allows for multiplayer head-on-head match 19:59:48 oh really 19:59:51 yeah 19:59:53 that is awesome 19:59:55 :D 19:59:59 the only thing 20:00:04 is you have to get aptitude ? 20:00:15 err 20:00:23 maybe it's debian's repo 20:00:34 then, also ubuntu 20:00:40 but don't know for the others 20:00:56 the only thing is that you don't write sentences, but just words scrolling the window 20:01:03 which is frenetic :S 20:03:26 is there something that counts your words per minute during normal typing? 20:03:32 so not copying over given sentences and such 20:03:38 just your normal typing in whatever applications you normally use 20:04:11 how would that detect pauses? :T 20:04:21 why would it have to? 20:04:24 it can just keep a rolling average 20:04:26 and display it 20:04:26 :P 20:04:36 eh, I guess 20:04:40 but then what if you AFK for an hour? 20:05:05 it could also pause when idle for 5-6 seconds, which clearly is not when someone's typing 20:05:18 aaaaand, nope, haven't heard of it already, joepie91 20:05:28 uhm, dpk 20:05:31 someone just pointed me at this 20:05:33 http://www.travelinedata.org.uk/datausers.htm 20:06:15 hmm 20:06:37 I mean, Traveline isn't -entirely- complete 20:06:40 but they have a serious dataset 20:06:43 * dpk nods 20:06:51 and are generally the go-to planner 20:07:01 as far as I can determine 20:08:19 also, I'm considering experimenting with the 9292 dataset 20:08:21 to learn how2planner 20:08:36 already have an idea for an algo 20:10:50 spam-off-topic: try this on conky: update_interval 0.00000000000000000000000000000000000000000000000000000000000001 20:10:51 haha 20:11:06 my cpu went up 5°C 20:11:21 (the default value for that was... 1) 20:11:37 joepie91: when i did this for the Manchester buses only, i used A*. do not use A* 20:11:42 use Dijkstra's 20:11:57 and don't forget to account for the fact that people can walk between bus stops etc. 20:12:34 A*? 20:12:34 what are you up to dpk? 20:12:37 https://krebsonsecurity.com/2013/07/mail-from-the-velvet-cybercrime-underground/ 20:12:40 note that I haven't researched any of these algos at all 20:12:42 whatsoever 20:12:42 funny 20:12:51 A* is http://www.policyalmanac.org/games/aStarTutorial.htm 20:12:52 I just thought of "how would one figure out how to get from A to B" 20:12:53 blank slate 20:13:09 Dijkstra's is … https://en.wikipedia.org/wiki/Dijkstra's_algorithm 20:13:37 dpk: I see, thanks. 20:13:53 the thing is, it's possible in the UK to have different routes with a different cost, right? 20:13:57 because of different companies 20:13:59 yeah 20:14:07 I don't want to necessarily find the shortest route 20:14:13 sometimes also the cheapest reasonable route 20:14:16 yeah 20:14:24 and Dijkstra's doesn't seem to account for that 20:14:28 well, you can weight it by different factors 20:14:36 Dijkstra does 20:14:43 ^ ^ 20:14:52 the one you want is 1: travel time and 2: travel cost 20:14:52 though, how would I weight it in such a way? 20:15:10 this is crucial 20:15:13 especially taking into account things like starting tariffs 20:15:56 well, weighting edges by two factors is a lot more complicated than weighting by one 20:16:02 iirc, Dijkstra founds the most convenient path, given a weigthed graph 20:16:05 exactly 20:16:25 so you should probably start with travel-time-in-minutes as the basic weight 20:16:25 that's the point: you have to find a way to combine every information into one number, a coefficient 20:16:40 hmm 20:16:43 then weight that with cost 20:16:51 km/€ might be an idea :P 20:16:59 dpk: the question here is, how would I weight it with cost if I have to take into account a flat start tariff? 20:17:00 hmm, yes 20:17:06 ie one company may charge less per mile 20:17:13 but have a base tariff 20:17:20 whereas another company charges more by the mile, but doesn't have a base tariff 20:17:30 the problem is that the starting tariff is not variable 20:17:36 therefore it's not a per-mile weight 20:17:37 base tariff == fixed starting cost? 20:17:45 and you can't calculate it relatively towards the total trip cost either 20:17:49 because you don't know the length of the trip yet 20:17:52 while calculating 20:17:57 monod: yes 20:18:26 fixed starting cost that covers X miles? 20:18:34 no 20:18:38 for example 20:18:44 you have company A and company B 20:18:56 company A charges you a fixed cost of 2 euro, plus 50 cents per mile 20:19:02 company B charges you no fixed cost, but 75 cents per mile 20:19:05 (hypothetically) 20:19:12 ok, the idea 20:19:18 well... 20:19:22 for company A, the cost is (2 + (distance * 0.50)) 20:19:27 *** mama has quit (Client exited) 20:19:28 for company B, the cost is (distance * 0.75) 20:19:50 clearly <1 miles paths are conveninent with company A 20:19:54 all <1 miles paths 20:21:35 yes, but that's not useful information when you're trying to weight distance 20:21:35 if are there time estimatinos for the travels, you could also take a look at €/sec 20:22:18 anyway, the point is to travel with minimum cost and time ? 20:23:00 anything else? 20:23:39 (even if I don't know what are you up to, it's entertaining to be at work with something I'm studying at university :D) 20:23:49 (that is: be able to project) 20:24:03 (that's why there is not so much programming.. :( ) 20:24:04 hm, true, the point is to travel fastest, not shortest distance 20:24:13 the cost is distance-based though 20:24:15 :/ 20:24:21 yeah, weight by travel time, not by distance 20:24:22 argh, complicated 20:24:31 dpk: the problem is that you're not billed by travel time 20:24:33 ok, plus eventually additional base tariff 20:24:38 hahahah 20:24:40 that's great 20:24:48 haven't thought about it xDD 20:24:50 I'm really tempted to just try out my own algo 20:24:50 lol 20:24:52 joepie91: i would suggest ignoring cost entirely to begin with 20:24:58 noooo 20:25:02 it's easy enough to change the weighting later 20:25:06 you CAN ignoe time then!! :D 20:25:07 since it takes this into account 20:25:12 if it does not add to the cost 20:25:14 provided you don't be idiot 20:25:22 ignore* 20:25:39 dpk: I have no idea how, though 20:25:40 :p 20:26:11 example of why travel time is better weight than distance: it takes 1h30 by train from C'roe to Manchester (30 miles) and 2h15 Manchester to London (170 miles or something) 20:26:27 *** mama (anon@27C824CF.75E4C942.B5C2B35.IP) has joined #crytocc 20:26:32 dpk: again, the problem is that cost is not based on time 20:26:42 so if you're trying to take into account cost by weighting stuff 20:26:44 yeah, but i'm saying: ignore cost entirely 20:26:47 you're going to be weighting distance 20:26:53 well, the point is kind of to have proper pricing info 20:26:55 to start with 20:27:02 no, ignore cost as part of pathfinding 20:27:03 then it'll be hell to add it later :P 20:27:06 you can still show the price 20:27:07 no it won't 20:27:11 as long as you have the data 20:27:17 hehe 20:27:22 the problem is taking it into account during pathfinding 20:27:22 "you can still show the price" 20:27:41 if you abstract the "find weight" part of the pathfinder you can easily change it to account for cost later 20:28:05 I didn't understand what the problem is, and I have 2 minutes 20:28:12 before trying to go to sleep 20:28:15 (:() 20:28:19 monod: public transport route search 20:28:24 not that 20:28:26 I mean: 20:29:01 what's the criteria of your pathfinding? The cheaper travel from A to B? 20:29:12 but also 20:29:16 "best" 20:29:17 monod; you should be able to pick between 'fastest' and 'cheapest' 20:29:36 joepie91: i think you shouldn't have to pick, it should automatically make a good compromise 20:29:38 perhaps an 'optimal' option also that tries to be inbetween them 20:29:43 right, exactly 20:29:55 but that's trivial when you have fastness/cheapness info 20:30:00 joepie91, fastest and cheapest... hmm. dpk, "best" has to be defined by us/you 20:30:16 yeah, best is a compromise between speed and cost 20:30:17 fastest and cheapest have just one weigth each 20:30:26 and 20:31:26 " yeah, best is a compromise between speed and cost" and we goddamn have to consider distance while considering cost, BUT... in some way, the cost provided by companies already incapsules the "distance" information since companies already taxes according to distance, in some way 20:31:27 yes? 20:31:50 and we goddamn have to consider distance while considering distance* 20:32:06 aaand, that phrase could just be erased, if it's true what I've concluded 20:32:47 finally 20:33:15 right, but it might be cheaper but a bit slower to take a bus than a train in one case. if the train costs £15 and takes 1h and the bus costs £10 and takes 1h10m i think the bus is the better option 20:33:28 (⬑ hypothetical scenario) 20:34:01 (arriving to that, writing at 28 wpm :D) 20:34:26 oh, haha 20:34:35 i just thought of a way to combine time and money factors 20:34:39 put a price on people's time :D 20:34:46 even better, let them put a price on their time 20:35:01 (stretching from minimum wage to banker's bonus salary?) 20:35:11 that does not change 20:35:12 I mean 20:35:20 if you choose to tax A's time 20:35:24 5$ /s 20:35:28 or 10$ /s 20:35:34 it's like the same 20:35:38 I mean 20:35:43 those prices are the same 20:35:57 because all the times are being multiplied by that number 20:36:02 I think 20:36:58 back to what I said, here's the continuum: since I can't imagine such a pathfinder algorithm like Dijkstra to be able to find the second-best, the third-best, etc, but only the first-best, in order to find the best/optimal solution you have to definitely change weigths, that is: you have to create a new definition of weight, starting with speedness and cheapness 20:37:12 haha, fastness* 20:37:15 right, exactly 20:37:20 speediness 20:37:21 so imagine this: 20:37:24 oh yeah 20:37:26 thanks 20:37:30 speediness* 20:37:34 so imagine this: 20:37:35 that's the whole point of the weight factor in pathfinding 20:37:37 then I will go 20:37:45 you can change it to alter the properties of the route that will be found 20:37:46 what is the BEST BEST ULTRA BEST? 20:37:58 (just to make it easier..) 20:38:12 something that costs very low and it's really fast 20:38:23 imagine you have this travel in 12s and for 1€ 20:38:26 or 20:38:35 1/5 minutes and 1€ 20:38:44 I don't know if you see already 20:38:59 you might just multiply cost and time together 20:39:09 as a raw starting point 20:39:33 and, of course, the best path is that with lowest time*cost value 20:39:45 oh, right 20:39:46 because you want the lower time and cost 20:39:48 that could work 20:39:52 yeah but 20:39:59 since multiplication *is* commutative 20:40:07 i think putting a price on people's time is plusfunner though 20:40:13 hahaha 20:40:34 *** mama has quit (User quit: ChatZilla 0.9.90.1 [Firefox 17.0.6/20130511124515]) 20:40:36 by this raw starting point you get that two travel are equally good if they have the same time*cost value 20:40:42 I don't know if this is true in real life ;) 20:40:45 you just have to verify 20:40:59 I think you have to do it by examples perhaps 20:41:07 using a modification to Dijkstra's algorithm it should be possible to determine multiple routes 20:41:15 I'm just not sure how to go about it 20:41:20 interesting 20:41:22 you mean: 20:41:28 you'd have to, in some way, determine when it would be reasonable to "revisit" a node 20:41:28 second-best, third-best, etc? 20:41:31 that has already been visited 20:41:33 through another route 20:41:40 oh, wait 20:41:47 i just understood what joepie91 was on about 20:41:48 hah 20:41:48 right 20:41:54 hmm, that's a tricky problem 20:41:56 if you do that, and keep track of separate routes and their distances... 20:41:56 gotta go now 20:41:59 that should work 20:42:00 or, 8 minutes ago xD 20:42:08 the problem is - what should the criteria for revisiting be? 20:42:11 okay, talk to you later monod :) 20:42:32 "the problem is - what should the criteria for revisiting be?" that was the problem I saw in the second-best, third-best thing 20:42:40 ttyl guyz! 20:42:43 *** monod has quit (User quit: Quit) 20:45:40 dpk: hard problems! 20:45:42