2012-01-05T00:04:46 *** gaussin has joined #aichallenge 2012-01-05T00:06:34 *** gaussin has left #aichallenge 2012-01-05T00:11:21 *** alehorst has joined #aichallenge 2012-01-05T00:15:29 *** alehorst has quit IRC (Ping timeout: 240 seconds) 2012-01-05T00:48:05 *** dr0b3rts has quit IRC (Ping timeout: 248 seconds) 2012-01-05T01:00:52 *** dr0b3rts has joined #aichallenge 2012-01-05T01:03:04 *** u_ has quit IRC (Quit: u_) 2012-01-05T01:06:06 *** JorgeB has joined #aichallenge 2012-01-05T01:15:15 *** Jak_o_Shadows has quit IRC (Read error: Connection reset by peer) 2012-01-05T01:15:58 *** Jak_o_Shadows has joined #aichallenge 2012-01-05T01:22:40 *** ltriant has quit IRC (Quit: Computer has gone to sleep) 2012-01-05T01:58:41 *** Kurnevsky has joined #aichallenge 2012-01-05T02:39:39 *** dr0b3rts has quit IRC (Quit: WeeChat 0.3.4) 2012-01-05T02:47:50 *** pairofdice has quit IRC (Quit: When cryptography is outlawed, bayl bhgynjf jvyy unir cevinpl.) 2012-01-05T02:49:46 *** thestinger has quit IRC (Quit: WeeChat 0.3.6) 2012-01-05T02:54:41 *** TheLinker has quit IRC (Quit: Bye) 2012-01-05T03:07:05 *** chris_0076 has quit IRC (Read error: Connection reset by peer) 2012-01-05T03:08:36 *** treeform has quit IRC (Remote host closed the connection) 2012-01-05T03:12:00 *** chris_0076 has joined #aichallenge 2012-01-05T03:18:10 *** Palmik has joined #aichallenge 2012-01-05T03:37:20 *** mviel_ has joined #aichallenge 2012-01-05T03:39:59 *** dorisabayon has joined #aichallenge 2012-01-05T03:41:02 *** Fandekasp has quit IRC (Ping timeout: 255 seconds) 2012-01-05T03:50:13 who is a go person here? 2012-01-05T03:50:31 is it just the online thing or can i literally not have open brackets on a newline and have it compile 2012-01-05T03:50:34 if not that's retarded 2012-01-05T03:51:24 *** epicmonkey has joined #aichallenge 2012-01-05T03:51:36 *** g0llum has joined #aichallenge 2012-01-05T04:16:04 *** Jak_o_Shadows has quit IRC (Read error: Connection reset by peer) 2012-01-05T04:37:38 *** amstan_ has quit IRC (Ping timeout: 240 seconds) 2012-01-05T04:44:46 *** replore has quit IRC (Remote host closed the connection) 2012-01-05T05:02:12 *** UncleVasya has joined #aichallenge 2012-01-05T05:15:55 *** UncleVasya has quit IRC (Ping timeout: 252 seconds) 2012-01-05T05:19:46 *** Blkt has joined #aichallenge 2012-01-05T05:23:23 *** guido_ has joined #aichallenge 2012-01-05T05:23:31 hey 2012-01-05T05:23:50 I've got a problem 2012-01-05T05:24:34 I want to ask a question on the forum, but I can't register to the forums... I don't get an activation email 2012-01-05T05:25:42 guido_: have you checked your spam folder? 2012-01-05T05:25:55 yes i did 2012-01-05T05:26:12 not sure, you'll have to ask amstan when he's around 2012-01-05T05:26:31 hmm ok 2012-01-05T05:26:46 are the forums still active? 2012-01-05T05:33:17 guido_, what about just asking here (in the meantime) ? 2012-01-05T05:33:25 well 2012-01-05T05:34:32 I want to do some research for a bachelor thesis, and therefor I want to use a database with all the played games in it. Then, I want to use some sort of learning algorithm to learn to play optimal 2012-01-05T05:34:53 is there such a database? 2012-01-05T05:35:15 guido_: you can get game data, but that wont be useful for playing your own games 2012-01-05T05:35:30 what you can do is download other peoples bots from the forums and use those as a basis for testing the quality of your bot 2012-01-05T05:36:07 well I want to use a algorithm that only watches other games, and learns that way 2012-01-05T05:36:44 why not have it learn from its own past games? 2012-01-05T05:37:08 i'm not quite sure how to actually download all the data 2012-01-05T05:37:14 janzert or McLeopold would probably know 2012-01-05T05:38:14 I want to try to let it learn from others, I hope that works better 2012-01-05T05:38:33 i'm yet to see a successful learning bot 2012-01-05T05:39:14 that's what I want to test :) 2012-01-05T05:39:28 how far in are you? 2012-01-05T05:39:40 i'd be way more interested in seeing a successful predictive bot 2012-01-05T05:39:55 ie. a bot which predicts the moves of its opponents based on its previous moves that game 2012-01-05T05:40:04 *** smiley1983 has quit IRC (Ping timeout: 240 seconds) 2012-01-05T05:40:18 that would be extremely fruitfull with battles in ants i suspect, and should really predict timeout bots by itseld 2012-01-05T05:41:11 That is something I would like to do. This is something it should learn 2012-01-05T05:41:28 it's not going to learn it well unless you set it up to 2012-01-05T05:41:38 Yes thats true 2012-01-05T05:41:45 I want to use some sort of learning algoritm 2012-01-05T05:42:00 that's quite vague 2012-01-05T05:42:18 *** smiley1983 has joined #aichallenge 2012-01-05T05:42:20 i've never really played around with learning, i always imagined it would be similar to writing a bot normally but then training some special parameters 2012-01-05T05:42:34 *** alehorst has joined #aichallenge 2012-01-05T05:44:04 Well, I want to find out if this works better. And I think it's more then just training some special parameters 2012-01-05T05:47:36 good day everyone 2012-01-05T05:47:43 good morning 2012-01-05T05:47:50 i'm not liking go 2012-01-05T05:47:55 just for the bracket thing 2012-01-05T05:48:12 oh, you're picky.. 2012-01-05T05:51:20 you have no idea :P 2012-01-05T05:55:32 *** Garf has joined #aichallenge 2012-01-05T05:58:01 *** mviel__ has joined #aichallenge 2012-01-05T05:58:36 *** bqf has quit IRC (Ping timeout: 240 seconds) 2012-01-05T06:00:32 *** bqf has joined #aichallenge 2012-01-05T06:01:03 *** bqf has joined #aichallenge 2012-01-05T06:01:08 i foud it dissapointing, that go came with pointers(say null pointers) again, and the lack of generics, but otherwise, nice! 2012-01-05T06:01:49 *** mviel_ has quit IRC (Ping timeout: 260 seconds) 2012-01-05T06:05:14 what do you people think of aerique's asteroid proposal ? 2012-01-05T06:13:24 *** grc48 has quit IRC (Quit: Leaving) 2012-01-05T06:24:33 *** mleise has joined #aichallenge 2012-01-05T06:28:14 *** mcstar has joined #aichallenge 2012-01-05T06:39:26 *** smiley1983 has quit IRC (Quit: Lost terminal) 2012-01-05T06:50:20 sounds sweet to me 2012-01-05T06:53:40 looks good too 2012-01-05T06:54:28 haha 2012-01-05T06:54:44 ok, i looked over the logs 2012-01-05T07:08:30 damn applicative functors.. 2012-01-05T07:10:30 *** ntnix has joined #aichallenge 2012-01-05T07:19:31 *** ahow984_ has joined #aichallenge 2012-01-05T07:22:15 :O projecteuler is down :P 2012-01-05T07:41:39 *** sigh has joined #aichallenge 2012-01-05T07:46:40 *** GeorgeJ has quit IRC (Read error: Operation timed out) 2012-01-05T07:50:57 ah no 2012-01-05T07:51:11 i cant check my result 2012-01-05T07:51:23 heh 2012-01-05T07:51:27 my bestest hasgell fungtion so far 2012-01-05T07:51:30 I can't find a new problem :( 2012-01-05T07:51:59 ahow984_: thats a NEW problem! 2012-01-05T07:52:16 hmm, funny emphasis 2012-01-05T07:52:28 I would have said: THAT is the new problem :P 2012-01-05T07:52:59 put your empasis .... 2012-01-05T07:53:07 XD 2012-01-05T07:53:25 bleh 2012-01-05T07:53:31 how many have you done now? 2012-01-05T07:53:35 dunno 2012-01-05T07:53:42 i had to rewrite this alg totally 2012-01-05T07:53:49 i had something beutiful in mind 2012-01-05T07:53:53 whats the problem? 2012-01-05T07:53:59 but turned out, it doesnt fit the problem .( 2012-01-05T07:54:23 find d, such that 1/d in decimal floating point repr. has the longest digit cycle 2012-01-05T07:54:39 d <= 1000? 2012-01-05T07:54:45 it is the pincaccle of my haskell knowledge 2012-01-05T07:54:47 yes 2012-01-05T07:54:49 < 2012-01-05T07:55:14 I was going to do that one 2012-01-05T07:55:23 but I'm glad I didn't now :P 2012-01-05T07:55:27 why? 2012-01-05T07:55:30 its easy 2012-01-05T07:55:49 i just spent too much time on it yesterday, cause i wanted something very elegant 2012-01-05T07:56:05 but today ive dont it in at most an hour 2012-01-05T07:56:11 done* 2012-01-05T07:56:20 did i tell you i had my hair cut? 2012-01-05T07:56:28 heh, no 2012-01-05T07:56:33 looks nice 2012-01-05T07:56:34 congrats I suppose :P 2012-01-05T07:56:38 i had long hair 2012-01-05T07:56:50 ah, thats why its a big deal 2012-01-05T07:57:00 yep 2012-01-05T07:57:10 how is it easy 2012-01-05T07:57:26 I imagine recursion for checking to see if theres a pattern? 2012-01-05T07:57:56 it has recursion, multiple times, as usual 2012-01-05T07:58:21 you dont have to check for a pattern 2012-01-05T07:58:34 its quite long 2012-01-05T07:58:46 20 lines 2012-01-05T07:59:06 4 of them are just import lines 2012-01-05T07:59:08 lol, that'd equate to about 80 C++ I imagine :P 2012-01-05T07:59:17 more in this case 2012-01-05T08:00:05 why don't you need to check for a pattern? 2012-01-05T08:00:12 Is that not the whole idea of it? 2012-01-05T08:00:24 i can tell you 2012-01-05T08:00:31 but im not sure you want to hear t 2012-01-05T08:00:33 i 2012-01-05T08:00:35 good point 2012-01-05T08:00:45 hmm, seems counter-intuitive 2012-01-05T08:00:54 not really 2012-01-05T08:01:02 ah >_< 2012-01-05T08:01:05 I think I know 2012-01-05T08:01:11 i dont get what pattern do you want to check 2012-01-05T08:01:16 tell me if this would work 2012-01-05T08:01:32 split the decimal in half 2012-01-05T08:01:38 subtract both half 2012-01-05T08:01:41 *halves 2012-01-05T08:01:46 *** GeorgeJ has joined #aichallenge 2012-01-05T08:01:46 *** GeorgeJ has joined #aichallenge 2012-01-05T08:01:52 if it == 0, then theres a recurring pattern? 2012-01-05T08:02:12 sorry i dont get it 2012-01-05T08:02:26 why half? 2012-01-05T08:02:32 from what do i subtract them? 2012-01-05T08:02:46 0.[x][y] 2012-01-05T08:02:49 "it" is what? 2012-01-05T08:03:03 if(x-y == 0) 2012-01-05T08:03:13 will that show if theres a recurring pattern? 2012-01-05T08:03:23 what is 0.[][] ? 2012-01-05T08:03:28 ah gosh 2012-01-05T08:03:32 youre waay off 2012-01-05T08:03:50 haha 2012-01-05T08:03:52 ok 2012-01-05T08:04:19 its annoying i cant check my result 2012-01-05T08:04:28 whats the anxious-angry smiley? 2012-01-05T08:04:39 >: 2012-01-05T08:04:46 0.1234512345 2012-01-05T08:05:05 split the decimal part in half, you get [12345][12345] 2012-01-05T08:05:10 [x][y] 2012-01-05T08:05:21 if(x-y == 0) //there's a pattern 2012-01-05T08:05:26 haha 2012-01-05T08:05:28 ok 2012-01-05T08:05:31 do it like this 2012-01-05T08:05:39 soon youll see.. 2012-01-05T08:06:16 pattern doesn't keep recurring? or it doesn't take up all of the decimal part I suppose :/ 2012-01-05T08:06:22 ahow984_: first question, how do you intend to produce the floating point representation? 2012-01-05T08:06:53 *** mleise has quit IRC (Read error: Operation timed out) 2012-01-05T08:07:13 GMP and just for(int i=1; i<1000; i++) decimal_number = 1/i; 2012-01-05T08:07:32 now tell my why that wont work 2012-01-05T08:08:07 nfi.... 2012-01-05T08:08:14 that particular line? 2012-01-05T08:08:21 well, ok, gmp has multiple precision floating point arithmetic, not just integer arithmetic 2012-01-05T08:08:27 so, you could make it work 2012-01-05T08:08:36 yes 2012-01-05T08:09:09 i just programmed a simple integer division algorithm 2012-01-05T08:09:19 like the one you learn in school 2012-01-05T08:09:59 anyway, you get dividents all the time that you must divide by d 2012-01-05T08:10:03 (in 1/d) 2012-01-05T08:10:12 ok 2012-01-05T08:10:21 and how will that tell you if you have a pattern? 2012-01-05T08:10:37 and if any of that number occurs from the beginning of the list(because you collect these), you found the cycle 2012-01-05T08:11:11 and the rest of the list's length is basically the length of the cycle-1 2012-01-05T08:11:32 lol man, you're smart at this stuff :P 2012-01-05T08:11:36 how did you work out that? 2012-01-05T08:11:48 what do you mean? 2012-01-05T08:11:54 everybody knows how to divide 2012-01-05T08:12:13 the problem was, that i had something else in mind yesterday 2012-01-05T08:12:41 i wanted a recursive data structure, that produces the decimals as i apply "head" to it 2012-01-05T08:12:51 but ultimately, it would be useless 2012-01-05T08:13:02 (and i wasnt ready for that in haskell, either) 2012-01-05T08:13:23 heh 2012-01-05T08:13:35 as you apply head to it :P 2012-01-05T08:13:38 lol'd 2012-01-05T08:13:43 I understand you though 2012-01-05T08:15:32 *** mviel_ has joined #aichallenge 2012-01-05T08:18:50 *** mviel__ has quit IRC (Ping timeout: 252 seconds) 2012-01-05T08:22:31 *** mviel__ has joined #aichallenge 2012-01-05T08:25:59 *** mviel_ has quit IRC (Ping timeout: 252 seconds) 2012-01-05T08:35:03 :@ PE 2012-01-05T08:35:22 I need puzzle! 2012-01-05T08:36:13 :O 2012-01-05T08:36:26 Warning: mysql_connect() [function.mysql-connect]: Can't connect to local MySQL server through socket '/var/lib/mysql/mysql.sock' (2) in /home/admin/domains/projecteuler.net/public_html/includes/init_db.php on line 14 2012-01-05T08:36:30 Could not connect to MySQL 2012-01-05T08:36:33 thats not good :( 2012-01-05T08:36:38 its going to take ages 2012-01-05T08:36:47 ahow984_: http://acm.timus.ru/problemset.aspx 2012-01-05T08:38:18 lol 2012-01-05T08:38:23 a+b problem.... 2012-01-05T08:38:29 Hint: use + operator 2012-01-05T08:38:31 >_< 2012-01-05T08:41:03 see the difficulty meter on the right 2012-01-05T08:41:09 yeah 2012-01-05T08:41:48 http://acm.timus.ru/problem.aspx?space=1&num=1693 2012-01-05T08:42:55 huh 2012-01-05T08:44:06 that looks incredibly difficult.... 2012-01-05T08:49:55 pe is back btw 2012-01-05T08:53:34 ah, correct 2012-01-05T08:56:04 ahow984_: i wanna scare you http://codepad.org/FxZ7ynjo 2012-01-05T08:56:24 seems the haskell compiler on codepad is outdated 2012-01-05T08:56:52 dear god.... 2012-01-05T08:57:07 why? 2012-01-05T08:57:14 why would anyone want that 2012-01-05T08:57:20 I know its powerful lol :P 2012-01-05T08:58:18 I wonder what a haskell compiler's code looks like 2012-01-05T08:58:36 i guess it is written in c 2012-01-05T08:58:38 to go from that to asm would be ridiculously challenging 2012-01-05T08:58:48 not really 2012-01-05T08:58:55 the optimizations are the hard part 2012-01-05T08:59:16 and the whole language 2012-01-05T08:59:21 thats something 2012-01-05T08:59:41 heh 2012-01-05T09:01:35 ... 2012-01-05T09:01:36 shit 2012-01-05T09:01:54 my mom is minding our neighbours kids and she brought them in here >_< 2012-01-05T09:01:57 fml 2012-01-05T09:03:32 *** sigh has quit IRC (Remote host closed the connection) 2012-01-05T09:07:38 ttyl 2012-01-05T09:12:21 *** mleise has joined #aichallenge 2012-01-05T09:27:29 *** mviel_ has joined #aichallenge 2012-01-05T09:31:23 *** mviel__ has quit IRC (Ping timeout: 252 seconds) 2012-01-05T09:47:16 *** TheLinker has joined #aichallenge 2012-01-05T09:55:48 *** Harpyon has quit IRC (Quit: Textual IRC Client: http://www.textualapp.com/) 2012-01-05T09:55:56 grr 2012-01-05T09:56:02 why do people pay for an irc client.... 2012-01-05T09:56:24 ahow984_: because they... shit I dunno 2012-01-05T09:56:35 haha 2012-01-05T09:56:53 you were going to say "get a better service" weren't you :P 2012-01-05T09:57:21 especially Mac people. If they don't pay an exorberent fee for their stuff, they hate it 2012-01-05T09:58:00 TO: ALL TEXTUAL CLIENT USERS; RE: irc clients 2012-01-05T09:58:10 just go get irssi ffs 2012-01-05T09:58:12 :) 2012-01-05T09:58:32 irssi ftw 2012-01-05T09:59:01 *hi5* 2012-01-05T09:59:33 we're tied at 17 PE problems again 2012-01-05T09:59:39 ohhh 2012-01-05T09:59:41 :P 2012-01-05T10:00:09 you've still got a few easy ones to do though 2012-01-05T10:00:10 I can't see many really simple ones I can do in 10 lines anymore 2012-01-05T10:00:30 textualsomething looks nice on the mac and you feel hip if you use it 2012-01-05T10:00:36 ah, 25 should be ok for me :) 2012-01-05T10:00:48 /whois mcstar 2012-01-05T10:00:55 I don't even know you any more.... 2012-01-05T10:01:14 why do you think everyone wants a lame console? 2012-01-05T10:01:19 would you pay for an irc client? 2012-01-05T10:01:28 fine, get XChat, BitchX 2012-01-05T10:01:33 something FOSS 2012-01-05T10:01:39 why? 2012-01-05T10:01:59 because they're usually better 2012-01-05T10:02:01 someone put hard work into that client, and some other guy wants to pay for it 2012-01-05T10:02:02 they look nice 2012-01-05T10:02:06 and they're free? 2012-01-05T10:02:34 ahow984_: they probably aren't in the mac app store since they are probably open source 2012-01-05T10:02:41 I'm not saying anything against the creators of it. only against the people who buy it simply because they think it's better 2012-01-05T10:03:00 you dont know the reason why that guy bought it 2012-01-05T10:03:04 rwest: true :/ 2012-01-05T10:03:07 I don't know which direction I should take at solving a card game. The number of card combinations is overwhelming. 2012-01-05T10:03:08 So far I have the probabilities that a player can make a certain move. 2012-01-05T10:03:51 But once that player actually makes a move, I know the cards he places on the table, so the probabilities for everyone change again. 2012-01-05T10:04:01 ahow984_: what annoys me is the message(advertising) that it leaves when it leaves 2012-01-05T10:04:14 mcstar: surely you can change that? 2012-01-05T10:04:20 mleise: card games can be done mathematically, learn combinatorics 2012-01-05T10:04:38 For example if I knew there were 2 aces in the game, they can be spread amongst the players, but when one player places them, they are obviously gone from the game 2012-01-05T10:04:43 ahow984_: i dont care, i just hate them noobs spamming me 2012-01-05T10:04:59 im perfectly fine with weechat 2012-01-05T10:05:06 irssi: /set quit_message 2012-01-05T10:05:11 but probably i leave a footprint too 2012-01-05T10:05:16 *** mcstar has quit IRC (Quit: WeeChat 0.3.6) 2012-01-05T10:05:20 mcstar: what client do you use? 2012-01-05T10:05:23 *** mcstar has joined #aichallenge 2012-01-05T10:05:25 [~mcstar@adsl-89-132-12-196.monradsl.monornet.hu] has quit [Quit: WeeChat 0.3.6] 2012-01-05T10:05:26 oh 2012-01-05T10:05:31 yeah, weechat 2012-01-05T10:05:45 rwest: You say it like it is the inevitable truth. Aren't there multiple ways to solve them? 2012-01-05T10:06:00 lets delete that message 2012-01-05T10:06:03 mleise: mathematically is way faster than programatically 2012-01-05T10:06:05 heh 2012-01-05T10:07:28 mleise: even if you just use the math concept in your program that solves it, your computation time can be cut to under a second 2012-01-05T10:07:48 rwest: So combinatorics can solve the problem of interdependent decisions and give me the best decision among many that would usually create an enormous game tree? 2012-01-05T10:08:03 *** mcstar has quit IRC (Client Quit) 2012-01-05T10:08:19 *** foRei has joined #aichallenge 2012-01-05T10:08:23 *** mcstar has joined #aichallenge 2012-01-05T10:08:24 :D much better mcstar. [Client Quit] 2012-01-05T10:09:10 mleise: they can be used to calculate the number of different moves and also probability of different events that are random 2012-01-05T10:09:13 I know I can use combinatorics to solve part of the problem, like the probabilities that a player has a set of cards, but I have no idea how to extend that to an actual played game 2012-01-05T10:10:22 rwest: Sure, number of moves. That helps me in allocating memory, but not knowing the next players' moves depending on my move 2012-01-05T10:10:23 mleise: you would use the probability to assign weights to given moves based on probabilities of what other players have 2012-01-05T10:10:45 rwest: sure 2012-01-05T10:10:55 that's how a good poker ai works 2012-01-05T10:10:57 I've got these numbers 2012-01-05T10:11:14 for say texas holdem 2012-01-05T10:11:27 based on what it knows, it has to calculate it's chance of winning 2012-01-05T10:11:33 I take a look at my cards and use combinatorics to calculate the probabilities that other players can make any of the valid moves 2012-01-05T10:12:16 but it is not like the game ends when I placed cards and the next player placed cards 2012-01-05T10:12:25 mleise: then it is a min/max from there, but the deeper you go, the less accurate 2012-01-05T10:13:36 whats that supposed to mean? 2012-01-05T10:13:45 Would I need a min/max? I mean, right now I cannot evaluate a hand to some floating point number, so I don't know if a certain move is good or bad by itself. 2012-01-05T10:14:01 mleise: I don't know the game 2012-01-05T10:15:00 It is the game I talked about yesterday. 32 cards (8 values, 4 duplicates) 2012-01-05T10:15:02 mcstar: you don't know your opponents hands, you can get probabilities of what they have, but if you are wrong on any given move, subsequent moves you could simulate would be very wrong 2012-01-05T10:15:30 One player begins and the next players try to place the same amount or more of a higher value. 2012-01-05T10:15:37 rwest: min/max simulates scenarios, it doesnt have probabilities 2012-01-05T10:15:55 So a 7 is followed by 1 to 4 eights or higher cards 2012-01-05T10:16:23 mcstar: that is the point, your scenarios generated are based on shaky data 2012-01-05T10:16:40 in this case 2012-01-05T10:16:48 The player who could last make a move starts a new 'stack' 2012-01-05T10:17:00 rwest: i dont agree, lets leave it there 2012-01-05T10:17:10 It is ok to skip a turn 2012-01-05T10:17:36 So you may be able to put cards on a stack, but want to save them for later. 2012-01-05T10:17:54 mcstar: you are telling me I can't generate a set of data based on what will probably happen? 2012-01-05T10:17:55 The one who is without cards first, wins. 2012-01-05T10:18:12 you are scoring possible futures 2012-01-05T10:18:24 evaluating whats best for you, and for your opponent 2012-01-05T10:18:37 at thsi point i dont see probabilities 2012-01-05T10:18:52 Actually I want a four player game :) 2012-01-05T10:18:52 mcstar: yes, but you do not know your opponents hands, you know what you have and what has been played 2012-01-05T10:19:06 rwest: exactly 2012-01-05T10:19:34 and you can calculate the probability that the remaining cards are spread one way or the other 2012-01-05T10:20:01 mleise: that would have to be done via checking behavior I think 2012-01-05T10:20:12 like say they play only a high card when the prev card is low 2012-01-05T10:20:24 maybe it is because they do not have cards in between 2012-01-05T10:20:51 maybe? 2012-01-05T10:21:04 mleise: otherwise, you will probably be way off 2012-01-05T10:21:11 for what opponents have 2012-01-05T10:21:16 rwest: ok, makes sense, but then i dont know how this probability scoring and min/max interacts 2012-01-05T10:21:27 do you computer averages for every node? 2012-01-05T10:21:29 -r 2012-01-05T10:21:29 they must play a higher card or skip the round. that helps reduce the problem space 2012-01-05T10:22:01 mleise: if they MUST, that helps 2012-01-05T10:22:04 2*eight can only be beaten by at least 2 nines or higher cards 2012-01-05T10:22:17 well.. or they can skip 2012-01-05T10:23:21 mcstar: it's more of a you calculate their most probable hand and do the tree with that assumption 2012-01-05T10:23:22 but if player 1 puts cards on the table and everyone else skips, he is able to open a new stack, giving him the chance to get rid of some low cards, like sevens 2012-01-05T10:23:52 mleise: I would try to use a strategy similar to what I would do playing it myself 2012-01-05T10:24:00 lock people out of playing altogether 2012-01-05T10:24:13 since I have played Asshole a lot 2012-01-05T10:24:18 and this game is much like that 2012-01-05T10:24:19 heh 2012-01-05T10:24:29 rwest: That's what I'd like to do. But once I decide on one game tree node (i.e. one set of cards for a player) the probabilities for all other players must be recalculated 2012-01-05T10:25:02 rwest: This game is our little family version of Asshole ;) 2012-01-05T10:25:30 mleise: I think calculating the set of cards for a player really can't be done without using their previous moves to help you 2012-01-05T10:25:50 and then of course, the AI would be able to be mislead if the player knows it's strategy 2012-01-05T10:26:21 Imagine you would backtrack what a player has from looking at what he played 2012-01-05T10:26:35 mcstar: rwest: would one of you mind telling me the answer to PE 25? I have it done but I just want to see how close my answer is (off by one error or something) 2012-01-05T10:26:52 If it is 3 eights, you would look at all game trees and find out where 3 eights has the highest rank 2012-01-05T10:26:57 say the card down is a 3 and they play a 10 2012-01-05T10:27:10 283? 2012-01-05T10:27:12 I say assume they have no card (except doubles) between 3 and 10 2012-01-05T10:27:18 or something similar 2012-01-05T10:27:22 289? 2012-01-05T10:27:26 298? 2012-01-05T10:27:29 293? 2012-01-05T10:27:31 ended in a 7 2012-01-05T10:27:35 I remember that 2012-01-05T10:27:53 rwest: :( I feared it would come down to miming a human 2012-01-05T10:27:56 kk, something around there 2012-01-05T10:27:58 ty 2012-01-05T10:28:16 ah 2012-01-05T10:28:21 25th? 2012-01-05T10:28:23 did it take long to run? 2012-01-05T10:28:32 mine is fast 2012-01-05T10:28:39 4782 2012-01-05T10:28:41 I use my own bignum library though 2012-01-05T10:28:42 lol, i was off 2012-01-05T10:28:51 mcstar: or it had a 7 2012-01-05T10:28:52 lol 2012-01-05T10:28:53 hmm, I think mine goes into an infinite loop :/ 2012-01-05T10:29:08 or else its desperately slow lol 2012-01-05T10:29:11 oh I can see the answer when I click the problem 2012-01-05T10:29:42 mcstar: I understand the log(phi^n/sqrt(5)) now :) 2012-01-05T10:30:10 (phi^n-psi^n) 2012-01-05T10:30:30 ah yes 2012-01-05T10:30:38 i estimated it near 5000 2012-01-05T10:30:42 i remember now :) 2012-01-05T10:30:48 lol wtf is psi? :P 2012-01-05T10:30:55 tangential curve? :/ 2012-01-05T10:31:02 ahow984_: why did you say you understood? 2012-01-05T10:31:04 I already had a program that would print out a fib number with such digits 2012-01-05T10:31:34 that formula up there that I said finds the number of digits in fib(n) 2012-01-05T10:32:15 approximately its: log_10((phi^n-psi^n)/sqrt(5)) 2012-01-05T10:32:30 where phi=(1+sqrt(5))/2 2012-01-05T10:32:35 where psi=(1-sqrt(5))/2 2012-01-05T10:32:40 or something VERY similar 2012-01-05T10:32:41 ah, ok 2012-01-05T10:32:43 yeah 2012-01-05T10:32:50 http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibFormula.html#fiblong 2012-01-05T10:33:06 it said that it was so close that you didn't need the psi part :P 2012-01-05T10:33:26 cold be true 2012-01-05T10:33:29 i didnt bother 2012-01-05T10:33:54 btw i pasted the code here didnt i? 2012-01-05T10:34:02 yup 2012-01-05T10:34:08 ah ok 2012-01-05T10:34:18 hmm :/ 2012-01-05T10:34:24 this is weird that it doesn't work 2012-01-05T10:35:48 http://codepad.org/OYyCK3Ck 2012-01-05T10:36:26 :S 2012-01-05T10:36:33 i told you its an approximate formula 2012-01-05T10:36:42 yes 2012-01-05T10:36:47 it has the right "tendency" but it isnt correct 2012-01-05T10:37:01 so it should give me a someway correct answer 2012-01-05T10:37:16 this runs past 300000 with no answer.... 2012-01-05T10:37:46 lol 2012-01-05T10:38:06 it gets floating point exceptions most probably 2012-01-05T10:38:15 but I cast it? 2012-01-05T10:38:21 i could only get n=1200 in python 2012-01-05T10:38:50 pow(phi, i) 2012-01-05T10:38:58 i must be less than ~1200 2012-01-05T10:39:17 does it fail after that? 2012-01-05T10:39:22 ofc 2012-01-05T10:39:48 i mean your cmputation will fail 2012-01-05T10:39:59 you are passing nans back and forth 2012-01-05T10:40:16 sorry what? I'm not good at math 2012-01-05T10:40:27 NotaNumber 2012-01-05T10:40:33 floating point error code 2012-01-05T10:40:51 why would it fail after 1200? 2012-01-05T10:41:38 1.6^1200 2012-01-05T10:41:42 because you run out of precision 2012-01-05T10:42:01 sorry 2012-01-05T10:42:04 exponent 2012-01-05T10:42:16 precision just gets truncated 2012-01-05T10:42:35 ok 2012-01-05T10:42:41 still shouldn't affect the answer 2012-01-05T10:43:02 double can represent < 10^308 absolute valued numebers 2012-01-05T10:43:11 ? 2012-01-05T10:43:47 :( ok 2012-01-05T10:43:51 the cast to (int) becomes meaningless 2012-01-05T10:44:00 so does the < 1000 2012-01-05T10:44:35 ah, ofc log fails too 2012-01-05T10:44:42 its a clusterfuck, doesnt need more describing 2012-01-05T10:44:58 yeah, ok 2012-01-05T10:51:20 *** UncleVasya has joined #aichallenge 2012-01-05T10:55:10 *** Akranis has joined #aichallenge 2012-01-05T11:06:30 why do they not sell 5-hour energy in the cafe here :-/ 2012-01-05T11:09:08 *** dorisabayon has quit IRC (Ping timeout: 240 seconds) 2012-01-05T11:16:30 *** g0llum has quit IRC (Read error: Connection reset by peer) 2012-01-05T11:19:39 ahow984_: http://codepad.org/4ibhvtQE seems theres an isinf and isnan function 2012-01-05T11:20:00 i didnt know they existed, only knew about the x==x -> false for nan 2012-01-05T11:22:32 *** deathcorps has joined #aichallenge 2012-01-05T11:22:40 gotta love when your web host has a raid array lose 2 drives 2012-01-05T11:23:07 web site down forever... 2012-01-05T11:24:07 and then up with no mysql 2012-01-05T11:24:08 lol 2012-01-05T11:24:19 they are lucky it's not important 2012-01-05T11:26:47 *** u_ has joined #aichallenge 2012-01-05T11:27:47 *** u__ has joined #aichallenge 2012-01-05T11:28:51 *** Fandekasp has joined #aichallenge 2012-01-05T11:29:26 *** u_ has quit IRC (Read error: Operation timed out) 2012-01-05T11:29:26 *** u__ is now known as u_ 2012-01-05T11:33:24 *** treeform has joined #aichallenge 2012-01-05T11:59:03 *** raemde_ has joined #aichallenge 2012-01-05T12:01:02 mcstar: back now 2012-01-05T12:01:32 so PE 11 2012-01-05T12:01:34 so that says I can only have phi^1474? Anything higher then that is undefined with C++? 2012-01-05T12:01:38 does it mean it will take blocks? 2012-01-05T12:01:46 like not just straight lines 2012-01-05T12:02:06 rwest: only straight lines iirc 2012-01-05T12:02:08 *** raemde has quit IRC (Ping timeout: 252 seconds) 2012-01-05T12:02:22 should be clarified though 2012-01-05T12:02:29 well I did only straight lines and I didn't get it correct 2012-01-05T12:02:36 answer? 2012-01-05T12:02:43 51267216 2012-01-05T12:03:05 you're way out :/ 2012-01-05T12:03:11 did you check diagonals? 2012-01-05T12:03:14 yes\ 2012-01-05T12:03:31 maybe you've an off by one when you check near the edges? 2012-01-05T12:04:01 because I doubt I was smart enough to think of that but I still got the answer 2012-01-05T12:04:28 *** g0llum has joined #aichallenge 2012-01-05T12:04:31 I am pretty sure the any direction is simpler actually lol 2012-01-05T12:04:43 it's just a bfs to depth 4 2012-01-05T12:04:56 well not really a bfs 2012-01-05T12:04:58 *** McLeopold has left #aichallenge 2012-01-05T12:05:08 *** McLeopold has joined #aichallenge 2012-01-05T12:05:13 rwest: no, not at all ;) 2012-01-05T12:05:28 well you try everything at depth 4, largest value wins 2012-01-05T12:05:40 yes 2012-01-05T12:05:41 its like 10 lines heh\ 2012-01-05T12:05:47 but you only go in straight lines :P 2012-01-05T12:07:23 yes, that is why it is more complicated than the any direction one 2012-01-05T12:07:28 no limits on the any direction 2012-01-05T12:08:25 oh I know where I messed up 2012-01-05T12:16:30 *** treeform has quit IRC (Remote host closed the connection) 2012-01-05T12:16:57 *** treeform has joined #aichallenge 2012-01-05T12:17:09 *** lhb__ has joined #aichallenge 2012-01-05T12:18:02 ahow984_: there, got it 2012-01-05T12:18:16 :) 2012-01-05T12:18:21 what were you doing wrong? 2012-01-05T12:18:43 I was doing the diagonal wrong 2012-01-05T12:18:45 one of them 2012-01-05T12:19:02 ah 2012-01-05T12:19:06 *** JorgeB has quit IRC (Quit: Computer has gone to sleep.) 2012-01-05T12:19:12 I reversed 2 directions rather than one 2012-01-05T12:19:20 so i just did the same calculation from another corner 2012-01-05T12:19:21 lol 2012-01-05T12:19:43 heh, always something stupid 2012-01-05T12:19:50 @later tell amstan taking down the website again to look at cause of slowness 2012-01-05T12:19:50 McLeopold: As you wish. 2012-01-05T12:20:09 *** raemde_ has quit IRC (Ping timeout: 252 seconds) 2012-01-05T12:20:45 ahow984_: I am now just going in order of how many people have solved the problem 2012-01-05T12:21:02 I've been doing that too :) 2012-01-05T12:21:33 have you any idea how I can do problem 25? 2012-01-05T12:22:05 the problem is that phi^x where x>1474 fails :/ 2012-01-05T12:22:14 or something around 1474 2012-01-05T12:25:23 ahow984_: I used a bit int 2012-01-05T12:25:27 big int 2012-01-05T12:25:32 that I wrote in college 2012-01-05T12:25:57 hmm 2012-01-05T12:26:11 #13 is hilarious in tcl 2012-01-05T12:26:14 it's 2 lines 2012-01-05T12:26:23 add the numbers, print 2012-01-05T12:26:38 heh, yeah 2012-01-05T12:26:42 *** dorisabayon has joined #aichallenge 2012-01-05T12:26:49 look at the one about a 20*20 square and the paths through it 2012-01-05T12:26:53 *** treeform has quit IRC (Remote host closed the connection) 2012-01-05T12:27:16 15 2012-01-05T12:27:51 janzert: you around? 2012-01-05T12:28:04 ahow984_: what do they consider backtracking 2012-01-05T12:28:05 ? 2012-01-05T12:28:20 going left or up I imagine 2012-01-05T12:28:27 that's what I thought 2012-01-05T12:28:35 *** phillijw has quit IRC (Remote host closed the connection) 2012-01-05T12:28:51 *** phillijw has joined #aichallenge 2012-01-05T12:28:54 path finding should be a walk in the park after ants surely? 2012-01-05T12:29:21 was wondering about a mathematical solution 2012-01-05T12:29:31 but yes, you're right. It should be easy after ants 2012-01-05T12:29:49 you don't think bfs etc. haven't been derived mathematically? 2012-01-05T12:30:04 never thought about it 2012-01-05T12:30:06 it'd really be a dynamic programming problem yeah? 2012-01-05T12:30:11 *** Fandekasp has quit IRC (Ping timeout: 252 seconds) 2012-01-05T12:30:17 :P 2012-01-05T12:30:31 I would have thought there'd be a formula for it though 2012-01-05T12:30:41 there's an algorithm :P 2012-01-05T12:30:45 you usually learn them :P 2012-01-05T12:30:54 (i'm just being annoying now) 2012-01-05T12:31:37 I'm not the best of programmers or mathematicians 2012-01-05T12:31:45 so I don't know all this stuff :P 2012-01-05T12:32:09 yeah, i'm a terrible programmer :) 2012-01-05T12:32:19 i like to think i'm not too bad with the maths 2012-01-05T12:32:28 ahow984_: I think I can do 15 on paper 2012-01-05T12:32:41 antimatroid: I find it hard to believe that you're a bad programmer :P 2012-01-05T12:32:47 rwest: really? 2012-01-05T12:32:51 I'm trying now too 2012-01-05T12:32:54 oh nvm 2012-01-05T12:32:58 :P 2012-01-05T12:33:00 *** JorgeB has joined #aichallenge 2012-01-05T12:33:00 I could have 2012-01-05T12:33:06 bad in that I don't know many languages or how to use standard tools etc. 2012-01-05T12:33:06 *** GarfTop has joined #aichallenge 2012-01-05T12:33:09 if it was 18 2012-01-05T12:33:10 lol 2012-01-05T12:33:24 rwest: if you could do it for 18, why not 20? 2012-01-05T12:33:43 ahow984_: it's a mathematical patern 2012-01-05T12:33:45 pattern 2012-01-05T12:33:54 for 1 2 3 6 18 2012-01-05T12:33:58 err 2012-01-05T12:34:11 its like a binary tree, no? 2012-01-05T12:34:11 maybe one sec 2012-01-05T12:34:24 *** Garf has quit IRC (Ping timeout: 240 seconds) 2012-01-05T12:34:30 do you want some of the easier later problems? 2012-01-05T12:34:40 i can give you some of the ones i've solved which had neatish little tricks 2012-01-05T12:34:48 antimatroid: :) 2012-01-05T12:35:07 I'd like to try them first before I hear a hint though :P 2012-01-05T12:35:19 81-83 is more pathfinding 2012-01-05T12:35:43 85 is really easy once you see the trick 2012-01-05T12:36:26 :( rwest it's not a binary tree really :( 2012-01-05T12:37:10 :) I did 81 before pretty much 2012-01-05T12:37:17 i'm not sure which of the others i just brute forced or not 2012-01-05T12:37:30 205 is the highest numbered one i have solved, but i brute forced that with a tree 2012-01-05T12:37:43 except it could go diagonally up or down or straight right as long as it went right in some way shape or form 2012-01-05T12:38:09 i never did 83, i might do that now to make sure i am in fact smarter with path finding 2012-01-05T12:38:18 it seems pretty straight forward though 2012-01-05T12:38:36 interestingly, i have never been able to get 12 out 2012-01-05T12:38:42 i have only ever tried with c++ 2012-01-05T12:38:49 ahow984_: it's a binary tree minus last node on the right 2012-01-05T12:40:39 say it's 2 wide 2012-01-05T12:40:50 once you go right twice, you have no more splits 2012-01-05T12:41:29 yes 2012-01-05T12:42:54 @later tell amstan I would suggest turning off the tron website until the database can be fixed. It doesn't have indexes and keeps causing deadlocks. 2012-01-05T12:42:55 McLeopold: Yep. 2012-01-05T12:48:31 ahow984_: recursive answer is 8 lines 2012-01-05T12:48:40 and slow as balls lol 2012-01-05T12:48:44 *** GarfTop has quit IRC (Ping timeout: 240 seconds) 2012-01-05T12:48:49 :P 2012-01-05T12:48:52 how long? 2012-01-05T12:49:22 still going, I checked it against 1 2 and 3 width squares first 2012-01-05T12:49:30 @later tell amstan I've redirected tron.aichallenge.org to an empty directory to prevent the mysql queries from running. At some point, we need to add indexes to that database to prevent the issues. 2012-01-05T12:49:30 McLeopold: I think that worked... 2012-01-05T12:49:40 rwest: heh 2012-01-05T12:49:56 I hope php doesn't have a stack limit lol 2012-01-05T12:49:59 I'm not that good with recursion yet so I need to do more thinking 2012-01-05T12:50:05 php?!? -_- 2012-01-05T12:50:11 I love php hah 2012-01-05T12:50:21 I use more languages on a daily basis than most 2012-01-05T12:50:31 yeah, you must 2012-01-05T12:51:18 still going lol 2012-01-05T12:51:25 I should just start work on the next problem 2012-01-05T12:51:58 what was the answer for 3? 2012-01-05T12:54:37 20 2012-01-05T12:55:14 php running at 100% cpu 2012-01-05T12:55:17 taking forever still 2012-01-05T12:55:25 :/ 2012-01-05T12:59:49 rewrote in c 2012-01-05T12:59:54 maybe it will go faster heh 2012-01-05T13:00:25 lo 2012-01-05T13:00:27 *l 2012-01-05T13:00:32 trying recursion now :) 2012-01-05T13:02:36 http://codepad.org/yGeQylIw 2012-01-05T13:02:44 I'm missing the crucial part of recursion >_< 2012-01-05T13:02:45 McLeopold: am now 2012-01-05T13:04:12 ahow984_: what question is that for? 2012-01-05T13:04:22 15? :P 2012-01-05T13:04:50 I don't know how to do the bit where I have to return on lines 11 and 13 2012-01-05T13:04:54 whoops checked off run code, 2012-01-05T13:04:56 *** Katiska_ has quit IRC (Ping timeout: 240 seconds) 2012-01-05T13:05:01 http://codepad.org/hT0PRyKm 2012-01-05T13:05:20 *** ronchaine has quit IRC (Ping timeout: 240 seconds) 2012-01-05T13:05:45 I know I have to add something but I can't work it out :( 2012-01-05T13:05:49 ty for the code btw 2012-01-05T13:06:32 *** amstan has joined #aichallenge 2012-01-05T13:06:32 *** ChanServ sets mode: +o amstan 2012-01-05T13:06:57 rwest: you might optimize it by only doing it for half the tree, then doubling it? 2012-01-05T13:07:26 ahow984_: I am not sure that would work 2012-01-05T13:07:43 why not? 2012-01-05T13:07:49 it's a mirror image, no? 2012-01-05T13:10:04 oh I know why it's breaking 2012-01-05T13:10:07 overflow 2012-01-05T13:10:08 lol 2012-01-05T13:10:12 [rwest@rwest-pc 15]$ ./a.out 17 2012-01-05T13:10:12 -1961361076 2012-01-05T13:10:15 bleh 2012-01-05T13:10:25 at least I know now 2012-01-05T13:10:29 *** mleise has quit IRC (Read error: Connection reset by peer) 2012-01-05T13:10:37 wow, you wouldn't have thought there'd be so man paths :P 2012-01-05T13:10:41 *** Katiska has joined #aichallenge 2012-01-05T13:11:07 yea 2012-01-05T13:11:08 *** thestinger has joined #aichallenge 2012-01-05T13:16:07 rwest: you got an answer yet? 2012-01-05T13:17:32 *** treeform has joined #aichallenge 2012-01-05T13:20:26 janzert: I saw you were on the archive server 2012-01-05T13:23:31 ahow984_: no, and I think it may be outside a long long 2012-01-05T13:23:46 I really find that hard to believe tbh :/ 2012-01-05T13:24:11 I have no answer after 12 mins :( 2012-01-05T13:24:30 if there was an overflow, I should have at least gotten something 2012-01-05T13:24:41 oh it's still calculating too hah 2012-01-05T13:24:47 17 took like 30s 2012-01-05T13:25:01 and before that it was < 2s 2012-01-05T13:25:04 I think running it for half the tree and *'ing by 2 should work 2012-01-05T13:25:07 so it's growing fast 2012-01-05T13:25:18 exponentially, no? 2012-01-05T13:25:35 I don't think you can do half the tree 2012-01-05T13:25:37 I thought everything with recursion was exponential but I don't know much about recursion :P 2012-01-05T13:25:46 why not? 2012-01-05T13:25:58 or maybe 2012-01-05T13:26:04 anyway, one sec, gotta go talk to somebody 2012-01-05T13:26:08 kk 2012-01-05T13:26:13 McLeopold: ahh, yeah. I've got a few ssh consoles open to it 2012-01-05T13:26:39 got 83 out 2012-01-05T13:26:46 :) 2012-01-05T13:27:11 i earnt 3 new awards with one problem ehe 2012-01-05T13:27:24 i think that's just cause they changed stuff since i last did a problem 2012-01-05T13:27:26 heh, which ones? 2012-01-05T13:27:46 http://pastebin.com/BVr5gA4k 2012-01-05T13:29:17 heh 2012-01-05T13:29:22 pastebins down btw 2012-01-05T13:29:45 heh 2012-01-05T13:29:46 but you're the only one between me, mcstar, rwest who's past level 0 :P 2012-01-05T13:29:50 worked for me when i pasted it 2012-01-05T13:30:07 where's rwest? 2012-01-05T13:30:15 sigh has solved over 200 i think 2012-01-05T13:30:22 :O 2012-01-05T13:30:23 wow 2012-01-05T13:30:34 euler? 2012-01-05T13:30:36 these problems are really difficult IMO 2012-01-05T13:30:38 yeah 2012-01-05T13:30:38 thestinger: yes 2012-01-05T13:30:56 I meant to do some yesterday but didn't get around to it :P 2012-01-05T13:30:59 ahow984_: how old are you and how much uni level maths have you taken? 2012-01-05T13:31:00 heh 2012-01-05T13:31:08 antimatroid: ahhh 2012-01-05T13:31:09 thestinger: i just did my first problem in ages 2012-01-05T13:31:15 yeah, that would be the problem 2012-01-05T13:31:16 it's 5:30am though so that might have to do for the moment 2012-01-05T13:31:21 yeah, I did it when I learned to program around a year and a half ago 2012-01-05T13:31:28 haven't gone there since then 2012-01-05T13:31:29 I'm in high school antimatroid 2012-01-05T13:31:31 ;) 2012-01-05T13:31:43 then you're well ahead of the pack 2012-01-05T13:32:00 although i can't shake thinking of high school as years 7-10 2012-01-05T13:32:07 despite knowing most people think of it as 9-12 2012-01-05T13:32:13 what ages? 2012-01-05T13:32:27 I'm not in the USA, I just say high school because people understand that 2012-01-05T13:32:44 dunno, 13-16 or something like that 2012-01-05T13:32:49 yeah, 16 2012-01-05T13:32:54 thats me :P 2012-01-05T13:32:59 i'm 23 :P 2012-01-05T13:33:05 starting a phd on tuesday 2012-01-05T13:33:09 heh, I've lots of math to do 2012-01-05T13:33:24 antimatroid: nice, you got the money you needed or whatever? 2012-01-05T13:33:25 :O a phd at 23! (it rhymes and it's impressive ;) ) 2012-01-05T13:33:43 thestinger: yeah :D 2012-01-05T13:33:59 one of my friends who did almost the same uni stuff is a couple of years younger 2012-01-05T13:34:00 wow, whats your phd on? 2012-01-05T13:34:02 I think I'll do euler in haskell this time 2012-01-05T13:34:04 he started uni at like 15 :| 2012-01-05T13:34:10 :O 2012-01-05T13:34:13 abstract algebra 2012-01-05T13:34:17 how can you start uni at 15 lol? 2012-01-05T13:34:24 be very very smart 2012-01-05T13:34:29 o.O way over my head antimatroid 2012-01-05T13:34:42 yes, he must be ridiculously smart 2012-01-05T13:35:04 he's hoping to trot off to oxford in september, so that should say something :P 2012-01-05T13:35:10 haha 2012-01-05T13:35:14 posh boy ;) 2012-01-05T13:35:20 that depends on whether he gets government scholarships or not though 2012-01-05T13:35:25 still in the commonwealth though :P 2012-01-05T13:35:29 nah, at the postgrad level you get funded 2012-01-05T13:35:37 you don't pay to do postgrad 2012-01-05T13:35:39 he hasn't made it until he breaks out of the commonwealth 2012-01-05T13:35:46 keep him down ;) 2012-01-05T13:35:47 jk jk 2012-01-05T13:36:00 44273678399628386481786757309612932850802339603213072163061741725120973071261214465564546964061501274455811504599002677243323198389556746177467924482712619295619407637796173406712775463566918150997667640956118068948089134372650249914155008 2012-01-05T13:36:04 thats prbably not right 2012-01-05T13:36:06 :O 2012-01-05T13:36:10 hehe 2012-01-05T13:36:11 wtf is that for lol? 2012-01-05T13:36:21 my superfunctional solution to 15 2012-01-05T13:36:22 pe problem i'm guessing 2012-01-05T13:36:31 :P mcstar 2012-01-05T13:36:37 how long did it take to run? 2012-01-05T13:36:42 instant 2012-01-05T13:36:59 im not walking the damn graph 2012-01-05T13:37:02 haha 2012-01-05T13:37:04 but i mess up something 2012-01-05T13:37:26 I was certain you could do it with math, but I still can't find out how >_< 2012-01-05T13:37:28 that one is actually easier than you probably think it is 2012-01-05T13:37:31 you can do it on paper 2012-01-05T13:37:40 I tried :( 2012-01-05T13:37:44 just do a few tiny ones (1x1, 2x2, 3x3) and you'll get it 2012-01-05T13:38:34 theres no fun in doing it on paper 2012-01-05T13:38:39 do it on paper? 2012-01-05T13:38:44 the answer is quite large 2012-01-05T13:38:49 it is a counting problem though 2012-01-05T13:38:51 but if you want to do it in a functinal way, its challenging 2012-01-05T13:39:07 (no mutable updates) 2012-01-05T13:39:26 let me sort this out 2012-01-05T13:39:57 i didnt even test it for 2x2 2012-01-05T13:39:59 lol 2012-01-05T13:40:08 just wrote it, typechecker said ok, so i tried it 2012-01-05T13:40:14 lol, I wonder which one I should start with 2012-01-05T13:40:18 I skipped some that I was too lazy to do 2012-01-05T13:41:09 thestinger: I've got some data now 2012-01-05T13:41:19 I'll try to find a relationship ;) 2012-01-05T13:41:25 bbiab lol 2012-01-05T13:42:01 hah 2012-01-05T13:42:07 gives 4 for 2x2 2012-01-05T13:42:22 man, i need a relationship too 2012-01-05T13:42:42 my solution is 1 function call, something I had coded before :P 2012-01-05T13:43:30 ugh.. I don't want to parse text 2012-01-05T13:43:34 I'll just use a vim macro 2012-01-05T13:43:43 yeah i hate having to strip commas 2012-01-05T13:44:15 or add them :P 2012-01-05T13:44:43 well when you have like "123,3453,3445" what's the easiest way to read that into a vector of ints in c++? 2012-01-05T13:45:45 std::vector v = {123,3453,3445}; 2012-01-05T13:45:51 use C++11, don't torture yourself 2012-01-05T13:46:06 the text is in an input file stream 2012-01-05T13:46:25 well 2012-01-05T13:46:35 in python I'd just .split(",") 2012-01-05T13:46:42 and map(int, whatever) 2012-01-05T13:46:56 i guess write split then 2012-01-05T13:47:04 i wrote join for my game theory library 2012-01-05T13:47:29 boost::split 2012-01-05T13:47:42 bah c++ :( 2012-01-05T13:47:50 i don't like having to install extra crap 2012-01-05T13:48:00 boost is header only though 2012-01-05T13:48:02 might as well 2012-01-05T13:48:18 ahow984_: 64 bit integer overflowed 2012-01-05T13:48:51 ugh, I forgot I had to fix these numbers starting with 0 2012-01-05T13:49:22 time for a 3rd rewrite 2012-01-05T13:49:24 now tcl 2012-01-05T13:50:10 yay for regex 2012-01-05T13:50:12 *** pairofdice has joined #aichallenge 2012-01-05T13:51:24 meh, I'll just do this in py3 instead of haskell 2012-01-05T13:51:30 *** Anilm3 has joined #aichallenge 2012-01-05T13:51:44 have you guys tried ipython? 2012-01-05T13:51:52 amstan: it sucks, use bpython 2012-01-05T13:51:56 it's meant as a general purpose shell apparently 2012-01-05T13:52:01 bpython? 2012-01-05T13:52:04 ipython is only good if you're actually using scipy/matplotlib 2012-01-05T13:52:21 amstan: http://bpython-interpreter.org/ 2012-01-05T13:52:38 Hi 2012-01-05T13:52:48 bpython (py3) and bpython2 are in my distro's repos anyway 2012-01-05T13:52:58 oh man, apt-get is so painfully slow 2012-01-05T13:53:02 amstan: it's much nicer than ipython, and not super bloated/buggy 2012-01-05T13:53:15 thestinger: i can't do ls 2012-01-05T13:53:42 well, ipython adds aliases by default 2012-01-05T13:53:51 for all the commands it finds in PATH 2012-01-05T13:53:55 ok, so how do i use this as a shell 2012-01-05T13:53:57 bpython is for python devel 2012-01-05T13:53:59 oh 2012-01-05T13:54:04 didn't realize you wanted that :P 2012-01-05T13:54:06 just use zsh 2012-01-05T13:54:11 yeah, that's what intrigued me 2012-01-05T13:54:15 ipython is meh as a shell 2012-01-05T13:54:22 they just add aliases by default 2012-01-05T13:54:27 i can do stuff like this: alex=!sudo apt-get something 2012-01-05T13:54:37 and alex will contain a list of lines that apt-get outputed on stdout 2012-01-05T13:54:46 yeah, but you could just make a p() function 2012-01-05T13:55:03 and alex=p("grep blabla . -R") 2012-01-05T13:55:11 rwest: 64-bit int or 64-bit long? 2012-01-05T13:55:12 just a bit of syntactic sugar 2012-01-05T13:55:13 what's wrong with good old bash? 2012-01-05T13:55:19 Anilm3: bash sucks 2012-01-05T13:55:23 crappy autocompletion 2012-01-05T13:55:24 :( 2012-01-05T13:55:29 idk, i'm experimenting with different shells 2012-01-05T13:55:36 zsh is awesome, once you configure it 2012-01-05T13:55:38 I'm hoping unsigned long long will hold it, but if it's anything near what mcstar pasted, I'm screwed 2012-01-05T13:55:45 i switched to zsh for now, but in some cases autocomplete fails where in bash it would have worked 2012-01-05T13:55:56 amstan: you have to configure it :) 2012-01-05T13:56:04 also, what distro do you use? 2012-01-05T13:56:05 for ex: sudo chsh -s /bin/ doesn't work 2012-01-05T13:56:09 ubuntu and arch 2012-01-05T13:56:17 on either... 2012-01-05T13:56:28 do you have the sudo alias? 2012-01-05T13:56:31 for completion with sudo 2012-01-05T13:56:36 yes 2012-01-05T13:56:51 I have to learn python... 2012-01-05T13:56:59 killall autocomplete doesn't work either 2012-01-05T13:56:59 ahow984_: unsigned long only holding an integer 2012-01-05T13:57:02 Anilm3: me too 2012-01-05T13:57:03 amstan: sec 2012-01-05T13:57:17 rwest: ... what? that makes no sense 2012-01-05T13:57:56 thestinger: I'm still struggling to find the math solution :P 2012-01-05T13:58:44 ahow984_: http://sprunge.us/QHZK 2012-01-05T13:58:47 oops 2012-01-05T13:58:49 amstan: http://sprunge.us/QHZK 2012-01-05T13:59:16 the two processes lines get you completion for pkill, kill, etc. 2012-01-05T13:59:37 how does bash handle all of those completes? 2012-01-05T13:59:52 i noticed there's a bash-completion.d in my /etc 2012-01-05T13:59:57 can't zsh use that? 2012-01-05T14:00:05 yes, it has compatibility with that 2012-01-05T14:00:08 but you don't need it 2012-01-05T14:00:17 it will mostly make things worse 2012-01-05T14:00:24 so why doesn't it use that already? there might be things in there i missed 2012-01-05T14:00:48 http://sprunge.us/QHZK <- just try that in zshrc 2012-01-05T14:00:56 I think the process completion needs to be turned on like that 2012-01-05T14:01:38 some packages come with their own completion functions 2012-01-05T14:01:43 like pacman 2012-01-05T14:01:56 pacman has files for both zsh and bash (the zsh one completes more) 2012-01-05T14:02:37 anyway, lots are missing zsh completion functions 2012-01-05T14:03:03 yeah, this is better 2012-01-05T14:03:07 *** racko has joined #aichallenge 2012-01-05T14:03:10 than what i had before 2012-01-05T14:03:20 I like the list then menu complete 2012-01-05T14:03:33 list when ambiguous, and tab/shift-tab to cycle forwards/backwards 2012-01-05T14:03:36 and you can use arrows 2012-01-05T14:03:40 but it would be nice to use the bash ones for commands i'm missing 2012-01-05T14:04:03 if [[ -n $terminfo[kcbt] ]]; then 2012-01-05T14:04:05 bindkey "$terminfo[kcbt]" reverse-menu-complete 2012-01-05T14:04:07 fi 2012-01-05T14:04:09 you might need that for shift-tab 2012-01-05T14:04:21 anyway I forget how to fall back to bash/ksh completion 2012-01-05T14:04:56 oh, found it 2012-01-05T14:05:01 _bash_completions 2012-01-05T14:05:02 once i start that menu for autocompletion, how can i cancel it? 2012-01-05T14:05:21 as in.. delete everything that was autocompleted so far 2012-01-05T14:05:52 I've changed all my bindings so... sec 2012-01-05T14:06:00 amstan: I heard rumors about an asteroids game for the next challenge 2012-01-05T14:06:04 how serious is it? 2012-01-05T14:06:15 amstan: ctrl-C should work 2012-01-05T14:06:22 It will eat your babies, Anilm3 2012-01-05T14:06:28 Anilm3: i'm just playing with pyqt, see repo for more details 2012-01-05T14:06:39 Anilm3: it could be anything though 2012-01-05T14:07:09 thestinger: hmm, that works, thanks 2012-01-05T14:07:21 thestinger: one more thing: do you use git prompt? 2012-01-05T14:07:32 nope, my prompt is pretty basic 2012-01-05T14:07:37 darn 2012-01-05T14:07:42 strcat@arch i ~/projects % 2012-01-05T14:07:55 i turns to c when I'm in command mode 2012-01-05T14:07:58 that's it 2012-01-05T14:08:01 there's this funky thing i'm getting for a repo in an sshfs mount 2012-01-05T14:08:18 i might try r/zsh to fix it 2012-01-05T14:08:23 rwest: you got it yet? :P 2012-01-05T14:09:11 thestinger: right.. how do i use that _bash_completions thing? 2012-01-05T14:09:39 trying to figure that out :P 2012-01-05T14:09:53 it already autocompletes for my apt-get somehow 2012-01-05T14:09:57 so it might already work 2012-01-05T14:10:02 that probably comes with zsh 2012-01-05T14:10:04 same with git 2012-01-05T14:10:19 /usr/share/zsh/functions/Completion 2012-01-05T14:10:23 amstan: interesting 2012-01-05T14:10:26 that's where all the completion files are 2012-01-05T14:10:39 and there's /usr/share/zsh/site-functions for stuff like pacman that doesn't ship with zsh 2012-01-05T14:11:08 thestinger: interesting 2012-01-05T14:11:10 anyway, there's no _chsh 2012-01-05T14:11:16 well.. it seems fine for now 2012-01-05T14:11:31 i don't think i'm missing anything on the completion front now 2012-01-05T14:12:13 amstan: http://sprunge.us/QKfP 2012-01-05T14:12:16 another weird thing i'm having is that the history command only outputs 16 lines 2012-01-05T14:12:17 the man page says you can add that 2012-01-05T14:12:31 so I guess ctrl-X will do bash completion 2012-01-05T14:12:40 not sure what \e is... 2012-01-05T14:12:50 tab? 2012-01-05T14:13:04 I think tab is ^I 2012-01-05T14:13:16 btw, ctrl-H is the same as backspace almost everywhere 2012-01-05T14:13:19 computers are weird :) 2012-01-05T14:14:10 amstan: oh, and it says to add that loop after compinit 2012-01-05T14:14:21 'man zshall' has everything but... it's huge 2012-01-05T14:14:33 that's fine, i don't think i want another key combo for bash completion 2012-01-05T14:14:41 i'll just use what zsh has 2012-01-05T14:14:48 yeah, it mostly has everyone 2012-01-05T14:14:55 the version on ubuntu is probably a bit older 2012-01-05T14:15:09 and they add new completion functions (and fix them) frequently 2012-01-05T14:15:11 4.3.11 2012-01-05T14:15:34 Arch has 4.3.15 2012-01-05T14:15:55 http://zsh.sourceforge.net/News/ 2012-01-05T14:16:06 so yeah, probably some broken stuff for completion on your Ubuntu install 2012-01-05T14:16:15 any idea why i only get the last 16 commands outputted by `history`? https://github.com/amstan/configs/blob/master/.zshrc#L54 2012-01-05T14:17:08 amstan: I think that's just how history works by default 2012-01-05T14:17:11 it works like tail 2012-01-05T14:17:14 history -50 2012-01-05T14:17:17 darn 2012-01-05T14:17:25 probably a way to set the default 2012-01-05T14:17:28 i do history|grep something a lot of the time 2012-01-05T14:17:40 are you mostly looking for what a command starts with? 2012-01-05T14:17:48 not necessarly 2012-01-05T14:17:57 any kind of substring searches 2012-01-05T14:18:07 i know i can use ! for startswith 2012-01-05T14:18:54 well, I have up/down bound to history search stuff 2012-01-05T14:19:06 so if I've typed something, they search for commands starting with that string 2012-01-05T14:19:21 and then I use the actual search to look for something 2012-01-05T14:19:35 *** X-Scale has joined #aichallenge 2012-01-05T14:19:37 with vi keybinding mode you just go to command mode and hit / like vi/vim 2012-01-05T14:20:29 amstan: try ctrl-R 2012-01-05T14:20:37 history-incremental-search-backward (^R ^Xr) (unbound) (unbound) 2012-01-05T14:20:41 hmm, it seems that i can do "history 1" to start from the beggining 2012-01-05T14:20:45 darnest damn 2012-01-05T14:20:47 success 2012-01-05T14:21:11 man, i love Debug.Trace 2012-01-05T14:22:44 #15 http://codepad.org/OMzVDZXy 2012-01-05T14:22:56 thestinger: can i see yours? 2012-01-05T14:23:15 print(binomial(2*20, 20)) 2012-01-05T14:23:20 :) 2012-01-05T14:23:21 no 2012-01-05T14:23:24 no real solution? 2012-01-05T14:23:29 *** dorisabayon has quit IRC (Ping timeout: 240 seconds) 2012-01-05T14:23:39 well, it's n choose k (pascal's triangle) 2012-01-05T14:23:53 well, binomial coefficient is the proper name 2012-01-05T14:24:05 i know what that is 2012-01-05T14:24:30 well, you want to see the code? it's boring since I just used python 2012-01-05T14:24:31 the point is thats not programmatical solution 2012-01-05T14:24:44 I have a brute force one too 2012-01-05T14:24:53 how much brute force? 2012-01-05T14:25:30 well, I ended up filling a data structure with all the numbers 2012-01-05T14:25:54 eventually I went back and redid some of them and I realized I was just doing pascal's triangle crap manually 2012-01-05T14:26:03 yeah 2012-01-05T14:26:25 anyway, I have some useful functions now like n_partitions, binomial, etc. 2012-01-05T14:26:26 well, it was a challenge for me, cause i can "collapse" graphs now immutably 2012-01-05T14:26:43 im not sure how clear that is from the code 2012-01-05T14:27:21 I usually start with brute force, and it works most of the time 2012-01-05T14:27:22 *** amstan_ has joined #aichallenge 2012-01-05T14:27:22 *** ChanServ sets mode: +o amstan_ 2012-01-05T14:27:28 but then I want to figure out how to do it "properly" 2012-01-05T14:27:46 thestinger: i'm very happy with arch, everything is faster: booting, pacman, wireless 2012-01-05T14:27:48 i consider mine somewhere inbetween 2012-01-05T14:28:00 and it is useful, when the graph isnt this nice 2012-01-05T14:28:12 amstan_: WELCOME 2012-01-05T14:28:12 amstan_: rolling release is really nice too 2012-01-05T14:28:22 thestinger: yes 2012-01-05T14:28:32 i'm switching my desktop and my server soon 2012-01-05T14:28:36 yay 2012-01-05T14:28:43 Anilm3: so.. asteroids... 2012-01-05T14:28:56 i have a feeling, everyone will convert for 3000 2012-01-05T14:29:05 amstan_: I also find it very stable compared to ubuntu/debian, now that I've been using it for a long time 2012-01-05T14:29:06 what do people think: https://github.com/aichallenge/aichallenge/tree/amstan-asteroids 2012-01-05T14:29:30 even amarok is faster somehow... 2012-01-05T14:29:34 dpkg tries to do so much magic with post-install stuff, like choosing alternate packages to provide stuff 2012-01-05T14:29:40 the kubuntu maintainers are doing something wrong 2012-01-05T14:29:51 amstan_: well, KDE is supposed to be really good on Arch (I don't use it though) 2012-01-05T14:29:59 thestinger: why? 2012-01-05T14:30:02 thestinger: i can attest to that 2012-01-05T14:30:06 they don't patch everything 2012-01-05T14:30:13 it is vanilla 2012-01-05T14:30:17 afaik 2012-01-05T14:30:18 if something is broken they might write a patch, but the Arch policy is to submit that all upstream 2012-01-05T14:30:23 if they reject a patch, it won't be used 2012-01-05T14:30:32 if they ignore the bug report, it might be used if it actually fixes something 2012-01-05T14:30:40 mcstar: it's vanilla and fast, somehow in kubuntu everything gets broken somehow 2012-01-05T14:30:41 debian has like 60 patches applied to each thing 2012-01-05T14:30:56 because they're trying to keep using some ancient version and backport bug fixes and even features 2012-01-05T14:31:02 like every update kubuntu just refuses to go to sleep from the kde stuff, i have to do pm-suspend from sudo 2012-01-05T14:31:25 broken dbus? or policykit? 2012-01-05T14:31:37 maybe, no idea 2012-01-05T14:31:45 you can actually suspend with pm-utils 2012-01-05T14:31:50 echo mem > /sys/power/state 2012-01-05T14:31:59 i do sudo init 0 every night 2012-01-05T14:32:15 thestinger: yes, but i want to use kshutdown for a timed sleep when i'm watching movies 2012-01-05T14:32:23 amstan_: ah 2012-01-05T14:32:26 and 30% of the time i find my computer running in the morning 2012-01-05T14:33:33 cant xbmc shut it down? 2012-01-05T14:33:39 i use vlc 2012-01-05T14:33:45 anyway.. asteroids: https://github.com/aichallenge/aichallenge/tree/amstan-asteroids 2012-01-05T14:33:48 has anyone tried it? 2012-01-05T14:33:51 once i was watching movies from bed, with remote control 2012-01-05T14:34:01 amstan_: try xbmc, really nice 2012-01-05T14:34:08 should be even nicer by now 2012-01-05T14:34:15 i don't like the fact that it tries to index all my media 2012-01-05T14:34:16 amstan_: i did clone it yesterday 2012-01-05T14:34:35 actually, i downloaded a zip 2012-01-05T14:34:44 how can a clone a branch with git? 2012-01-05T14:35:14 amstan_, tried it. setRotation was not found, qt version problem i guess. 2012-01-05T14:35:17 amstan_: try smplayer 2012-01-05T14:35:23 g0llum: maybe 2012-01-05T14:35:25 it's mplayer with a nice Qt frontend 2012-01-05T14:35:30 nicer than vlc 2012-01-05T14:35:35 mcstar: clone normally then git checkout branchname 2012-01-05T14:35:53 aham 2012-01-05T14:36:01 makes sense 2012-01-05T14:36:06 thestinger: i can't throw everything at it though, i sometimes use vlc with youtube too 2012-01-05T14:36:07 im still bad with git though 2012-01-05T14:36:28 seems like aerique has made a lot more progress: https://github.com/aerique/aichallenge/tree/asteroids/asteroids#readme 2012-01-05T14:36:45 amstan_: youtube-viewer :) 2012-01-05T14:36:49 aerique: you should probably get commit access to the main repo already 2012-01-05T14:36:51 thestinger: minitube 2012-01-05T14:36:58 flash keeps crashing for me 2012-01-05T14:37:09 on Arch? 2012-01-05T14:37:11 nvidia driver? 2012-01-05T14:37:12 yep 2012-01-05T14:37:22 nouveau/nvidia doesnt matter 2012-01-05T14:37:23 flash is flash, lol 2012-01-05T14:37:35 mcstar: flashplugin from [extra], right? 2012-01-05T14:37:40 you might have to turn off hardware accel 2012-01-05T14:37:59 /etc/adobe/mms.cfg iirc 2012-01-05T14:38:10 I think it's borked on x86_64 2012-01-05T14:38:12 doesnt matter 2012-01-05T14:38:17 my card doesnt support it 2012-01-05T14:38:22 7050 2012-01-05T14:38:23 ah 2012-01-05T14:38:29 integrated 2012-01-05T14:38:37 my 9400 just died 2012-01-05T14:38:55 my HD5870 just died... luckily it was on warranty 2012-01-05T14:39:04 now I have to wait forever for them to send a new one 2012-01-05T14:39:18 why amd? 2012-01-05T14:39:42 the nvidia cards were crap at the time I bought it 2012-01-05T14:39:47 4xx had just come out, iirc 2012-01-05T14:39:49 and it was awful 2012-01-05T14:40:17 anyway, using a crappy old geforce 9300GE atm until I get it back 2012-01-05T14:40:25 i had bad experience with catalyst, on linux, so im staying away from it 2012-01-05T14:40:43 (unfounded by now, probably) 2012-01-05T14:40:45 I use the open-source driver on linux 2012-01-05T14:40:51 aerique: how can i run a game? 2012-01-05T14:41:08 mcstar: I only really use the card when I occasionally boot into windows to do gaming (which is rare) 2012-01-05T14:41:11 thestinger: anyway, do you proceed with haskell? 2012-01-05T14:41:42 (do you keep learning it, or you know enoguh....) 2012-01-05T14:41:50 I still need to learn more 2012-01-05T14:41:55 lots to learn 2012-01-05T14:42:06 haven't really used it for a while though 2012-01-05T14:42:14 I'm just lazy and use python for everything 2012-01-05T14:42:24 *** UncleVasya has quit IRC (Read error: Connection reset by peer) 2012-01-05T14:42:59 i used an applicative functor in my previous pe problem :) 2012-01-05T14:43:14 aw crap, I screwed up this solution completely 2012-01-05T14:43:26 *** UncleVasya has joined #aichallenge 2012-01-05T14:43:32 which one? 2012-01-05T14:43:40 18, it's easy 2012-01-05T14:43:40 whats the next problem btw? 2012-01-05T14:43:44 ok 2012-01-05T14:43:45 amstan_: can you take the tron database out of readonly mode? 2012-01-05T14:43:47 but I think my vim macro screwed up 2012-01-05T14:44:25 anyway, I didn't feel like making a proper data structure so I just made a function to find the sum of a path, and I'll just call it for each possible path (assigned ints to them basically) 2012-01-05T14:44:57 Sorry, but the answer you gave appears to be incorrect. 2012-01-05T14:44:59 :( 2012-01-05T14:46:06 aw crap, I screwed up division somehow 2012-01-05T14:46:08 Oh, that one. You're doing it wrong ;) 2012-01-05T14:46:16 I should have done it the proper way :P 2012-01-05T14:46:29 *** Accoun has quit IRC () 2012-01-05T14:46:33 McLeopold: i used this: http://dev.mysql.com/doc/refman/5.0/en/myisampack.html 2012-01-05T14:46:54 pairofdice: yeah, I should be doing a tree search 2012-01-05T14:46:59 No no 2012-01-05T14:47:14 well... let me figure it out then :P 2012-01-05T14:47:22 I will :) 2012-01-05T14:47:31 oh wow, I'm an idiot 2012-01-05T14:47:33 I got the right answer 2012-01-05T14:47:38 *** amstan_ has quit IRC (Ping timeout: 240 seconds) 2012-01-05T14:47:42 I put the answer in the confirmation code box and vice versa 2012-01-05T14:47:46 :D 2012-01-05T14:48:14 amstan: where is this server? is it your own? how much memory? how much disk space? 2012-01-05T14:48:28 McLeopold: janzert set it up 2012-01-05T14:48:33 where is it? 2012-01-05T14:48:38 not sure 2012-01-05T14:48:52 till now we didn't have problems serving those websites, not sure what's going on 2012-01-05T14:49:03 seems easy enough... 2012-01-05T14:49:10 anyway, 169ms in python3 2012-01-05T14:49:12 I think crawlers are finally finding tron 2012-01-05T14:49:27 thestinger: did you just sum them up from the bottom 2012-01-05T14:49:36 top... 2012-01-05T14:49:43 Well, you can do that too 2012-01-05T14:49:50 Not much different 2012-01-05T14:50:18 yeah, it's just a few lines of code 2012-01-05T14:50:58 most of the work was done by the vim macro to turn their crappy triangle into a tuple of tuples 2012-01-05T14:51:47 thestinger: you might consider reading from a file instead of manipulating in vim 2012-01-05T14:51:55 thestinger: does it scale well? 2012-01-05T14:52:00 mcstar: not sure 2012-01-05T14:52:07 I basically just have a function that turns an int into a path 2012-01-05T14:52:09 then you can start to just copy and paste euler variables into files and read them in 2012-01-05T14:52:10 so I call it for each path 2012-01-05T14:52:44 if the int is odd, it goes left, otherwise right, etc. 2012-01-05T14:53:06 IIRC mine picked the larger of two to sum up with the upper level 2012-01-05T14:53:37 wow, there are some really elegant solutions in the forums 2012-01-05T14:53:50 zipWith 2012-01-05T14:54:27 looks like everyone brute-forced it anyway :P 2012-01-05T14:54:52 what the hell? one guy used the boost graph library... 2012-01-05T14:55:03 Uhh 2012-01-05T14:55:23 he just used negative costs 2012-01-05T14:56:12 anyway, time to try out the bigger version of 18 2012-01-05T14:56:29 http://projecteuler.net/project/triangle.txt o_o 2012-01-05T14:56:51 pretty sure it will be faster to read this one in :P 2012-01-05T14:57:03 Oh damnit. I haven't done that and I've lost the script I did 18 with 2012-01-05T14:57:21 Oh wait 2012-01-05T14:57:23 , Yes I have 2012-01-05T14:57:30 after I do a problem I look for the similar ones, with this they were nice enough to give a link 2012-01-05T14:57:43 my solution often isn't good enough for the bigger/harder problem 2012-01-05T14:58:02 ahow984_: you figure out the mathematical trick to 15? My tcl script still didn't finish hah 2012-01-05T14:58:04 I used the same script for both 2012-01-05T14:58:23 rwest: https://en.wikipedia.org/wiki/Pascal%27s_triangle 2012-01-05T14:58:55 pairofdice: it was fast enough? 2012-01-05T14:58:57 did you sum every path? 2012-01-05T14:59:00 No searching involved, I go once through the triangle and the answer's at the top 2012-01-05T14:59:23 Not saying more than that 2012-01-05T14:59:32 well, I'm going to do a tree search :P 2012-01-05T14:59:39 but first I want to see how long this brute force takes 2012-01-05T14:59:49 McLeopold: do we care about small issues about epsilon/ants? 2012-01-05T14:59:55 brute force in tcl over an hour 2012-01-05T15:00:03 rwest: for 15? 2012-01-05T15:00:06 yea 2012-01-05T15:00:07 haha 2012-01-05T15:00:16 tcl is slow 2012-01-05T15:00:17 haha 2012-01-05T15:00:22 I did brute force in python3, and it took around a second 2012-01-05T15:00:36 I just calculated all the triangle numbers and had them in a data structure 2012-01-05T15:00:37 And here I was thinking my methods were all brute force 2012-01-05T15:00:41 I guess that's dynamic programming? 2012-01-05T15:00:45 thestinger: not the triangle 2012-01-05T15:00:47 anyway, then I just wrote a binomial coefficient function 2012-01-05T15:00:51 rwest: I know 2012-01-05T15:00:55 I did every path, recursively 2012-01-05T15:00:56 the one with the # of maths 2012-01-05T15:01:01 that's an n choose k problem 2012-01-05T15:01:08 divide and conquer 2012-01-05T15:01:09 the numbers are the same as pascal's triangle 2012-01-05T15:01:10 lol 2012-01-05T15:01:13 I didn't realize that 2012-01-05T15:01:17 so I was doing it manually 2012-01-05T15:01:25 *** Accoun has joined #aichallenge 2012-01-05T15:01:27 and then when I went back and optimized, I realized what the problem way to do it was 2012-01-05T15:01:35 I think there was a similar problem and I had to optimize it 2012-01-05T15:01:45 My solution for the big triangle took less than 100ms IIRC 2012-01-05T15:01:57 anyway, it's just 2*20 choose 20 2012-01-05T15:02:51 tcl script finished 2012-01-05T15:02:51 http://sprunge.us/hEfA in haskell I ended up with that 2012-01-05T15:02:52 done lol 2012-01-05T15:03:08 much faster than just copying the algorithm directly 2012-01-05T15:03:34 I forget which problem I needed that for... 2012-01-05T15:03:37 it had to be really fast 2012-01-05T15:03:55 the normal recursive or factorial algorithms didn't work 2012-01-05T15:04:33 anyway iirc, it was an iterative solution and I turned it into that 2012-01-05T15:04:53 20? 2012-01-05T15:05:09 *** Fandekasp has joined #aichallenge 2012-01-05T15:05:12 no 2012-01-05T15:05:16 all the n choose k ones 2012-01-05T15:05:20 there are lots :P 2012-01-05T15:05:52 looks like I just did brute force for pretty much all the first 30 problems 2012-01-05T15:05:54 in python... 2012-01-05T15:07:11 hmm 2012-01-05T15:07:18 that would be a great anti spam measure for the forums 2012-01-05T15:07:35 only allow posting after you uploaded a submission 2012-01-05T15:07:57 it could be made harder by not counting starter bots 2012-01-05T15:08:00 spammers are pretty smart :P 2012-01-05T15:08:10 so then the spammers would have to actually compete in the contest in order to post spam on the forums 2012-01-05T15:08:14 https://wiki.archlinux.org/index.php?title=Special:UserLogin&type=signup&returnto=Main_Page 2012-01-05T15:08:19 look at that account creation page 2012-01-05T15:08:32 :P 2012-01-05T15:08:39 it's loading.. 2012-01-05T15:09:03 you might have to go there manually from the front page 2012-01-05T15:09:10 amstan: So you and aerique working on different asteroids implementations? 2012-01-05T15:09:15 What is the output of "date -u +%W`uname`|sha256sum|sed 's/\W//g'"? 2012-01-05T15:09:17 amstan: reminds me of an xkcd 2012-01-05T15:09:33 http://xkcd.com/810/ 2012-01-05T15:10:02 amstan: each of the starter packages could include a code required to login :) 2012-01-05T15:10:08 well 2012-01-05T15:10:11 s/login/register/ 2012-01-05T15:10:38 yeah 2012-01-05T15:11:00 we just have to make sure to not lose any competitors because of it 2012-01-05T15:12:36 McLeopold: there, I did it your way 2012-01-05T15:12:41 reading in from a file :) 2012-01-05T15:13:13 rwest: back now 2012-01-05T15:13:22 didn't find the math way to do it, no :( 2012-01-05T15:13:41 if only coding functionally in python wasn't so hideous 2012-01-05T15:13:44 Just going to start my recursive one now, should get an answer in about 20 mins lol 2012-01-05T15:13:46 ahow984_: I got the answer done :) 2012-01-05T15:13:51 :) 2012-01-05T15:13:53 nice 2012-01-05T15:13:54 ahow984_: you can't do it in c 2012-01-05T15:13:57 lol 2012-01-05T15:14:03 I just thought of something crazy 2012-01-05T15:14:06 rwest: you can use gmp 2012-01-05T15:14:06 unless you use a bignum libraru 2012-01-05T15:14:16 thestinger: that thing is such a pain 2012-01-05T15:14:18 gmp is hideous in C though, it's much nicer in C++ 2012-01-05T15:14:31 what happens if you declare a recursive function to be inline?.... 2012-01-05T15:14:34 rwest: in C++ they have a class for ints/rational numbers, and the operators are overloaded 2012-01-05T15:14:47 ahow984_: the compiler doesn't care if you put 'inline' 2012-01-05T15:14:48 thestinger: ahh, much nicer heh 2012-01-05T15:14:51 turn on -Winline 2012-01-05T15:14:55 it ignores it most of the time 2012-01-05T15:15:10 has anybody done problem 12? 2012-01-05T15:15:23 oh thestinger :/ 2012-01-05T15:15:49 ahow984_: gcc has TCO, so it might just turn it into a loop if it's tail-recursive 2012-01-05T15:15:54 s/might/will/ 2012-01-05T15:16:16 thestinger: should be d&c 2012-01-05T15:16:18 was thinking shit would be crazy if it was treated inline 2012-01-05T15:16:33 ahow984_: it sometimes tries to inline it 2012-01-05T15:16:47 -Winline will show 10+ warnings, then it will stop since it's making the code bigger 2012-01-05T15:17:07 heh 2012-01-05T15:17:13 you can actually force inlining with gcc attributes 2012-01-05T15:17:13 silly compiler 2012-01-05T15:17:28 amstan: what small issues? 2012-01-05T15:17:30 "flatten" actually inlines all the functions you call in a flattened function 2012-01-05T15:17:35 inline is pretty useless, it doesn't even make it that much faster.... 2012-01-05T15:17:45 McLeopold: this stuff: https://github.com/aichallenge/aichallenge/issues?labels=epsilon%2Fants&sort=created&direction=desc&state=closed&page=1 2012-01-05T15:17:47 ahow984_: the compiler is smart enough to inline itself 2012-01-05T15:17:59 it does make stuff faster, but not because it avoids a function call 2012-01-05T15:18:03 yeah, so no need to expressly declare it 2012-01-05T15:18:05 McLeopold: i left issues that could be applied to zeta open 2012-01-05T15:18:14 thestinger: oh, how does it make it faster so? 2012-01-05T15:18:18 well, I don't care 2012-01-05T15:18:26 ahow984_: function calls are cheap, the speed boost comes because it can optimize the function after inlining it 2012-01-05T15:18:35 there are _many_ passes over the syntax tree to optimize 2012-01-05T15:18:45 stuff is inlined, common expressions are eliminated, etc. 2012-01-05T15:18:51 then that happens again, and again 2012-01-05T15:18:53 huh 2012-01-05T15:19:04 ahow984_: benchmark C qsort() with std::sort 2012-01-05T15:19:10 std::sort is _way_ faster 2012-01-05T15:19:12 * ahow984_ is glad he never looked at a compiler's source code 2012-01-05T15:19:12 McLeopold: are there any changes to ants for archiving? 2012-01-05T15:19:15 not because it gets inlined 2012-01-05T15:19:21 McLeopold: or can i tag it? 2012-01-05T15:19:26 thestinger: weird 2012-01-05T15:19:32 but because qsort uses a function pointer, which can't be inlined into the function 2012-01-05T15:19:50 std::sort gets the comparison function inlined into it, and _then_ it gets optimized more 2012-01-05T15:20:03 assuming it's not some massive comparison function called in 20 other places too 2012-01-05T15:20:09 huh 2012-01-05T15:20:18 weird 2012-01-05T15:20:28 anyway, polymorphism in C usually uses function pointers, void casts, etc. 2012-01-05T15:20:42 that usually prevents optimization 2012-01-05T15:20:44 now expressively inline functions are stupid and complicated 2012-01-05T15:21:10 yeah, it looks fine 2012-01-05T15:21:12 ok 2012-01-05T15:21:19 almost level 2 2012-01-05T15:21:22 4 more to go 2012-01-05T15:21:36 *** kire has joined #aichallenge 2012-01-05T15:21:41 rwest: :O 2012-01-05T15:21:52 amstan: just 2 that I want to remember, I've taged them with zeta 2012-01-05T15:21:53 ahow984_: 1879 us per iteration 2012-01-05T15:21:53 you've done lots in the last 2 days 2012-01-05T15:21:55 that's qsort 2012-01-05T15:22:06 879 us per iteration 2012-01-05T15:22:07 McLeopold: what? 2012-01-05T15:22:08 and std::sort? 2012-01-05T15:22:11 and std::sort 2012-01-05T15:22:30 sorting 15000 64-bit ints 2012-01-05T15:22:33 amstan: 2 issues tagged as epsilon/ants that I've also tagged as zeta 2012-01-05T15:22:40 no, i meant code changes 2012-01-05T15:22:40 *** Kurnevsky has quit IRC (Quit: Instantbird 1.0) 2012-01-05T15:22:46 amstan: 795 us per iteration 2012-01-05T15:22:48 oops 2012-01-05T15:22:50 but i just checked, there's only robots.txt 2012-01-05T15:22:53 stupid tab completion in weechat >.< 2012-01-05T15:22:55 :P 2012-01-05T15:22:55 ahow984_: 795 us per iteration 2012-01-05T15:23:01 yeah 2012-01-05T15:23:03 so now we have it: https://github.com/aichallenge/aichallenge/tags 2012-01-05T15:23:07 huh 2012-01-05T15:23:08 that's merge sort, that falls back to insertion sort with under 64 elements 2012-01-05T15:23:10 amstan: only changes would be to fix whatever is causing our archive slowdown 2012-01-05T15:23:23 btw, how do you benchmark something? 2012-01-05T15:23:24 I'm fairly certain it is just the tron database. 2012-01-05T15:23:38 ahow984_: well, I happened to have this lying around :P 2012-01-05T15:23:38 well, you turned it off, and it's still doing it right? 2012-01-05T15:23:43 no 2012-01-05T15:23:45 it's fast 2012-01-05T15:23:49 thestinger: :P 2012-01-05T15:23:57 but how would you do it generally? 2012-01-05T15:24:01 I was doing stuff with parallel sorts and sorting networks 2012-01-05T15:24:01 last I checked... 2012-01-05T15:24:06 ahow984_: well, timing it in the code is usually best 2012-01-05T15:24:09 python as timeit 2012-01-05T15:24:10 McLeopold: who's ddosing though? google/baidu? 2012-01-05T15:24:11 has* 2012-01-05T15:24:34 I saw googlebot and bingbot earlier, the rest of the traffic looked legit 2012-01-05T15:24:36 ahow984_: running it 10000 times and taking the mean or whatever 2012-01-05T15:24:48 and ignoring the first 20 or so iterations 2012-01-05T15:24:51 *** Paradoxiality has joined #aichallenge 2012-01-05T15:25:02 why ignore the first few? 2012-01-05T15:25:07 slow 2012-01-05T15:25:13 because the stuff isn't in CPU cache yet, etc. 2012-01-05T15:25:17 ah 2012-01-05T15:25:18 ok 2012-01-05T15:25:40 in a language with a JIT it will also optimize more 2012-01-05T15:25:51 *** Paradoxiality has quit IRC (Remote host closed the connection) 2012-01-05T15:25:57 and then you just compare them 2012-01-05T15:26:08 I imagined it would be a lot more complex then that :P 2012-01-05T15:26:11 538 us per iteration 2012-01-05T15:26:16 ty for the explanation 2012-01-05T15:26:18 threaded merge sort (2 threads) with the same thing 2012-01-05T15:26:31 386 us per iteration 2012-01-05T15:26:39 and that's a combination of quick and merge sort :P 2012-01-05T15:26:42 YandexBot? 2012-01-05T15:26:46 does 2 parallel quick sorts and merges them 2012-01-05T15:26:52 huh 2012-01-05T15:26:58 anyway std::sort is good enough 2012-01-05T15:27:16 I was using this to benchmark C and C++ against Go 2012-01-05T15:27:34 do people really use Go?! 2012-01-05T15:27:38 *** dorisabayon has joined #aichallenge 2012-01-05T15:27:51 McLeopold: i added the throttle to robots.txt 2012-01-05T15:27:59 ahow984_: it has a pretty small niche 2012-01-05T15:27:59 McLeopold: but googlebot might not have gotten the message 2012-01-05T15:28:09 ahow984_: network clients/servers basically 2012-01-05T15:28:14 i could go in the webmaster tools to change it manually 2012-01-05T15:28:25 thestinger: weird :/ 2012-01-05T15:28:26 ahow984_: it's an alternative to erlang, stackless python, etc. 2012-01-05T15:28:34 CSP 2012-01-05T15:28:46 Do google use it much in their products? 2012-01-05T15:28:54 googlebot just increased its speed 2012-01-05T15:29:05 ahow984_: they do, but they don't really say what for :P 2012-01-05T15:29:21 they use java, C++ and python mostly 2012-01-05T15:29:23 appengine, for example 2012-01-05T15:29:28 McLeopold: which domain? 2012-01-05T15:29:31 I think they want to replace java and C++ with Go for server stuff 2012-01-05T15:29:33 ants 2012-01-05T15:29:42 aichallenge.org or ants.aichallenge.org 2012-01-05T15:29:47 so if you wanted to get a job at google, you wouldn't need to know Go? 2012-01-05T15:29:57 they're duplicate right now 2012-01-05T15:30:09 ahow984_: no, it's a huge company anyway 2012-01-05T15:30:18 I doubt they would really care what languages you know 2012-01-05T15:30:24 true 2012-01-05T15:30:28 you can just learn whatever you need to know 2012-01-05T15:30:33 They'd find somewhere to put you :P 2012-01-05T15:30:42 yeah, thats true 2012-01-05T15:30:47 well, you can learn Go in a day, it's a tiny language 2012-01-05T15:31:01 oh? Whats it similar to? 2012-01-05T15:31:10 *** Fandekasp has quit IRC (Ping timeout: 268 seconds) 2012-01-05T15:31:18 well 2012-01-05T15:31:31 C, Limbo, Modula, Newsqueak, Oberon, Pascal[2], Python 2012-01-05T15:31:31 *** deathcorps has quit IRC () 2012-01-05T15:31:41 amstan: bleh, I don't want to do this right now, maybe next week 2012-01-05T15:31:52 thestinger: I see C, that's ok so :) 2012-01-05T15:31:54 it's like C, with garbage collection, closures, multiple return values, and of course CSP which is their killer feature 2012-01-05T15:31:56 the slow down thing? sure 2012-01-05T15:32:03 CSP? 2012-01-05T15:32:10 https://en.wikipedia.org/wiki/Communicating_sequential_processes 2012-01-05T15:32:14 yeah, long term, we may need proper etags and such 2012-01-05T15:32:22 ahow984_: lightweight threads with message passing basically 2012-01-05T15:32:34 ok, ok 2012-01-05T15:32:44 McLeopold: aerique has implemented stuff in his repo 2012-01-05T15:32:48 McLeopold: he has a playgame for asteroids 2012-01-05T15:32:59 ahow984_: you can have a server that spawns a lightweight thread for each client 2012-01-05T15:33:04 ~200k is fine 2012-01-05T15:33:10 heh 2012-01-05T15:33:17 the stacks are segmented and allocated lazily basically 2012-01-05T15:33:37 Its a wonder that google didn't write Android in Go so.... 2012-01-05T15:33:44 anyway, by default they're just concurrent (there's context switching, for example whenever I/O blocks, but also at regular intervals) 2012-01-05T15:33:49 ahow984_: google didn't make android, they bought it 2012-01-05T15:33:54 :O 2012-01-05T15:33:56 and Go is much newer than Android 2012-01-05T15:34:02 really? Wow, I never knew that 2012-01-05T15:34:17 anyway, they basically wrote their own JVM and C library 2012-01-05T15:34:19 who were making it before Google? 2012-01-05T15:34:37 Google acquired Android Inc. on August 17, 2005, making Android Inc. a wholly owned subsidiary of Google Inc. Key employees of Android Inc., including Andy Rubin, Rich Miner and Chris White, stayed at the company after the acquisition.[11] 2012-01-05T15:35:11 wow 2012-01-05T15:35:22 I always thought google devved it from the ground up 2012-01-05T15:36:00 well, they mostly just reuse open-source projects 2012-01-05T15:36:05 rwest: 20 mins and counting for problem 15 :P 2012-01-05T15:36:12 linux, freetype, webkit, etc. 2012-01-05T15:36:20 thestinger: yeah, like ChromeOS 2012-01-05T15:36:47 ./solution.py 0.57s user 0.00s system 99% cpu 0.577 total 2012-01-05T15:36:54 well, why did they say brute forcing this wasn't possible? lol 2012-01-05T15:37:14 where did they say that? 2012-01-05T15:37:16 wait, I screwed it up >.< 2012-01-05T15:37:27 problem 67 2012-01-05T15:37:32 thats the massive triangle one 2012-01-05T15:37:37 There's probably another, more brutish approach 2012-01-05T15:37:56 anyway I did it wrong :P 2012-01-05T15:37:56 yeah :P 2012-01-05T15:38:03 thats the massive triangle one to me 2012-01-05T15:38:28 15 is the paths through a 20*20 maze 2012-01-05T15:38:37 couldn't find the math way to do it :P :/ 2012-01-05T15:38:53 ahow984_: it's pascal's triangle 2012-01-05T15:38:59 you can just calculate the binomial coefficient 2012-01-05T15:39:24 15 can be done a hundred different ways 2012-01-05T15:39:27 >_, 2012-01-05T15:39:29 yeah 2012-01-05T15:39:34 ach 2012-01-05T15:39:39 how didn't I see that :@ 2012-01-05T15:39:46 pairofdice: anyway, I'm just going to do a graph search from the bottom up basically 2012-01-05T15:41:42 My approach is fairly dumb but very efficient 2012-01-05T15:41:59 Atleast I thought 2012-01-05T15:42:56 *** UncleVasya has quit IRC (Read error: Connection reset by peer) 2012-01-05T15:43:16 oh 2012-01-05T15:43:55 so you can start at the bottom, and sum them together like that 2012-01-05T15:44:02 ahow984_: took tcl over an hour 2012-01-05T15:44:25 thestinger: yeah, pick the bigger and sum to the upper lever 2012-01-05T15:44:30 rwest: haha 2012-01-05T15:44:33 ah, is that how you did it? 2012-01-05T15:44:36 you just peak the peak basically 2012-01-05T15:44:37 Yup 2012-01-05T15:44:53 rwest: fails the first test of PE, run in < 1 minute ;) 2012-01-05T15:45:06 pairofdice: I can't think of a better way than that :P 2012-01-05T15:45:19 :) 2012-01-05T15:46:59 ahow984_: hah 2012-01-05T15:47:40 22 problems done now 2012-01-05T15:47:49 amstan: for the next beta period, whatever that game is, I think we should try and minimize the skill gap between the beta participants and final participants 2012-01-05T15:48:03 what does that mean? 2012-01-05T15:48:11 So, we are 3-4 months away from the next contest, building out asteroids right now increases that gap 2012-01-05T15:48:43 also, for the next beta, I think all bots submitted should be open sourced at the beginning of launch 2012-01-05T15:49:10 good points 2012-01-05T15:49:21 k, removing my asteroids thing in case we actually do use asteroids 2012-01-05T15:49:22 McLeopold: nobody will submit for beta then ^^ 2012-01-05T15:49:31 which is okay 2012-01-05T15:49:37 rwest: you shouldn't submit to beta to improve your bot anyway 2012-01-05T15:49:44 rwest: you should submit tests to make sure beta works 2012-01-05T15:49:53 we where testing the backend system 2012-01-05T15:50:00 hmm, but people can still develop locally 2012-01-05T15:50:07 open-sourcing them seems kind of pointless 2012-01-05T15:50:10 *** kire has quit IRC (Remote host closed the connection) 2012-01-05T15:50:25 thestinger: yes, but without any place to upload it will be harder 2012-01-05T15:50:53 amstan: people can just run a tcp server though 2012-01-05T15:51:06 iirc, some people used private tcp servers last time to play with friends/co-workers 2012-01-05T15:51:30 imo, you should just announce the beta 2012-01-05T15:51:32 thestinger: sure, but combined with working on the contest last this will be better 2012-01-05T15:51:41 an announcement on the main site, the forums, reddit, etc. 2012-01-05T15:51:53 again, beta is not for people compeeting 2012-01-05T15:52:00 yeah, but they will :P 2012-01-05T15:52:12 that's their problem, we'll opensource their bot 2012-01-05T15:52:18 we can also close the beta 2012-01-05T15:52:45 *** X-Scale has quit IRC (Ping timeout: 268 seconds) 2012-01-05T15:53:19 I just wish I knew about the contest more than 3 weeks before 2012-01-05T15:53:32 amstan: is C++11 going to be the default for C++ this time? 2012-01-05T15:53:39 thestinger: idk 2012-01-05T15:53:39 nevermind during beta 2012-01-05T15:53:59 thestinger: i'm gonna push for build systems so it's not my problem 2012-01-05T15:54:01 wouldn't that raise the stake for people trying to begin with the starter bots ? 2012-01-05T15:54:07 amstan: ah, that's a good idea 2012-01-05T15:54:07 thestinger: all you'll need is a build.sh 2012-01-05T15:54:23 and you could run sloccount to detect the language 2012-01-05T15:54:26 or languages 2012-01-05T15:54:38 thestinger: hmm, good idea 2012-01-05T15:54:46 thestinger: can it detect between C/C++ 2012-01-05T15:54:52 like.. small variances? 2012-01-05T15:55:11 well, it can figure that out based on file extensions, like gcc 2012-01-05T15:55:20 you can actually compile C++ with gcc (not just g++) 2012-01-05T15:56:02 i know, but ideally nothing should be calling gcc manually on our end 2012-01-05T15:56:12 we'll just call their build script and they can use whatever they want to compile 2012-01-05T15:56:16 *** X-Scale has joined #aichallenge 2012-01-05T15:56:24 well, I mean sloccount can figure out if it's C or C++ 2012-01-05T15:56:29 *** X-Scale is now known as Guest85397 2012-01-05T15:56:38 because you have to use certain file extensions 2012-01-05T15:56:56 it does look at file content though 2012-01-05T15:56:57 thestinger: it can't do a bunch of languages that we use 2012-01-05T15:57:16 thestinger: like it can't do go, javascript, ocaml 2012-01-05T15:57:41 dart, coffeescript 2012-01-05T15:57:54 not sure, another library might be better 2012-01-05T15:58:28 ah, true 2012-01-05T15:58:29 *** Guest85397 is now known as X-Scale 2012-01-05T15:58:32 it only has common/old languages 2012-01-05T15:58:49 *** dmj111 has quit IRC (Ping timeout: 240 seconds) 2012-01-05T15:58:56 quite a few people used go 2012-01-05T15:59:17 oh nice! octave in top 100: http://aichallenge.org/profile.php?user=11792 2012-01-05T15:59:31 amstan: yeah, he was in the top 50 for a while iirc 2012-01-05T15:59:53 they were having doubts on the forums about it 2012-01-05T16:00:29 *** guido_ has quit IRC (Quit: Page closed) 2012-01-05T16:01:00 http://www.ohloh.net/ maybe these guys have a good language detection script 2012-01-05T16:01:02 I'll check 2012-01-05T16:02:01 https://github.com/blackducksw/ohcount :) 2012-01-05T16:02:15 trying it now 2012-01-05T16:02:44 oh, there's actually an aur package 2012-01-05T16:02:51 makes my life easy 2012-01-05T16:03:00 thestinger: needs to be ubuntu though 2012-01-05T16:03:06 yeah, it will build on ubuntu 2012-01-05T16:03:17 has a 'build' script, no Makefile apparently 2012-01-05T16:03:33 it has a Rakefile 2012-01-05T16:03:42 ah 2012-01-05T16:03:54 which calls ./build 2012-01-05T16:03:56 lol 2012-01-05T16:04:32 detects javascript for sure 2012-01-05T16:05:59 meh, doesn't detect Go 2012-01-05T16:06:20 we could just simplify this by getting another file which contains the language name 2012-01-05T16:07:14 oh, it does detect Go 2012-01-05T16:07:18 according to the source 2012-01-05T16:07:21 https://github.com/blackducksw/ohcount/blob/master/src/languages.h 2012-01-05T16:07:24 not sure why it's failing 2012-01-05T16:09:28 https://github.com/blackducksw/ohcount/blob/master/src/parsers/golang.rl yeah, it should work 2012-01-05T16:10:07 meh 2012-01-05T16:13:19 *** epicmonkey has quit IRC (Ping timeout: 276 seconds) 2012-01-05T16:14:51 *** ntnix has quit IRC (Remote host closed the connection) 2012-01-05T16:15:07 *** ntnix has joined #aichallenge 2012-01-05T16:19:19 *** JorgeB has quit IRC (Quit: Textual IRC Client: http://www.textualapp.com/) 2012-01-05T16:21:01 rwest: we found another textual guy ^^ 2012-01-05T16:21:04 -_- 2012-01-05T16:21:31 *** Garf has joined #aichallenge 2012-01-05T16:23:39 anyway, back to this euler problem :P 2012-01-05T16:24:03 heh 2012-01-05T16:24:12 I nearly have 15 thank god :P 2012-01-05T16:25:26 heh 2012-01-05T16:25:52 ahow984_: I have finally figured out how to do the problems that involve large numbers of digits but only returning a subset of them fast 2012-01-05T16:25:55 like the last 10 2012-01-05T16:26:04 oh? how so? 2012-01-05T16:26:07 mod 2012-01-05T16:26:11 bleh 2012-01-05T16:26:15 that would take ages 2012-01-05T16:26:18 mod after every calculation 2012-01-05T16:26:26 oh 2012-01-05T16:26:27 so say #47 2012-01-05T16:26:36 taks 5s in tcl 2012-01-05T16:26:43 err 48 2012-01-05T16:26:52 and that is doing 1000^1000 2012-01-05T16:27:00 and 999^999 2012-01-05T16:27:01 and so on 2012-01-05T16:27:11 *** JorgeB has joined #aichallenge 2012-01-05T16:27:12 :) 2012-01-05T16:27:15 nice 2012-01-05T16:27:31 one more until level up! 2012-01-05T16:27:45 I've confused myself with layers of slices 2012-01-05T16:30:40 what are you guys talking about? 2012-01-05T16:31:39 it works :D 2012-01-05T16:31:42 woot 2012-01-05T16:31:42 Anilm3: project euler 2012-01-05T16:31:47 oh good 2012-01-05T16:31:47 so does mine thestinger :P 2012-01-05T16:32:05 except thestinger, you're probably doing problem 90 :P 2012-01-05T16:32:12 67 :P 2012-01-05T16:32:20 I have only done 20 2012-01-05T16:32:33 pairofdice: want to see my crappy code for that big triangle one? 2012-01-05T16:33:19 hm 2012-01-05T16:33:22 can probably make it faster 2012-01-05T16:34:04 Anilm3: I'm around that level too 2012-01-05T16:39:09 well, it takes 68ms in python 2012-01-05T16:39:23 *** ltriant has joined #aichallenge 2012-01-05T16:39:26 wohoo, freenode group registration guys came back to me 2012-01-05T16:39:33 we might get a group/cloak soon 2012-01-05T16:41:25 amstan: what do you mean? 2012-01-05T16:42:00 Anilm3: http://freenode.net/group_registration.shtml 2012-01-05T16:42:12 and http://freenode.net/faq.shtml#projectcloak 2012-01-05T16:42:25 @network whois ioni 2012-01-05T16:42:27 thestinger: noname (~wonder@archlinux/developer/wonder) has been on server leguin.freenode.net since 05:18 PM, December 11, 2011 (idle for 2 minutes and 1 second) and isn't on any non-secret channels. 2012-01-05T16:42:34 like that, the archlinux/developer/username thing 2012-01-05T16:42:40 yes 2012-01-05T16:42:41 *** sigh has joined #aichallenge 2012-01-05T16:42:56 we could have aichallenge/developer aichallenge/admin aichallenge/contestant 2012-01-05T16:43:02 oh 2012-01-05T16:43:09 nice 2012-01-05T16:43:16 yeah, i know, it's quite fancy 2012-01-05T16:43:25 amstan: can developers be contestants? 2012-01-05T16:43:30 yes 2012-01-05T16:43:36 it was just an example 2012-01-05T16:43:49 admins can be developers too 2012-01-05T16:43:56 but admins can't be contestants 2012-01-05T16:44:11 thx, that's what I was going to ask next 2012-01-05T16:44:35 more details: https://github.com/aichallenge/aichallenge/wiki/Contest-Participation-Eligibility 2012-01-05T16:45:05 @title http://google.com 2012-01-05T16:45:05 thestinger: Error: The command "title" is available in the Format and Web plugins. Please specify the plugin whose command you wish to call by using its name as a command before "title". 2012-01-05T16:45:11 @web title http://google.com 2012-01-05T16:45:12 thestinger: Google 2012-01-05T16:45:18 that seems like a bad feature :P 2012-01-05T16:45:35 thestinger: some channels like having it automatically 2012-01-05T16:45:44 so when someone pastes a link the bot says the title 2012-01-05T16:45:55 amstan: yeah, #archlinux and #archlinux-offtopic have that 2012-01-05T16:46:04 i hate it tbh 2012-01-05T16:46:19 what i wanted to have a snarfer for was the game links 2012-01-05T16:46:23 @url 2012-01-05T16:46:24 thestinger: An error occured while trying to show the previous error. 2012-01-05T16:46:28 amstan: it's good for video links 2012-01-05T16:46:29 the bot saying who owned who 2012-01-05T16:46:50 and what i would really want to have is github/forums integration 2012-01-05T16:50:04 lol, I should do these easy problems that I skipped 2012-01-05T16:50:15 11, 28, etc 2012-01-05T16:50:38 not sure why I skipped them 2012-01-05T16:56:02 McLeopold, janzert: #aichallenge-staff is ours now 2012-01-05T16:57:34 McLeopold, janzert: we can also pick official aichallenge cloaks, suggestions? 2012-01-05T16:59:21 black with a hood and red lining? silk or velvet for the lining though, hmm. :P 2012-01-05T17:00:10 aichallenge/velvet? lol 2012-01-05T17:00:41 I really obviously don't understand what the question is meaning 2012-01-05T17:01:33 ahh, freenode's host masking feature I assume 2012-01-05T17:01:39 janzert: it's pretty much the same as unix groups 2012-01-05T17:01:47 and it's also used for host masking 2012-01-05T17:01:58 do /whois FloodBot1 2012-01-05T17:02:33 well, 11 was easy as hell 2012-01-05T17:02:37 really not sure why I skipped that... 2012-01-05T17:02:53 *** g0llum has quit IRC (Read error: Connection reset by peer) 2012-01-05T17:02:56 we could get aichallenge/admin/* and aichallenge/bot/contestbot 2012-01-05T17:03:03 *** Palmik has quit IRC (Remote host closed the connection) 2012-01-05T17:03:28 it doesn't really matter much to me 2012-01-05T17:03:50 it'll also simplify op permissions 2012-01-05T17:04:03 and it'll make admins easily distinguishable 2012-01-05T17:07:22 *** Anilm3 has quit IRC (Quit: Lost terminal) 2012-01-05T17:07:51 *** foRei has quit IRC (Read error: Connection reset by peer) 2012-01-05T17:09:07 *** Redgis has joined #aichallenge 2012-01-05T17:17:22 amstan: what's a cloak? 2012-01-05T17:18:00 [McLeopold] (~Scott@barracuda.imagesourceinc.com): purple 2012-01-05T17:18:17 it would replace barracuda.imagesourceirc.com with aichallenge/admin/McLeopold or whatever 2012-01-05T17:19:00 McLeopold: if you go to big open source project channels, and whois the ops in there you'll usually get a customized cloak for each 2012-01-05T17:20:21 *** racko has quit IRC (Quit: Page closed) 2012-01-05T17:20:23 oh 2012-01-05T17:20:42 so its pretty much been decided on asteroids then? 2012-01-05T17:21:09 ahow984_: not at all 2012-01-05T17:21:45 oh, I presumed since there hasn't been much talk about anything not asteroids and there was a repo for it :P 2012-01-05T17:22:01 yeah, but that doesn't mean it's the best game 2012-01-05T17:22:12 i do like it, but we could pick others too 2012-01-05T17:22:28 yeah 2012-01-05T17:22:40 *** denysonique_ has quit IRC (Read error: Connection reset by peer) 2012-01-05T17:22:40 *** mattswe has quit IRC (Remote host closed the connection) 2012-01-05T17:22:55 I don't like it tbh, but I'd still enter 2012-01-05T17:23:09 ahow984_: why not? 2012-01-05T17:23:22 seems boring :/ 2012-01-05T17:23:33 not much room for original thought in it 2012-01-05T17:23:41 have your played robocode? 2012-01-05T17:23:44 no 2012-01-05T17:23:54 I do like the continuous aspect of it though 2012-01-05T17:23:58 it's fairly similar, except that you have momentum 2012-01-05T17:23:59 I know about it though 2012-01-05T17:24:08 in robocode it's about tanks and no asteroids 2012-01-05T17:24:12 yeah 2012-01-05T17:24:25 still, I think there could be more original ideas 2012-01-05T17:24:28 *** mattswe has joined #aichallenge 2012-01-05T17:24:39 how about we control the asteroids and try to smash the ships? 2012-01-05T17:24:44 haxball was a good idea IMO 2012-01-05T17:25:04 her was my spin on the game: 2012-01-05T17:25:28 the asteroids don't actually blow up, and you can't shoot people directly 2012-01-05T17:25:37 you have to crush them with the asteroid 2012-01-05T17:25:47 would make it a lot more challenging 2012-01-05T17:26:01 if we were to do asteroids i think it would be nice if you could shoot asteroids to split them in 2 and shoot players directly 2012-01-05T17:26:08 i think they're both usable strategies 2012-01-05T17:26:50 *** epicmonkey has joined #aichallenge 2012-01-05T17:26:54 I don't really mind, I won't be able to help develop the game because I'm a terrible programmer, but I'd compete in it whatever way it turns out :P 2012-01-05T17:26:57 heat-seeking asteroids would be better 2012-01-05T17:27:03 heh, :) 2012-01-05T17:27:19 Yeah 2012-01-05T17:27:43 or a game like top-gun for the original NES 2012-01-05T17:28:15 or x-wing vs tie-fighter... 2012-01-05T17:28:26 oh! i get it 2012-01-05T17:28:46 haxball is like soccer 2012-01-05T17:28:52 :P 2012-01-05T17:29:00 haxball looked nice 2012-01-05T17:30:12 i could do a demo for that one too 2012-01-05T17:31:50 *** sigh has quit IRC (Remote host closed the connection) 2012-01-05T17:32:38 hm 2012-01-05T17:32:44 i just realized something 2012-01-05T17:32:49 and it feels bad 2012-01-05T17:33:05 what? 2012-01-05T17:33:07 the planes in die hard 2 had satellites phones 2012-01-05T17:33:28 yet the premise is in the first part of the film, is that the tower cant talk to them 2012-01-05T17:35:53 *** denysonique_ has joined #aichallenge 2012-01-05T17:38:30 amstan: since thats a game thats already being played, is their not copyright or something? 2012-01-05T17:38:45 ahow984_: galcon had copyright 2012-01-05T17:39:08 we made a deal with the owner and we got mutual advertising 2012-01-05T17:39:19 ah 2012-01-05T17:39:34 fair enough 2012-01-05T17:41:38 *** JorgeB has quit IRC (Ping timeout: 255 seconds) 2012-01-05T17:43:21 :) and 12 done 2012-01-05T17:46:05 now just 18 to do and I'll have reached 20 solved lol :P 2012-01-05T17:54:09 *** mattswe has quit IRC (Remote host closed the connection) 2012-01-05T17:54:10 *** sofuture has quit IRC (Remote host closed the connection) 2012-01-05T17:54:10 *** denysonique_ has quit IRC (Write error: Connection reset by peer) 2012-01-05T17:54:10 *** nickjohnson has quit IRC (Remote host closed the connection) 2012-01-05T17:54:45 *** sofuture has joined #aichallenge 2012-01-05T17:54:56 *** sofuture has quit IRC (Remote host closed the connection) 2012-01-05T17:55:42 bleh, whats the best way to represent a triangle of numbers in C++? 2012-01-05T17:55:47 http://projecteuler.net/problem=18 2012-01-05T17:55:48 for that 2012-01-05T17:55:51 *** sofuture has joined #aichallenge 2012-01-05T17:56:15 *** mattswe has joined #aichallenge 2012-01-05T17:57:28 ahow984_: arrays? 2012-01-05T17:58:07 so int array[15][15]? 2012-01-05T17:58:19 and hard-code in the places? 2012-01-05T17:58:42 from a[x,y] you can move down to a[x+1,y+1] a[x+1,y] or up to a[x-1,y-1] and a[x-1,y] 2012-01-05T17:59:00 oh.. 2012-01-05T17:59:01 ah 2012-01-05T17:59:02 only down 2012-01-05T17:59:03 ok 2012-01-05T17:59:06 so only the first 1 2012-01-05T17:59:08 2* 2012-01-05T17:59:14 yeah 2012-01-05T17:59:25 it was the triangle shape that was throwing me 2012-01-05T17:59:26 oh, so it's just a search problem 2012-01-05T17:59:33 you have a tree 2012-01-05T17:59:41 find longest path 2012-01-05T17:59:44 I didn't know how I could access the values 2012-01-05T18:00:07 so just brute force every path? 2012-01-05T18:00:11 no 2012-01-05T18:00:23 can you answer wrong? 2012-01-05T18:00:28 or do you lose points? 2012-01-05T18:00:32 nah 2012-01-05T18:00:37 you don't lose points 2012-01-05T18:00:47 you just keep trying until you get it right ;) 2012-01-05T18:00:56 you could make al algorithm 2012-01-05T18:01:00 an* 2012-01-05T18:01:10 for each row, you have to decide where to go next 2012-01-05T18:01:14 you have 2 choices 2012-01-05T18:01:21 you could try always going toward the biggest number 2012-01-05T18:01:49 hmm, doubt that would work.... 2012-01-05T18:01:54 but that won't guarantee the maximum 2012-01-05T18:02:28 it works for the first example 2012-01-05T18:02:40 look into breadth first search 2012-01-05T18:02:44 I know it 2012-01-05T18:02:59 don't see how it will work here though :/ 2012-01-05T18:03:24 *** nickjohnson has joined #aichallenge 2012-01-05T18:05:14 of course... in the last part of copying my /home it copies all the git archives 2012-01-05T18:05:17 and this takes the longest 2012-01-05T18:05:19 lol 2012-01-05T18:07:43 ahow984_: just do a 2d vector 2012-01-05T18:08:29 so if you have triangle[y][x] then triangle[y+1][x] and triangle[y+1][x+1] are the two under it 2012-01-05T18:08:47 yeah, got it 2012-01-05T18:09:03 damnest darnest thing 2012-01-05T18:09:09 19 2012-01-05T18:09:10 trying to find out the real solution so I can just apply it to #67 when I'm done 2012-01-05T18:09:12 damn 2012-01-05T18:09:14 so scp is stupid 2012-01-05T18:09:14 18 2012-01-05T18:09:20 i was scping my .wine folder 2012-01-05T18:09:28 and apparently it has some softlinks to my home 2012-01-05T18:09:33 *** JorgeB has joined #aichallenge 2012-01-05T18:09:41 scp copies the inside of the link too 2012-01-05T18:09:51 lol, whats wrong with 18 mcstar? :P 2012-01-05T18:09:55 amstan: use sftp 2012-01-05T18:10:00 or sshfs 2012-01-05T18:10:02 since my home contains .wine... it was a lot of fun 2012-01-05T18:10:13 thestinger: sshfs is slow 2012-01-05T18:10:21 i can only get 5MB/s out of it, scp works at 60 2012-01-05T18:10:22 ahow984_: i kept missing the right answer by 4 2012-01-05T18:10:26 amstan: what about sftp? 2012-01-05T18:10:35 no idea, don't use it often 2012-01-05T18:10:38 mcstar: :P 2012-01-05T18:10:51 anyway, it's over 2012-01-05T18:10:54 all finished 2012-01-05T18:11:24 noew p67 2012-01-05T18:13:00 mcstar: is the smart way something you can figure out or is it kind of like you either know it or you don't? 2012-01-05T18:13:19 ahow984_: lets see if i got the smart way, first 2012-01-05T18:14:13 *** denysonique_ has joined #aichallenge 2012-01-05T18:15:18 hey guys, when is the next AI challange? i wanna put it on my calendar 2012-01-05T18:15:40 *** Redgis has quit IRC (Quit: ... mains libres) 2012-01-05T18:15:47 mattswe: sometime in the future, we don't know 2012-01-05T18:15:52 mattswe: the next challenge has yet to be decided on 2012-01-05T18:15:57 NOT THE PAST??! 2012-01-05T18:15:58 :) 2012-01-05T18:15:59 so no date yet 2012-01-05T18:15:59 probably not tomorrow, lol 2012-01-05T18:16:09 ok. so greater than tomorrow 2012-01-05T18:16:16 but less then heat death of the universe 2012-01-05T18:16:19 gottcha 2012-01-05T18:16:27 mattswe: estimate: 4 months, maybe, hopefully 2012-01-05T18:16:32 oh, ok 2012-01-05T18:16:32 ! 2012-01-05T18:16:33 rad 2012-01-05T18:16:38 though, idk about a summer contest 2012-01-05T18:16:42 is there a mailing list? 2012-01-05T18:16:54 there is, but... i really don't recomend using it 2012-01-05T18:16:57 There's... IRC 2012-01-05T18:17:03 cause I ran across the tron contest, and then missed ants.. 2012-01-05T18:17:05 ok 2012-01-05T18:17:17 mattswe: apparently google can tell you when there's an update on aichallenge.org 2012-01-05T18:17:26 ah, alerts? 2012-01-05T18:17:30 it'll also be announced on reddit 2012-01-05T18:17:32 that's a good didea 2012-01-05T18:17:35 yes 2012-01-05T18:17:52 I'll do that, thanks 2012-01-05T18:18:05 mattswe: there's going to be a change on aichallenge.org soon, we'll make it more game neutral 2012-01-05T18:18:09 more of a portal to the games 2012-01-05T18:18:18 we might get an rss feed there for the games 2012-01-05T18:18:23 amstan: what do you mean? 2012-01-05T18:18:47 Links to all the games 2012-01-05T18:18:49 just a simple page with links to the forum, the contests(newcontest, ants, tron, ...) 2012-01-05T18:18:53 github maybe 2012-01-05T18:19:03 cool 2012-01-05T18:19:12 btw, anyone wanna do that? 2012-01-05T18:19:12 ah, kk :) 2012-01-05T18:19:21 *** mleise has joined #aichallenge 2012-01-05T18:19:34 you might consider an announce mailing list 2012-01-05T18:21:26 nothing came up that impressed me for that 2012-01-05T18:22:07 *** Jak_o_Shadows has joined #aichallenge 2012-01-05T18:26:01 ahow984_: real 0m0.031s 2012-01-05T18:26:26 probably you couldnt measure its runtime on thestinger 's machine 2012-01-05T18:26:45 thats for #67 2012-01-05T18:27:11 my #67 is 50ms, with cpython 2012-01-05T18:27:13 :P 2012-01-05T18:27:43 *** Fandekasp has joined #aichallenge 2012-01-05T18:27:52 thestinger: well, mine is faster then 2012-01-05T18:27:55 a 2012-01-05T18:27:59 yeah, but you used haskell 2012-01-05T18:28:03 c++ 2012-01-05T18:28:07 oh 2012-01-05T18:28:13 http://sprunge.us/iVEW 2012-01-05T18:28:58 nice 2012-01-05T18:30:36 basically its a bfs 2012-01-05T18:30:55 *** dorisabayon has quit IRC (Ping timeout: 252 seconds) 2012-01-05T18:31:05 max(col + row_below[x], col + row_below[x + 1]) 2012-01-05T18:31:09 I just do that from the bottom up 2012-01-05T18:31:30 ah 2012-01-05T18:31:34 from bottom up 2012-01-05T18:32:08 so it starts at the second row from the bottom, and gets the biggest sum for each 2012-01-05T18:32:11 etc. 2012-01-05T18:32:40 i had that idea for the little problem but i thought it wont wokr 2012-01-05T18:32:47 i cant remember why 2012-01-05T18:33:05 *** X-Scale has quit IRC (Ping timeout: 268 seconds) 2012-01-05T18:33:21 i even have a sketch before me 2012-01-05T18:33:24 summing from the bottom 2012-01-05T18:33:41 *** epicmonkey has quit IRC (Remote host closed the connection) 2012-01-05T18:33:57 *** epicmonkey has joined #aichallenge 2012-01-05T18:34:36 *** denysonique_ has quit IRC (Remote host closed the connection) 2012-01-05T18:35:31 i dont get this 2012-01-05T18:36:14 *** X-Scale has joined #aichallenge 2012-01-05T18:36:15 theres a stupid skecth of summing up the little triangle like you said, and i decided not to do it that way 2012-01-05T18:36:27 *** X-Scale is now known as Guest14989 2012-01-05T18:36:51 O_o 2012-01-05T18:36:57 maybe i wasnt sure if it always give the largest value 2012-01-05T18:36:59 dunno 2012-01-05T18:37:21 anyway, i did it with a bfs from the top 2012-01-05T18:38:16 thestinger: but i like your python code 2012-01-05T18:38:30 i wonder if i could do a similar one in haskell 2012-01-05T18:38:45 without destructively updating the triangle[][] 2012-01-05T18:39:22 yep i could 2012-01-05T18:40:04 with open("triangle.txt", "r") as f: 2012-01-05T18:40:06 triangle = [(list(map(int, line[:-1].split()))) for line in f] 2012-01-05T18:40:09 this is powerful 2012-01-05T18:40:35 I could have actually made it more pythonic by removing map() 2012-01-05T18:40:38 its 15 lines in c++ 2012-01-05T18:40:42 and just doing it all in the list comprehension 2012-01-05T18:40:57 i want my map 2012-01-05T18:41:00 python list comprehensions are based on haskell's, but they use a syntax that looks like a for loop 2012-01-05T18:41:10 [x * x for x in range(10)] 2012-01-05T18:41:12 i will always pick map over list comprehension except when i need to write a lambda 2012-01-05T18:41:13 i know python 2012-01-05T18:41:14 but even then 2012-01-05T18:41:16 mcstar: ah :) 2012-01-05T18:41:17 (not like you) 2012-01-05T18:41:24 i just dont use it much 2012-01-05T18:41:39 I love it for hacking stuff together quickly, like this 2012-01-05T18:41:43 i even read about this with statement 2012-01-05T18:41:57 I love list comprehensions 2012-01-05T18:42:10 thestinger: i never felt comfortable editing python code 2012-01-05T18:42:14 what do you use? 2012-01-05T18:42:28 (i want something similar to common lisp"s repl in emacs: slime) 2012-01-05T18:42:30 vim 2012-01-05T18:42:36 unacceptable 2012-01-05T18:42:40 lol 2012-01-05T18:42:42 well 2012-01-05T18:42:42 for exploratory programming 2012-01-05T18:42:44 text objects are nice 2012-01-05T18:42:54 I have a plugin that turns indented blocks into text objects 2012-01-05T18:43:06 a text object is like iw (inner-word), i" (inner-quotes) 2012-01-05T18:43:49 i found ipython qtconsole the most useful 2012-01-05T18:43:54 bpython is nice 2012-01-05T18:44:03 there's vim-conque, which lets you run stuff inside a vim buffer 2012-01-05T18:44:08 https://code.google.com/p/conque/ 2012-01-05T18:44:12 makes it like emacs basically 2012-01-05T18:44:36 then it makes sense to use emacs instead 2012-01-05T18:44:42 meh 2012-01-05T18:44:48 :D 2012-01-05T18:45:22 text objects <3 2012-01-05T18:45:40 *** grc48 has joined #aichallenge 2012-01-05T18:45:52 thestinger: recently i found myself getting noticeably angry when i use vim 2012-01-05T18:46:06 still, from reflex, sometimes i open something up with it 2012-01-05T18:46:06 *** epicmonkey has joined #aichallenge 2012-01-05T18:46:27 (paradoxically, i edit .emacs frequently with vim) 2012-01-05T18:46:53 vim is really nice for python, I'm not sure if there's the same kind of support in emacs 2012-01-05T18:47:08 i always thought theres better support i emacs 2012-01-05T18:47:21 it always supported those "inferior shells" 2012-01-05T18:47:25 heard of them? 2012-01-05T18:47:46 *** denysonique_ has joined #aichallenge 2012-01-05T18:47:59 oh, so just a subshell in a buffer basically? 2012-01-05T18:48:15 it can interact with a dozen programs 2012-01-05T18:48:25 like the common lisp repl, the haskell repl 2012-01-05T18:48:28 the ocaml 2012-01-05T18:48:32 well, for example vim can be built with python support 2012-01-05T18:48:33 the name any other one 2012-01-05T18:48:44 and it has autocompletion etc. without plugins 2012-01-05T18:49:04 python and lua are actually the languages used to make vim plugins, if you aren't brain damaged (ugh... vimscript) 2012-01-05T18:49:08 can you send delimited regions to python? 2012-01-05T18:49:13 (guess you can) 2012-01-05T18:49:21 well, for example 2012-01-05T18:49:22 i know 2012-01-05T18:49:23 cai 2012-01-05T18:49:33 deletes a whole indented block and puts me in insert mode 2012-01-05T18:49:52 ai is a "an indented block" (a text object) added by a plugin 2012-01-05T18:50:06 ii is "inner indented block" 2012-01-05T18:50:29 vim comes with many text objects but you need to make those with ~15 lines of code (or use a premade plugin) 2012-01-05T18:50:41 but you have to exit insert mode to send regions to the buffer 2012-01-05T18:51:03 that's not that bad :P 2012-01-05T18:51:12 caps lock is bound to escape 2012-01-05T18:51:22 or ^c 2012-01-05T18:51:27 yeah 2012-01-05T18:51:39 i have insert on space 2012-01-05T18:51:48 and replace is bound to insert 2012-01-05T18:51:50 in my config 2012-01-05T18:51:59 i hate eccidentally entering replace mode 2012-01-05T18:52:03 A 2012-01-05T18:52:23 you rebound A to that? :P 2012-01-05T18:52:32 ac... 2012-01-05T18:53:08 I also like clang_complete a lot, because I don't need to refer to C++ docs 2012-01-05T18:53:11 (but i still have to admit, c++ is best edited in kdevelop) 2012-01-05T18:53:19 ah 2012-01-05T18:53:20 yes 2012-01-05T18:53:22 and it finds syntax errors, etc. 2012-01-05T18:53:25 yep 2012-01-05T18:53:37 it's a vim plugin, but someone could write an emacs version 2012-01-05T18:53:39 i use kdevelop because of this) 2012-01-05T18:53:45 xcode uses it I guess, so it's part of clang 2012-01-05T18:54:22 thestinger: and do you use vim or gvim? 2012-01-05T18:54:31 gvim, but set up to look like vim basically 2012-01-05T18:54:34 gvim has nicer colors 2012-01-05T18:54:38 yes 2012-01-05T18:54:48 and fonts 2012-01-05T18:54:58 yeah, a bit nicer 2012-01-05T18:55:03 urxvt uses libxft which is crap 2012-01-05T18:55:32 i have mrxvt on my latop 2012-01-05T18:55:32 I use Consolas and it looks awful without freetype2-infinality 2012-01-05T18:55:43 +1 for infinality 2012-01-05T18:55:56 also, gvim has 'a' for guioptions 2012-01-05T18:56:10 which automatically puts anything you select in visual mode into the SELECTION clipboard buffer in X 2012-01-05T18:57:02 aaa 2012-01-05T18:57:05 soo boring 2012-01-05T18:57:15 im reading about const declarations in c++ 2012-01-05T18:57:16 *** amstan_ has joined #aichallenge 2012-01-05T18:57:16 *** ChanServ sets mode: +o amstan_ 2012-01-05T18:57:27 who the f wants a const return value 2012-01-05T18:57:36 mcstar: const references too :P 2012-01-05T18:57:42 const iterators 2012-01-05T18:57:54 const const iterators even -_- 2012-01-05T18:58:07 mcstar: have you used the C++11 function syntax yet? 2012-01-05T18:58:19 what do you mean? 2012-01-05T18:58:23 I don't think you can write a generic sum(container) for example without it 2012-01-05T18:58:27 well 2012-01-05T18:58:32 int something(int i) { } 2012-01-05T18:58:40 auto something(int i) -> int { } 2012-01-05T18:58:44 the second is the new syntax 2012-01-05T18:58:49 lets you use an inferred type 2012-01-05T18:58:50 i didnt need it to 2012-01-05T18:58:55 and decltype 2012-01-05T18:58:58 and ... 2012-01-05T18:59:04 and constexpr 2012-01-05T18:59:16 constexpr is barely useful 2012-01-05T18:59:47 i dont have any practical example :) 2012-01-05T19:00:16 thestinger: hm 2012-01-05T19:00:22 whats the point of that example? 2012-01-05T19:00:25 none 2012-01-05T19:00:26 auto something(int i) -> int { } 2012-01-05T19:00:27 lol 2012-01-05T19:00:28 ? 2012-01-05T19:00:31 just shows the syntax 2012-01-05T19:00:41 auto something(int i) -> decltype(something) { } 2012-01-05T19:00:42 auto something(int i, float f) -> decltype(i*f) { } 2012-01-05T19:00:45 yeah 2012-01-05T19:01:05 or you can use stuff derived from templates 2012-01-05T19:01:50 template auto something(int i) -> typename T::value_type { } 2012-01-05T19:01:53 I think that's the right syntax 2012-01-05T19:02:18 i dont get it 2012-01-05T19:02:26 well, lets say T is a std::vector 2012-01-05T19:02:30 T::value_type is int 2012-01-05T19:02:39 i didnt know about that 2012-01-05T19:02:47 (ive seen it in errors) 2012-01-05T19:02:57 templated classes can define typedefs like that 2012-01-05T19:03:11 like there's std::remove_reference 2012-01-05T19:03:24 so you can turn 'int &' into 'int' 2012-01-05T19:03:26 etc. 2012-01-05T19:03:29 well, for types 2012-01-05T19:03:44 what a nightmare this language becomes 2012-01-05T19:03:49 lol, yeah 2012-01-05T19:04:02 mcstar: btw, you know they have a generic fold in the standard library? 2012-01-05T19:04:06 you can make your own easily anyway 2012-01-05T19:04:19 fold? 2012-01-05T19:04:28 as in list folding? 2012-01-05T19:04:32 yes 2012-01-05T19:04:50 std::accumulate(v.begin(), v.end(), 1, mul); 2012-01-05T19:04:58 that's product() for any standard lib container 2012-01-05T19:05:00 etc. 2012-01-05T19:05:16 i didnt pay much attention to it 2012-01-05T19:05:37 but theres somethign in it i like 2012-01-05T19:05:43 namely the end itarator 2012-01-05T19:05:53 in a funtional language you have to fold the whole list 2012-01-05T19:06:03 or else you mess up your folder function 2012-01-05T19:06:33 hm 2012-01-05T19:06:36 letme think 2012-01-05T19:06:46 http://sprunge.us/MKCg I have stuff like this left over from Ants 2012-01-05T19:07:23 because I was using vectors as unordered sets for speed 2012-01-05T19:07:49 sure 2012-01-05T19:07:58 (what is this guy talking about?) 2012-01-05T19:08:18 std::move is pretty neat 2012-01-05T19:09:28 *** replore_ has joined #aichallenge 2012-01-05T19:10:18 anyway, C++ is insane 2012-01-05T19:10:22 so many features 2012-01-05T19:10:30 I haven't even really learned the OOP stuff like virtual methods yet 2012-01-05T19:10:43 i know what they are for 2012-01-05T19:10:48 yeah 2012-01-05T19:10:51 I don't code like that though 2012-01-05T19:10:56 "without them theres no real oop" 2012-01-05T19:11:12 well, I'm pretty sure I hate real OOP... 2012-01-05T19:11:19 thestinger: you dont have the problem to code like that 2012-01-05T19:11:26 when python libraries force me to use it pisses me off 2012-01-05T19:11:42 , it pisses me off* 2012-01-05T19:11:59 they force you to inherit from some class and implement random magic methods 2012-01-05T19:12:01 well, i think it might fit for gui programming 2012-01-05T19:12:07 you have a lot of state there 2012-01-05T19:12:13 yeah 2012-01-05T19:12:32 thestinger: did you code i qt? 2012-01-05T19:12:39 no, haven't used Qt 2012-01-05T19:12:50 I've done GUI stuff with javascript and I hate it :P 2012-01-05T19:12:52 i felt in my brief excursion to qt land, that it is well designed 2012-01-05T19:13:16 well, javascript is just a pretty crappy language 2012-01-05T19:13:38 you sound like you should learn cl 2012-01-05T19:13:56 *** Garf has quit IRC (Quit: Make a new plan, Stan!) 2012-01-05T19:14:13 it basically gives you the best part of all of this 2012-01-05T19:14:16 really 2012-01-05T19:14:27 except haskells type system 2012-01-05T19:14:38 and theres no built-in lazyness 2012-01-05T19:14:51 but otherwise its a perfect language 2012-01-05T19:14:54 *** amstan__ has joined #aichallenge 2012-01-05T19:14:54 *** ChanServ sets mode: +o amstan__ 2012-01-05T19:14:54 *** amstan has quit IRC (Quit: Konversation terminated!) 2012-01-05T19:15:23 *** amstan__ has quit IRC (Remote host closed the connection) 2012-01-05T19:15:28 mcstar: I really like python, but it's really lacking in the functional programming area 2012-01-05T19:16:09 thestinger: you seem like a smart fellow who can handle languages, i really think you could benefit from learning cl 2012-01-05T19:16:11 really 2012-01-05T19:16:21 just do it(TM) 2012-01-05T19:16:22 yeah, I should learn it 2012-01-05T19:16:29 too many things to learn though 2012-01-05T19:16:36 haha 2012-01-05T19:16:38 yeahj 2012-01-05T19:17:00 i think i cut back on programming for a couple of days and do some physics 2012-01-05T19:19:13 *** grc48 has quit IRC (Quit: This computer has gone to sleep) 2012-01-05T19:19:14 *** epicmonkey has quit IRC (Remote host closed the connection) 2012-01-05T19:19:48 *** epicmonkey has joined #aichallenge 2012-01-05T19:21:43 *** xathis has joined #aichallenge 2012-01-05T19:29:29 hey mcstar 2012-01-05T19:29:40 yes? 2012-01-05T19:29:49 did bfs work for you for #18 and #67? 2012-01-05T19:30:08 I don't see how thats shorter then brute force.... 2012-01-05T19:30:15 it runs 4 times faster than thestinger's python code 2012-01-05T19:30:22 on my machine 2012-01-05T19:30:30 so it means its a worse algoritm 2012-01-05T19:30:30 thats an achievement :) 2012-01-05T19:30:34 no 2012-01-05T19:30:41 c++ vs python 2012-01-05T19:30:48 it should be much faster :) 2012-01-05T19:30:52 i7 vs dual core? 2012-01-05T19:30:54 :P 2012-01-05T19:31:03 no, on my machine 2012-01-05T19:31:08 oh 2012-01-05T19:31:11 still fast enough 2012-01-05T19:31:18 31ms vs 200 ms 2012-01-05T19:31:27 did you ever do them olympiad things? 2012-01-05T19:31:37 I'm doing one tomorrow if you want to see the problems? 2012-01-05T19:31:39 what kind of? 2012-01-05T19:31:44 programming 2012-01-05T19:31:46 in physics an math 2012-01-05T19:31:48 d 2012-01-05T19:31:55 but little success 2012-01-05T19:31:56 mostly just math 2012-01-05T19:32:04 oh, you did do them :) 2012-01-05T19:32:23 it was some high-school coutry wide thing 2012-01-05T19:32:30 yeah 2012-01-05T19:32:42 I came 4th in .ie last year with programming :) 2012-01-05T19:32:51 and going to come 1st this year ;) 2012-01-05T19:32:57 hm 2012-01-05T19:33:04 I might be doing the math one this year too 2012-01-05T19:33:12 (Ireland's standard is really low lol) 2012-01-05T19:33:26 im wondering if i knew how to program recursively when i was your age 2012-01-05T19:33:47 i was messing around with lcc-win32 2012-01-05T19:33:50 but yeah, the USA let anyone do their contests so I'm signed up for one tomorrow :P 2012-01-05T19:34:18 good luck 2012-01-05T19:34:24 ty 2012-01-05T19:34:31 it's not serious for me 2012-01-05T19:34:37 just practise for the irish one :) 2012-01-05T19:35:00 just make sure to kick ass 2012-01-05T19:35:54 recursion blows my mind, not in a good way 2012-01-05T19:36:06 pairofdice: join the club :P 2012-01-05T19:36:21 mcstar: managed to teach me a little though :) 2012-01-05T19:37:51 once you understand the cons cell, you understand it all 2012-01-05T19:38:07 cons cell? 2012-01-05T19:38:31 yes 2012-01-05T19:38:42 @google lucky cons cell 2012-01-05T19:38:43 pairofdice: http://en.wikipedia.org/wiki/Cons 2012-01-05T19:38:56 http://en.wikipedia.org/wiki/Cons 2012-01-05T19:39:25 oh jesus.... 2012-01-05T19:40:15 why are they important? 2012-01-05T19:40:31 thats the structure of a list 2012-01-05T19:40:42 the very basic data structure you can have 2012-01-05T19:40:48 oh 2012-01-05T19:40:57 List in C++ is a separate data type 2012-01-05T19:41:11 separate from what? 2012-01-05T19:41:26 sorry 2012-01-05T19:41:35 as in #include 2012-01-05T19:41:39 not native 2012-01-05T19:41:50 anyway, lists in c++ are awkward 2012-01-05T19:41:58 yes, they're horrible 2012-01-05T19:41:59 you cant really do fun stuff with them 2012-01-05T19:42:08 I forced myself to use one to try and learn but bleh 2012-01-05T19:42:19 hm 2012-01-05T19:42:28 we arent talking about the same things probably 2012-01-05T19:42:52 LIFO data structure? 2012-01-05T19:43:11 I thought there was only one type of list... 2012-01-05T19:44:32 by list i mean a singly linked cell string 2012-01-05T19:44:35 anyway 2012-01-05T19:45:07 my point was, that i said its awkward in c++ because you have to imperatively define variables 2012-01-05T19:45:32 but in funtional languages the list is more basic, and you can just throw them around 2012-01-05T19:45:46 hmm 2012-01-05T19:46:01 and im guessing, you just didnt like them because of the interface? 2012-01-05T19:46:58 yes :P 2012-01-05T19:49:10 getting late 2012-01-05T19:49:32 i watch a couple of k1 rounds, and im ko 2012-01-05T19:49:42 bb 2012-01-05T19:49:45 *** mcstar has quit IRC (Quit: mcstar) 2012-01-05T19:57:59 *** ahow984_ has quit IRC (Quit: Lost terminal) 2012-01-05T20:06:51 *** srgpqt has joined #aichallenge 2012-01-05T20:09:09 *** ntnix has quit IRC (Remote host closed the connection) 2012-01-05T20:13:37 *** grc48 has joined #aichallenge 2012-01-05T20:19:08 *** Guest14989 is now known as X-Scale 2012-01-05T20:49:38 *** amstan_ has quit IRC (Remote host closed the connection) 2012-01-05T20:57:34 * antimatroid is still upset that go wont allow open brackets on newlines 2012-01-05T20:57:41 it's so much more aesthetically pleasing 2012-01-05T21:08:28 *** amstan has joined #aichallenge 2012-01-05T21:08:28 *** ChanServ sets mode: +o amstan 2012-01-05T21:09:26 And imot less confusing 2012-01-05T21:09:29 imo* 2012-01-05T21:09:45 *** Akranis has quit IRC (Quit: Lämnar) 2012-01-05T21:10:39 *** chris_0076 has quit IRC (Quit: Leaving) 2012-01-05T21:12:25 yeah 2012-01-05T21:13:41 *** Chris_0076 has joined #aichallenge 2012-01-05T21:13:44 *** alehorst1 has joined #aichallenge 2012-01-05T21:17:29 *** epicmonkey has quit IRC (Ping timeout: 240 seconds) 2012-01-05T21:20:33 Mmm, I like the Obsidian color theme 2012-01-05T21:27:40 *** dorisabayon has joined #aichallenge 2012-01-05T21:27:47 *** replore_ has quit IRC (Remote host closed the connection) 2012-01-05T21:29:41 *** amstan_ has joined #aichallenge 2012-01-05T21:29:41 *** ChanServ sets mode: +o amstan_ 2012-01-05T21:31:55 *** Fandekasp has quit IRC (Ping timeout: 268 seconds) 2012-01-05T21:33:38 *** amstan has quit IRC (Ping timeout: 240 seconds) 2012-01-05T21:34:34 https://projecteuler.net/problem=59 a fun one :) 2012-01-05T21:37:56 *** Chris_0076 has quit IRC (Quit: Leaving) 2012-01-05T21:38:35 *** Chris_0076 has joined #aichallenge 2012-01-05T21:40:21 *** grc48 has quit IRC (Quit: This computer has gone to sleep) 2012-01-05T21:40:28 Oh, yeah 2012-01-05T21:40:56 *** amstan_ has quit IRC (Quit: Konversation terminated!) 2012-01-05T21:43:16 *** amstan has joined #aichallenge 2012-01-05T21:43:16 *** ChanServ sets mode: +o amstan 2012-01-05T21:46:36 have you guys done the poker one? 2012-01-05T21:46:43 i tried it ages ago and couldn't work out what i messed up 2012-01-05T21:46:47 might try that again later 2012-01-05T21:48:00 which number? 2012-01-05T21:48:43 *** grc48 has joined #aichallenge 2012-01-05T21:56:00 hmmm 2012-01-05T21:56:22 54 2012-01-05T21:56:42 haven't tried that yet 2012-01-05T21:56:44 I 2012-01-05T21:56:51 I'll try after I finish this one* 2012-01-05T21:57:03 it should be pretty easy 2012-01-05T21:59:43 there's a book i'm reading which is awesome except for one piece of horrible notation 2012-01-05T22:00:05 for a funtion f:X->Y and x \in X the denote it as x.f instead of f(x) or f.x 2012-01-05T22:00:57 *** TheLinker has quit IRC (Quit: Bye) 2012-01-05T22:06:52 *** Blkt has quit IRC (Remote host closed the connection) 2012-01-05T22:08:41 *** grc48 has quit IRC (Quit: This computer has gone to sleep) 2012-01-05T22:08:56 *** deltree_ has joined #aichallenge 2012-01-05T22:11:37 *** amstan has quit IRC (Quit: Konversation terminated!) 2012-01-05T22:12:02 *** amstan has joined #aichallenge 2012-01-05T22:12:02 *** ChanServ sets mode: +o amstan 2012-01-05T22:13:13 *** amstan has quit IRC (Client Quit) 2012-01-05T22:18:13 *** amstan has joined #aichallenge 2012-01-05T22:18:13 *** ChanServ sets mode: +o amstan 2012-01-05T22:23:21 *** Jak_o_Shadows1 has joined #aichallenge 2012-01-05T22:24:04 I did it :) 2012-01-05T22:24:32 :) 2012-01-05T22:24:36 how many problems have you got out now? 2012-01-05T22:25:00 *** JorgeB has quit IRC (Quit: Computer has gone to sleep.) 2012-01-05T22:25:46 *** Jak_o_Shadows has quit IRC (Ping timeout: 276 seconds) 2012-01-05T22:26:57 i get another award if i solve 243 2012-01-05T22:28:29 107 should be easy for you guys 2012-01-05T22:28:32 if you haven't done it 2012-01-05T22:29:31 well, I solved that decoding one 2012-01-05T22:29:49 you're one problem ahead of me 2012-01-05T22:29:50 it's on 2012-01-05T22:29:58 I'm not doing them in order 2012-01-05T22:30:02 neither 2012-01-05T22:30:11 oh 2012-01-05T22:30:16 I see :) 2012-01-05T22:30:35 we both did the dice game :) 2012-01-05T22:31:19 81-83 are basic path finding 2012-01-05T22:31:19 I just dd 59 2012-01-05T22:31:22 one of the most fun 2012-01-05T22:31:24 *** TheLinker has joined #aichallenge 2012-01-05T22:37:56 oh, forgot to enter that answer 2012-01-05T22:37:58 there 2012-01-05T22:38:25 i prodded my friend about project euler 2012-01-05T22:38:28 he's solved 70 2012-01-05T22:38:31 including the first 50 2012-01-05T22:40:14 I'll do 81 to 83 then next 2012-01-05T22:40:53 do 83 first 2012-01-05T22:41:05 then you should be able to just restrict the movement for the other two 2012-01-05T22:42:32 oh, that's easy :D 2012-01-05T22:42:40 yep :P 2012-01-05T22:42:57 anyway, 59 was fun 2012-01-05T22:43:01 maybe not in C++ 2012-01-05T22:43:31 I really love list comprehensions and functional stuff (partial functions, etc.) for this 2012-01-05T22:44:05 yeah i need to learn some new languages anyway 2012-01-05T22:44:22 ants got me interested in programming again 2012-01-05T22:44:27 i was fairly meh about it for a while 2012-01-05T22:52:15 *** deltree__ has joined #aichallenge 2012-01-05T22:53:56 *** TheLinker has quit IRC (Quit: Bye) 2012-01-05T22:55:01 *** deltree_ has quit IRC (Ping timeout: 248 seconds) 2012-01-05T22:57:49 *** TheLinker has joined #aichallenge 2012-01-05T23:03:11 *** JorgeB has joined #aichallenge 2012-01-05T23:11:04 oh... I was trying to submit the answer to 83 to the 81 box... 2012-01-05T23:11:11 hehe 2012-01-05T23:15:08 *** replore_ has joined #aichallenge 2012-01-05T23:17:38 *** amstan has quit IRC (Ping timeout: 240 seconds) 2012-01-05T23:23:19 *** Israfel has quit IRC (Read error: Operation timed out) 2012-01-05T23:31:04 antimatroid: anyway, I barely even did a graph search for those :P 2012-01-05T23:32:06 just made a generator function to yield adjacent nodes 2012-01-05T23:32:32 it would have been nice to code my ants bot in python, but sadly it's way too slow :( 2012-01-05T23:36:15 antimatroid: how did you do 99? logarithms? 2012-01-05T23:36:24 I guess it's fast since you just use floats 2012-01-05T23:38:39 *** Israfel has joined #aichallenge 2012-01-05T23:41:49 yup, that worked 2012-01-05T23:52:21 anyway, I feel bad for coding python like this http://sprunge.us/BhhD