2012-01-04T00:33:34 *** JorgeB has joined #aichallenge 2012-01-04T00:44:04 *** dorisabayon has joined #aichallenge 2012-01-04T00:47:34 *** Fandekasp has quit IRC (Ping timeout: 268 seconds) 2012-01-04T00:48:09 *** cyphase has quit IRC (Ping timeout: 240 seconds) 2012-01-04T01:01:06 *** cyphase has joined #aichallenge 2012-01-04T01:19:56 *** ltriant has quit IRC (Quit: Computer has gone to sleep) 2012-01-04T01:30:17 *** grc48 has quit IRC (Ping timeout: 252 seconds) 2012-01-04T01:32:01 *** grc48 has joined #aichallenge 2012-01-04T01:44:08 *** grc48 has quit IRC (Ping timeout: 240 seconds) 2012-01-04T01:45:43 *** grc48 has joined #aichallenge 2012-01-04T01:47:38 *** Xunie` has quit IRC (Ping timeout: 255 seconds) 2012-01-04T01:48:02 *** Garf has joined #aichallenge 2012-01-04T01:52:07 *** jstrong has quit IRC (Quit: Leaving.) 2012-01-04T01:57:39 *** treeform has quit IRC (Remote host closed the connection) 2012-01-04T02:03:27 *** treeform has joined #aichallenge 2012-01-04T02:23:02 *** mcstar has joined #aichallenge 2012-01-04T02:26:57 *** mcstar has quit IRC (Client Quit) 2012-01-04T02:56:18 *** Palmik has joined #aichallenge 2012-01-04T03:01:16 *** Varan has joined #aichallenge 2012-01-04T03:04:40 *** Varan has quit IRC (Client Quit) 2012-01-04T03:10:42 *** Kurnevsky has joined #aichallenge 2012-01-04T03:19:15 *** treeform has quit IRC (Remote host closed the connection) 2012-01-04T03:20:18 *** sigh has joined #aichallenge 2012-01-04T03:24:50 *** mcstar has joined #aichallenge 2012-01-04T03:27:57 *** kire has joined #aichallenge 2012-01-04T03:44:14 *** Fandekasp has joined #aichallenge 2012-01-04T03:47:08 *** dorisabayon has quit IRC (Ping timeout: 240 seconds) 2012-01-04T03:54:42 *** epicmonkey has joined #aichallenge 2012-01-04T04:47:00 *** Fandekasp has quit IRC (Ping timeout: 248 seconds) 2012-01-04T04:52:01 *** sigh has quit IRC (Remote host closed the connection) 2012-01-04T04:54:04 *** smjms has joined #aichallenge 2012-01-04T05:01:01 *** liberforce has joined #aichallenge 2012-01-04T05:01:28 *** liberforce has left #aichallenge 2012-01-04T05:03:40 *** sigh has joined #aichallenge 2012-01-04T05:33:35 *** Fandekasp has joined #aichallenge 2012-01-04T05:56:46 *** sashaSochka has joined #aichallenge 2012-01-04T06:11:21 *** amstan has quit IRC (Read error: Connection reset by peer) 2012-01-04T06:11:34 *** Blkt has joined #aichallenge 2012-01-04T06:12:20 good day everyone 2012-01-04T06:17:21 *** UncleVasya has joined #aichallenge 2012-01-04T06:33:39 *** QuirionPT has joined #aichallenge 2012-01-04T06:44:48 *** dorisabayon has joined #aichallenge 2012-01-04T06:47:16 *** Fandekasp has quit IRC (Ping timeout: 240 seconds) 2012-01-04T06:48:23 *** foucist has joined #aichallenge 2012-01-04T06:49:00 *** Jak_o_Shadows has quit IRC (Ping timeout: 244 seconds) 2012-01-04T06:57:13 *** alc has quit IRC (Ping timeout: 252 seconds) 2012-01-04T06:59:47 *** sorki has quit IRC (Read error: Operation timed out) 2012-01-04T07:12:38 *** rintaun has left #aichallenge 2012-01-04T07:12:46 *** grc48 has left #aichallenge ("Leaving") 2012-01-04T07:24:10 who's awake? 2012-01-04T07:27:05 *** okke has joined #aichallenge 2012-01-04T07:27:16 *** okke has quit IRC (Client Quit) 2012-01-04T07:30:01 *** Gorgoroth has joined #aichallenge 2012-01-04T07:31:29 *** Gorgoroth has left #aichallenge 2012-01-04T07:43:02 *** chris_0076 has quit IRC (Read error: Connection reset by peer) 2012-01-04T07:46:06 foucist: I am. 2012-01-04T07:48:09 UncleVasya: cool, what are the plans for the next contest? 2012-01-04T07:51:43 If I'm right there is no any official info yet. But from talks here it seems that Asteroids is candidate #1. People was talking about game mechanic. I'm nt sure, but some guys implementing some kind of demo. 2012-01-04T07:52:14 ah 2012-01-04T07:52:22 no dates yet 2012-01-04T07:52:32 darn, i wanted to suggest Sean O'Conner's Slay game 2012-01-04T07:52:38 hex-based strategy game heh 2012-01-04T07:52:54 well, it would suck if it was only 2 players though 2012-01-04T07:52:59 you can suggest it on forums. 2012-01-04T07:53:02 yeah 2012-01-04T07:57:07 nothing new on github also 2012-01-04T07:58:00 *** foRei has joined #aichallenge 2012-01-04T07:59:11 foucist: Also I forgot to say that there is a lot of talks about including communication protocol between bots for the next contest. 2012-01-04T07:59:31 So you'll be able to betray :) 2012-01-04T08:00:32 heh nice 2012-01-04T08:01:12 foucist: http://forums.aichallenge.org/viewtopic.php?f=21&t=2122&start=10 2012-01-04T08:02:23 reminds me of the prisoner's dilemma "ai" contest.. submissions on various algorithms were made by experts etc, but the winner submitted from a regular guy, was the simple 'tit-for-tat' strategy 2012-01-04T08:02:27 two years in a row 2012-01-04T08:03:01 communication protocol/betray etc might be mostly 'tit-for-tat' by the winning algorithms :P 2012-01-04T08:06:10 UncleVasya: i presented this to the haskell community http://codepad.org/jwtEVBps 2012-01-04T08:07:15 I had a dream today where I understood your code. Being awaken I sadly realized it was just a dream :) 2012-01-04T08:07:22 *tonight 2012-01-04T08:07:59 XD 2012-01-04T08:08:05 it cant be that bad... 2012-01-04T08:08:14 What did they said? 2012-01-04T08:08:26 did-say 2012-01-04T08:08:43 well, they didnt give me a better solution 2012-01-04T08:08:50 but they were interested 2012-01-04T08:09:36 maybe someone will code up something 2012-01-04T08:09:51 anyway, it seems the algorithm doesnt originate from that page i showed you 2012-01-04T08:10:06 it is much older, comes from india or something, from 14th century 2012-01-04T08:10:13 doesnt matter 2012-01-04T08:10:26 You mean you want them to include your code to the standart library? 2012-01-04T08:10:29 it seems it is hard to do it immutably 2012-01-04T08:10:37 not mine 2012-01-04T08:10:53 but a similar functioning code is needed besides Data.List permutations function 2012-01-04T08:11:03 but if there are no other code .... XD 2012-01-04T08:11:28 i talked to the guy that took part in writing the original one 2012-01-04T08:11:56 "it was fun re-inventing it for Data.List in haskell" 2012-01-04T08:12:18 "that was a long time ago. it can probably be improved. if you're thinking about those things, have a look. :)" 2012-01-04T08:14:24 Is it a always works for programmers? Include ':)' if you want your work to be done by someone else :D 2012-01-04T08:15:19 this is the spirit of the open-source community 2012-01-04T08:22:05 *** QuirionPT has quit IRC (Quit: Leaving) 2012-01-04T08:22:37 So what you have changed in your algorithm comparing to 'our' version? 2012-01-04T08:25:41 *** alehorst has quit IRC (Read error: Connection reset by peer) 2012-01-04T08:28:10 UncleVasya: i only have 1 reverse, the one that is explicitely said in the imperative alg. description 2012-01-04T08:28:45 and because of this, i assemble the result very differently 2012-01-04T08:29:23 *** GeorgeSebastian has joined #aichallenge 2012-01-04T08:56:17 *** ahow984_ has joined #aichallenge 2012-01-04T08:56:47 aerique: i have an idea: id make the asteroids some kind of accumulators, the spaceship could fire a given "number" at them, that number identifies an enemy, the bigger the accumulated value for that id is, the faster the asteroid approaches that enemy, multiple spaceships can fire at a give asteroid, so players can balance it, but asteroids have a limit to this accumulation, when this value is exceeded, 2012-01-04T08:56:49 the asteroid explodes 2012-01-04T08:57:44 (and there can be some variations on this theme...) 2012-01-04T08:59:02 maybe after the explosion(whici is more or less random) the parts need some "cool down" time, before ships can shoot at them again 2012-01-04T08:59:31 although I didn't compete in planet wars, it sounds very similar 2012-01-04T09:00:00 no, ver different gameplay. 2012-01-04T09:00:04 *very 2012-01-04T09:00:11 hmm, ok' 2012-01-04T09:00:32 I believe you seeing as I don't know much about planet wars 2012-01-04T09:01:02 planet wars only had one dimension: time 2012-01-04T09:01:18 and the environment was static also 2012-01-04T09:01:31 (capacities couldnt change,..) 2012-01-04T09:01:31 true 2012-01-04T09:02:40 aerique is never here :( 2012-01-04T09:02:52 or we're always here ;) 2012-01-04T09:04:08 mcstar: did you look at amstans asteroids prototype? 2012-01-04T09:04:22 i just cloned it 2012-01-04T09:04:33 me too :) 2012-01-04T09:05:49 But I can't launch it now, I need pyQT. And maybe something else. And maybe something more because of Win. 2012-01-04T09:05:54 so its looking increasingly like xpilot? 2012-01-04T09:06:13 i never played that one 2012-01-04T09:06:26 me too 2012-01-04T09:06:42 I haven't I'll install it now though :P 2012-01-04T09:08:05 damn 2012-01-04T09:08:14 i messed up something 2012-01-04T09:08:19 i cloned the aichallenge repo 2012-01-04T09:08:37 how can i select branches? 2012-01-04T09:09:00 I am gui-guy, can not help :) 2012-01-04T09:09:39 The only advance I can give is 'Look for a button Branch' but you are in shell, right? 2012-01-04T09:09:45 *advice 2012-01-04T09:11:13 got it 2012-01-04T09:11:47 m 2012-01-04T09:11:49 hm 2012-01-04T09:13:05 its good that its in python, otherwise i might hack on it a bit 2012-01-04T09:14:18 wow 2012-01-04T09:14:27 xpilot would be a great game for aichallenge.... 2012-01-04T09:14:39 *** dorisabayon has quit IRC (Ping timeout: 252 seconds) 2012-01-04T09:15:08 ahow984_: remember, that it is not good to chose very complicated rules 2012-01-04T09:15:12 o 2012-01-04T09:15:30 yeah 2012-01-04T09:15:35 i dont know about xpilot per say, but most games for "humans" have complicated rules 2012-01-04T09:15:39 but it doesn't seem too complicated 2012-01-04T09:16:49 *** mayanks43 has quit IRC (Ping timeout: 240 seconds) 2012-01-04T09:16:57 *** mayanks43 has joined #aichallenge 2012-01-04T09:17:37 ahow984_: why dont you change your name back to conor? 2012-01-04T09:18:05 *** foucist has left #aichallenge 2012-01-04T09:18:07 because I'm also in #android-dev and they require a registered nick 2012-01-04T09:18:24 and I'm not that bothered too register a 3rd nick for myself on freenode :P 2012-01-04T09:23:31 UncleVasya: seems there are debugging function in the Debug module, so you can be functional and still print with haskell, just got the info 2012-01-04T09:25:43 If I remember correctly you are reading c++ now... :D 2012-01-04T09:26:42 *** Fandekasp has joined #aichallenge 2012-01-04T09:28:13 yes, actually 2012-01-04T09:28:31 seems to me the two languages dont interfere with each other ... 2012-01-04T09:28:46 so are you guys helping out with making the next aichallenge? 2012-01-04T09:29:07 if ill have time and enthusiasm 2012-01-04T09:29:13 sure would like to 2012-01-04T09:29:25 and what sort of stuff do you have to do? 2012-01-04T09:29:40 writing my thesis, and getting a job 2012-01-04T09:29:49 maybe in reverse order 2012-01-04T09:30:15 :P I meant with helping aichallenge 2012-01-04T09:30:21 but gl with your degree :) 2012-01-04T09:30:29 oh 2012-01-04T09:31:03 that asteroids game seems a little simplistic, id be glad to hear what aerique thinks of my addition 2012-01-04T09:31:12 i definitely think something like that is needed 2012-01-04T09:31:28 but a full blown xpilot game might be too much eiher, i duno 2012-01-04T09:32:07 id like to contribute some tool that makes the contestants' life easier, but i dont yet know what that might be 2012-01-04T09:32:38 I think I'll wait until its up and make a simple android app for it 2012-01-04T09:32:50 maybe, depending on my android-dev knowledge at that time 2012-01-04T09:32:59 *** jcdjcd has left #aichallenge ("Leaving") 2012-01-04T09:33:26 the whole engine on android? 2012-01-04T09:33:33 no 2012-01-04T09:33:33 mcstar: hmm, are you going to steal my customers? (AntsTesting) 2012-01-04T09:33:59 just a simple interface with the site, updates with your rank 2012-01-04T09:34:18 It depends on what the site does I suppose 2012-01-04T09:34:23 ahow984_: ok, that makes sense :) 2012-01-04T09:34:34 UncleVasya: something like i did for this challenge 2012-01-04T09:34:52 not that lauch/testing app you had 2012-01-04T09:34:55 something more specific 2012-01-04T09:34:58 what you did? How could I miss it? 2012-01-04T09:35:07 *** Fandekasp has quit IRC (Ping timeout: 276 seconds) 2012-01-04T09:35:11 you dont know about Ants-Fight? 2012-01-04T09:35:44 * ahow984_ doesn't either.... 2012-01-04T09:35:45 I've heard about some BattleEngine but don't know anymore. 2012-01-04T09:36:11 you could place ants on the board, and resolve the battle situation 2012-01-04T09:36:15 *** smiley1983 has joined #aichallenge 2012-01-04T09:36:26 i thought i showed you that... 2012-01-04T09:36:29 huh, I didn't hear anything like that 2012-01-04T09:36:40 i even installed win7 into a wm, to build a windows version 2012-01-04T09:36:45 wm->vm 2012-01-04T09:37:34 When we'll both have a time, you'll show me, ok? 2012-01-04T09:37:55 UncleVasya: https://minus.com/liquid-phynix you can download a windows version 2012-01-04T09:38:03 and the source is on github 2012-01-04T09:38:05 What it is writen in? 2012-01-04T09:38:10 c++0x 2012-01-04T09:38:16 + qt 2012-01-04T09:38:36 I need a link to your github profile. 2012-01-04T09:38:48 https://github.com/liquid-phynix 2012-01-04T09:39:18 UncleVasya: congratulations on being #1 OCaml programmer :) 2012-01-04T09:39:52 antimatroid: congratulations on being #1 Australian programmer :) 2012-01-04T09:40:00 Last night was lucky for me. 2012-01-04T09:41:01 smiley1983: I don't have any explanation why you ranked lower than me. 2012-01-04T09:41:16 My own tests indicated yours was stronger 1v1, so I think you thoroughly deserved the victory 2012-01-04T09:42:30 How you are doing with your web-project? 2012-01-04T09:42:47 did you share exe's? 2012-01-04T09:43:02 haven't contacted the person I'm working with since end of AI challenge :) 2012-01-04T09:43:14 mcstar: no, after we released our sources at the end 2012-01-04T09:43:23 *** srk has joined #aichallenge 2012-01-04T09:44:01 smiley1983: You are the most right person to answer that question: 2012-01-04T09:45:13 http://codepad.org/yuD18B1n 2012-01-04T09:45:14 http://codepad.org/prXLnKQk 2012-01-04T09:45:14 http://codepad.org/D7CfUrD9 2012-01-04T09:45:14 http://codepad.org/jwtEVBps 2012-01-04T09:45:53 Can you sort them from 'I like more' to 'I like less'? 2012-01-04T09:47:17 * UncleVasya is really happy because there is no anti-paste bot on this channel 2012-01-04T09:48:06 heh 2012-01-04T09:48:11 XD 2012-01-04T09:48:42 smiley1983: as you can see UncleVasya learned haskell since he last talked to you 2012-01-04T09:49:48 * UncleVasya is ver smart. UncleVasya is polyglot. 2012-01-04T09:51:11 UncleVasya: is the difference between the OCaml ones just in formatting and comments? 2012-01-04T09:51:28 yes 2012-01-04T09:52:21 I like the fact that the first OCaml one has comments, but it seems to have some other unnecessary clutter 2012-01-04T09:52:31 I prefer the formatting of the second 2012-01-04T09:52:57 For the Haskell ones, I don't really have an opinion 'cause I don't know it (yet) 2012-01-04T09:53:26 they do very differently the same thing 2012-01-04T09:53:40 the haskell ones? 2012-01-04T09:53:55 yes 2012-01-04T09:54:00 So we can count 'have no opinion' as 0 points to them therefore 2:2 2012-01-04T09:54:28 UncleVasya: well, the said my formatting appealed to him more 2012-01-04T09:54:33 the->he 2012-01-04T09:55:06 and he didnt really said if he liked the ocaml formatting better than the haskell 2012-01-04T09:55:16 smiley1983: mcstar and me decided to write next_permutation and show to each other. Our 1st versions was very similar. 2012-01-04T09:55:44 However, my formatting is inconsistent, so I'm not much of a judge 2012-01-04T09:56:00 But after that mcstar wrote a second version. And I unfortunally have no ideas how to improve my one. 2012-01-04T09:56:28 smiley1983: to be clear, he wrote the ocaml, and i did the haskell ones 2012-01-04T09:56:52 now your task is the decide which code is more readable 2012-01-04T09:56:59 to* 2012-01-04T09:57:22 im sure you can interpret haskell code, since it isnt really fundamentally different 2012-01-04T09:57:37 at least the first version 2012-01-04T09:57:43 almost identical to the ocaml one 2012-01-04T09:59:22 UncleVasya: remind me why are we doing this? we agreed they looked bad both, didnt we? 2012-01-04T09:59:35 instead you should ask smiley1983 to write a new one 2012-01-04T09:59:40 I know what Smiley thinks now: 'Damn, why the hell I began to talk with these guys?!' 2012-01-04T09:59:44 that was your very first idea 2012-01-04T10:00:00 lol 2012-01-04T10:00:46 I'm not sure I can provide useful input here 2012-01-04T10:00:49 I'm to modest to ask someone to write something. But I want, it is true. 2012-01-04T10:01:41 If I end up writing something, I'll let you know, but no promises 2012-01-04T10:01:51 So I hoped for this reaction of Smiley when he sees our codes: 'Ahhh, guys... let me show you how master do it' 2012-01-04T10:02:21 no, I would probably produce something long and inefficient 2012-01-04T10:02:25 *too modest 2012-01-04T10:02:55 *** g0llum has joined #aichallenge 2012-01-04T10:11:21 *** GeorgeSebastian has quit IRC (Read error: Connection reset by peer) 2012-01-04T10:11:30 http://codepad.org/QFpcw5fU 2012-01-04T10:12:06 ahow984_: default: cout << "GRRRRRRRR\n"; return 0; 2012-01-04T10:12:07 it should count the number of sundays that were on the 1st of a month between 1900 and 2000 2012-01-04T10:12:18 rwest: :P yeah, it should never be there 2012-01-04T10:12:23 and it never is :P 2012-01-04T10:12:38 change indentation from 8 spaces to 2 2012-01-04T10:13:05 or 4 2012-01-04T10:13:07 I should change it to 4 I suppose 2012-01-04T10:13:09 yeah 2012-01-04T10:13:29 meh, it's consistent so it's still readable 2012-01-04T10:13:38 *** epicmonkey has quit IRC (Ping timeout: 240 seconds) 2012-01-04T10:14:44 I think it's something to do with the day_as_num idea 2012-01-04T10:16:21 id say default: return 28; 2012-01-04T10:16:42 bringing the last return down 2012-01-04T10:16:45 why? but either way it doesn't make a difference 2012-01-04T10:16:53 readability 2012-01-04T10:17:02 that message doesnt make sense 2012-01-04T10:17:06 well it never gets run anyways 2012-01-04T10:17:10 so lets use the default properly 2012-01-04T10:17:24 *** smiley1983 has quit IRC (Remote host closed the connection) 2012-01-04T10:17:24 yes, handle unforseen circumstances 2012-01-04T10:18:00 so I will know if something wrong happened if it prints "GRRRRR" and since it doesn't I know that it all works fine 2012-01-04T10:18:17 either way, thats not the problem :/ 2012-01-04T10:18:45 bleh 2012-01-04T10:18:52 I know now, miscounted the dates 2012-01-04T10:19:28 you didnt say there was a problem with it 2012-01-04T10:20:53 oh, well it doesn't do what it should do 2012-01-04T10:21:20 *** smiley1983 has joined #aichallenge 2012-01-04T10:24:49 so no more ideas anyone? 2012-01-04T10:25:30 im bad with dates, it is a known fact 2012-01-04T10:25:40 in both meaning of the word 2012-01-04T10:27:18 haha 2012-01-04T10:27:38 *** smiley1983 has quit IRC (Ping timeout: 240 seconds) 2012-01-04T10:29:01 http://codepad.org/Xt76IIRy 2012-01-04T10:29:12 ahow984_: I would start with removing 0 from all this 2012-01-04T10:29:25 dates can't have 0, so the logic seems weird when you use it 2012-01-04T10:29:32 yeah, ok 2012-01-04T10:33:58 *** GeorgeSebastian has joined #aichallenge 2012-01-04T10:34:11 ahow984_: also why not just use timestamps to get the data? 2012-01-04T10:34:35 this way seemed easier 2012-01-04T10:34:39 *** smiley1983 has joined #aichallenge 2012-01-04T10:34:53 and also, I don't think you're supposed to use non-standard libraries/functions 2012-01-04T10:34:55 well you wouldn't need to know days in month or anything with timestamps 2012-01-04T10:35:00 althought that would be standard.... 2012-01-04T10:35:11 *although 2012-01-04T10:35:12 you can use struct tm 2012-01-04T10:35:17 is standard isn't it? 2012-01-04T10:35:23 yes, I think so 2012-01-04T10:35:52 still though, what I have should work :/ 2012-01-04T10:35:56 so you just add 86400 to the ts to get the next day 2012-01-04T10:36:09 then check if day number is 1 and day of week is sun 2012-01-04T10:36:32 and you could also jump ahead that if you are on day 1 2012-01-04T10:36:38 just 27*86400 2012-01-04T10:36:46 and you skip 27 days of checking 2012-01-04T10:37:21 true 2012-01-04T10:37:28 *** bugnuts has joined #aichallenge 2012-01-04T10:37:34 but still, its the idea that this code should work but doesn't :/ 2012-01-04T10:40:10 what number should you get? 2012-01-04T10:42:28 I don't know tbh 2012-01-04T10:42:36 It's a projectEuler problem 2012-01-04T10:42:42 what number? 2012-01-04T10:42:53 I'm not sure 2012-01-04T10:43:02 oh 2012-01-04T10:43:04 sorry 2012-01-04T10:43:06 19 :P 2012-01-04T10:45:56 I see one issue 2012-01-04T10:46:01 Thirty days has September, 2012-01-04T10:46:02 April, June and November. 2012-01-04T10:46:28 updated code? 2012-01-04T10:46:48 move case 8 2012-01-04T10:46:53 to the 30 days 2012-01-04T10:46:59 I did 2012-01-04T10:47:10 still the wrong answer though 2012-01-04T10:47:15 yes 2012-01-04T10:47:53 http://codepad.org/k7tz2kaA 2012-01-04T10:48:08 thats it updated using intuitive date numbers 2012-01-04T10:48:36 ok got it 2012-01-04T10:48:41 dates starts at 1901 also 2012-01-04T10:49:00 your logic was fine 2012-01-04T10:49:11 just data from the problem was not correct 2012-01-04T10:49:16 >_< 2012-01-04T10:49:33 thats stupidly misleading from the question IMO 2012-01-04T10:50:11 it specifically says it starts in 1901 2012-01-04T10:50:12 got it :) 2012-01-04T10:50:12 hah 2012-01-04T10:50:17 tyvm 2012-01-04T10:50:40 np 2012-01-04T10:50:45 got me an answer too^^ 2012-01-04T10:50:45 yeah, but why wouldn't they say what date the first of jan was in 1901 instead of 1900? 2012-01-04T10:50:49 see? c++ even introduces bugs in humans 2012-01-04T10:50:57 How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)? 2012-01-04T10:51:00 they do? 2012-01-04T10:51:24 1 Jan 1900 was a Monday. 2012-01-04T10:51:25 oh I see 2012-01-04T10:51:30 thats the first bullet point :P 2012-01-04T10:51:37 must be a typo 2012-01-04T10:51:41 I am thinking 2012-01-04T10:52:11 not a typo if I got the right answer by leaving it start at 1900 2012-01-04T10:52:25 I just said if the year was > 1900 2012-01-04T10:52:32 I changed the start to 1901 2012-01-04T10:52:35 when I was checking to increment count 2012-01-04T10:52:41 what typo? 2012-01-04T10:52:45 the problem statement is clear 2012-01-04T10:52:59 I mcstar it gives the first monday of year 1900 2012-01-04T10:53:08 but wants you to count from 1901 2012-01-04T10:53:11 seems weird 2012-01-04T10:53:13 no 2012-01-04T10:53:14 clear but misleading 2012-01-04T10:53:23 1 Jan 1900 was a Monday. 2012-01-04T10:53:24 it says its a monday 2012-01-04T10:53:26 thats all 2012-01-04T10:53:27 (1 Jan 1901 to 31 Dec 2000) 2012-01-04T10:53:37 yep, but theres no ambiguity 2012-01-04T10:53:48 no 2012-01-04T10:53:52 in fairness 2012-01-04T10:54:01 lol 2012-01-04T10:54:06 looking at the forum 2012-01-04T10:54:15 "I just computed 1200/7" 2012-01-04T10:54:17 the problem is with this: 2012-01-04T10:54:23 (1 Jan 1901 to 31 Dec 2000) 2012-01-04T10:54:23 jesus, how come I didn't think of that lol 2012-01-04T10:54:26 it should be this: 2012-01-04T10:54:30 [1 Jan 1901 to 31 Dec 2000] 2012-01-04T10:54:49 it should be from 1 jan 1900 2012-01-04T10:54:50 :P 2012-01-04T10:55:33 lol it doesn't even matter that it was a monday 2012-01-04T10:55:35 on that date 2012-01-04T10:55:40 you can set the start day to anything 2012-01-04T10:55:43 same answer 2012-01-04T10:56:02 orly? 2012-01-04T10:56:05 yea 2012-01-04T10:56:14 wierd 2012-01-04T10:56:17 *weird 2012-01-04T10:56:49 i before e except after c or if the word is weird 2012-01-04T10:56:50 lol 2012-01-04T10:56:51 maybe they introduced "sunday" after only 1900? 2012-01-04T10:57:23 rwest: haha, I never heard that :) 2012-01-04T10:59:21 mcstar: it's probably to do with every year there is a patern 2012-01-04T10:59:29 like monday has 1 this year 2012-01-04T10:59:32 next it has 2 2012-01-04T10:59:44 and every day has the same patern 2012-01-04T10:59:48 since they all shift the same 2012-01-04T11:00:24 anyway, id be glad to hear the answer 2012-01-04T11:00:38 to the problem? 2012-01-04T11:00:43 that code seems to be particulary like a chore to write 2012-01-04T11:00:52 yes pls :D 2012-01-04T11:01:35 do i really have to run it? 2012-01-04T11:01:39 now come on 2012-01-04T11:01:45 http://codepad.org/5Jia0Kz4 2012-01-04T11:02:09 thx 2012-01-04T11:02:11 believe me, If I did it it couldn't have been too hard ;) 2012-01-04T11:02:12 np 2012-01-04T11:02:39 i mean i dont see that particularly challenging :) 2012-01-04T11:02:49 ah 2012-01-04T11:02:59 no, its a lot easier then the other problems though 2012-01-04T11:03:07 you'd like PE 2012-01-04T11:03:09 i have 17 solved 2012-01-04T11:03:36 whats your name on it? 2012-01-04T11:04:25 I only have 4 2012-01-04T11:04:27 > private 2012-01-04T11:04:28 I get bored hah 2012-01-04T11:04:54 heh 2012-01-04T11:05:06 I made my account about 2 years ago and only have 14 :| 2012-01-04T11:05:18 oh, I made mine like 2 weeks ago heh 2012-01-04T11:05:31 I have 1, 2, 19, 215 2012-01-04T11:05:37 yes random 215 2012-01-04T11:05:45 why 215? 2012-01-04T11:05:45 mcstar has it too! 2012-01-04T11:06:06 :) 2012-01-04T11:06:07 I had a puzzle from a company to get an interview 2012-01-04T11:06:11 *** treeform has joined #aichallenge 2012-01-04T11:06:12 and that was the problem 2012-01-04T11:06:13 hah 2012-01-04T11:06:26 :) 2012-01-04T11:06:30 I remember that one now 2012-01-04T11:06:42 haha, damn, should have done it 2012-01-04T11:08:34 mcstar: how did you do 13 and 16? 2012-01-04T11:08:41 How do you handle that many digits? 2012-01-04T11:08:51 *** JorgeB has quit IRC (Quit: Computer has gone to sleep.) 2012-01-04T11:10:14 ahow984_: scheme! 2012-01-04T11:10:23 scheme? 2012-01-04T11:10:30 ahow984_: (defparameter *nums* #(37107287533902102798797998220837590246510135740250 2012-01-04T11:10:31 ....)) 2012-01-04T11:10:33 (loop for n across *nums* 2012-01-04T11:10:35 summing n into re 2012-01-04T11:10:37 finally (loop for val = re then (truncate val 10) 2012-01-04T11:10:39 while (> val 10000000000) 2012-01-04T11:10:41 finally (format t "digits: ~d~%" val))) 2012-01-04T11:10:43 its common lisp 2012-01-04T11:10:57 lisp.... *shudders* 2012-01-04T11:10:57 scheme is a subset of lisp so 2012-01-04T11:10:58 yea 2012-01-04T11:11:22 lisp treats numbers as lists, so it makes it great for large numbers 2012-01-04T11:11:31 you dont have this loop macro in scheme 2012-01-04T11:11:40 what? 2012-01-04T11:11:47 it doesn not 2012-01-04T11:12:01 is it not just a list of digits? 2012-01-04T11:12:04 no 2012-01-04T11:12:13 its a vector of integers 2012-01-04T11:12:15 bigints 2012-01-04T11:12:30 #(324234 32423423 4234354 7657657) 2012-01-04T11:12:30 nto much of a difference 2012-01-04T11:12:51 "lisp treats numbers as lists" that is totally incorrect 2012-01-04T11:14:05 a vector and a list are not very different 2012-01-04T11:14:21 lol 2012-01-04T11:14:22 rwest: mcstar: race to solve a problem? :P 2012-01-04T11:14:33 rwest: that was quite some statement 2012-01-04T11:14:39 they are VERY different 2012-01-04T11:14:40 problem 55 2012-01-04T11:14:51 and i dont see why you keep bringing them aup 2012-01-04T11:15:03 an integer is neither a list nor a vector 2012-01-04T11:16:53 *** treeform_ has joined #aichallenge 2012-01-04T11:18:33 ahow984_: for 16th http://codepad.org/UHRiSa06 2012-01-04T11:19:19 *** treeform has quit IRC (Ping timeout: 252 seconds) 2012-01-04T11:19:48 mcstar: thanks but no thanks 2012-01-04T11:20:00 its not a challenge if I don't get at least some of it myself ;) 2012-01-04T11:20:07 you asked... 2012-01-04T11:20:25 yes, the idea behind it was all I needed, ty 2012-01-04T11:21:27 as a matter of interest, is a 1-digit number considered to be palindromic? 2012-01-04T11:23:03 ahow984_: yes 2012-01-04T11:23:05 *** JorgeB has joined #aichallenge 2012-01-04T11:29:44 *** GeorgeSebastian has quit IRC (Read error: Connection reset by peer) 2012-01-04T11:33:25 *** Blkt` has joined #aichallenge 2012-01-04T11:34:08 *** Blkt has quit IRC (Ping timeout: 240 seconds) 2012-01-04T11:39:16 *** kire has quit IRC (Remote host closed the connection) 2012-01-04T11:43:18 *** Blkt`` has joined #aichallenge 2012-01-04T11:45:01 ahow984_: brute force solution is running for 5mins now 2012-01-04T11:45:13 haha 2012-01-04T11:45:18 *** dapplegate has joined #aichallenge 2012-01-04T11:45:18 I thought I had the answer too 2012-01-04T11:45:26 mine runs faster then that though.... 2012-01-04T11:45:32 lol 2012-01-04T11:45:35 i discovered a bug 2012-01-04T11:45:39 :P 2012-01-04T11:45:43 my answer was wrong 2012-01-04T11:45:55 im counting down from 0, trying to reach 0 2012-01-04T11:45:57 *commentary* its down to the finish 2012-01-04T11:46:01 haha 2012-01-04T11:46:05 *** Blkt` has quit IRC (Ping timeout: 244 seconds) 2012-01-04T11:46:57 I bet I've done something stupid now 2012-01-04T11:46:58 ah ok, its fast 2012-01-04T11:48:14 you get it? 2012-01-04T11:50:05 lol nothing 2012-01-04T11:50:11 i forgot something 2012-01-04T11:50:14 wait a min 2012-01-04T11:55:54 ah 2012-01-04T11:55:56 at last 2012-01-04T11:56:02 what a rush 2012-01-04T11:56:13 :P 2012-01-04T11:56:15 you get it? 2012-01-04T11:56:19 yes 2012-01-04T11:56:24 first i added n to n 2012-01-04T11:56:27 I nearly have it to 2012-01-04T11:56:27 didnt reverse it 2012-01-04T11:56:40 and then i counted the bad condition 2012-01-04T11:56:54 i.e. the non-lyncsomething numbers 2012-01-04T11:57:44 hmm 2012-01-04T11:57:56 its weird because each of the individual parts work correctly 2012-01-04T11:58:10 hmm 2012-01-04T11:58:13 maybe an overflow 2012-01-04T11:58:50 yes an overflow 2012-01-04T11:59:16 lisp doesn't have these problems with string to int conversions and stuff ;) 2012-01-04T12:00:07 you don't need to convert between string and int to check palindromes 2012-01-04T12:00:14 >_< 2012-01-04T12:00:16 really? 2012-01-04T12:00:22 I thought thered be some way alright 2012-01-04T12:00:28 reverse the number 2012-01-04T12:00:35 and compare 2012-01-04T12:00:35 ... how? 2012-01-04T12:01:04 i doint it in haskell 2012-01-04T12:01:06 m 2012-01-04T12:01:26 uint64_t reverseNum(uint64_t n, uint64_t m) { 2012-01-04T12:01:26 if(n == 0) 2012-01-04T12:01:26 return m; 2012-01-04T12:01:26 m *= 10; 2012-01-04T12:01:26 m += n % 10; 2012-01-04T12:01:28 return reverseNum(n / 10, m); 2012-01-04T12:01:31 } 2012-01-04T12:01:51 its faster to convert to a string i guess 2012-01-04T12:02:09 did you benchmarki it? 2012-01-04T12:02:10 lol recursion >_< 2012-01-04T12:02:14 it's instant 2012-01-04T12:02:17 but anyway, it runs too fast to consider this 2012-01-04T12:02:19 oh how I hate it with a passion 2012-01-04T12:02:30 ahow984_: you cant hate recursion 2012-01-04T12:02:34 ahow984_: recursion makes everything look so simple 2012-01-04T12:02:44 I do. I just can't get my head around it 2012-01-04T12:02:52 its the natural way of repetition 2012-01-04T12:02:59 even stuff like to the power of x 2012-01-04T12:03:08 I don't get where my number is wrong 2012-01-04T12:03:10 or multiplying by adding recursively 2012-01-04T12:03:14 just can't do it 2012-01-04T12:03:19 I have to be getting over a 64bit int 2012-01-04T12:03:34 thats whats happening to me too :( 2012-01-04T12:03:56 6 lines 2012-01-04T12:03:59 its overflowing an unsigned long long.... 2012-01-04T12:04:58 lol 2012-01-04T12:05:03 1324 times it does 2012-01-04T12:05:14 or maybe 2012-01-04T12:05:39 yep 2012-01-04T12:05:52 1324 of the numbers overflow an int64 2012-01-04T12:05:59 bleh 2012-01-04T12:06:09 this is what pisses me off about PE 2012-01-04T12:06:22 wtb long long long long 2012-01-04T12:06:36 .... you can't do that 2012-01-04T12:07:25 error: ‘long long long’ is too long for GCC 2012-01-04T12:07:28 ;) 2012-01-04T12:07:32 lol 2012-01-04T12:07:48 you can have 128bit integers maybe 2012-01-04T12:07:50 not sure 2012-01-04T12:08:08 unsigned long long is the largest native data type iirc 2012-01-04T12:08:22 different architectures different integers 2012-01-04T12:08:48 yes, but an unsigned long long will always hold the highest number on that machine ;) 2012-01-04T12:08:49 just link the damn gmp in 2012-01-04T12:08:54 you dont have to change your code 2012-01-04T12:09:17 just replace int with mzint or something or other i cant remember 2012-01-04T12:09:39 (ok, you have to, but only minimally) 2012-01-04T12:09:44 *** grwip has joined #aichallenge 2012-01-04T12:09:55 ahow984_: in the meantime what do i do? 2012-01-04T12:10:26 help me debug ;) 2012-01-04T12:10:38 nah, go find another problem lol 2012-01-04T12:11:04 first i make mine more effective 2012-01-04T12:11:15 no need to conver a number 2x to string 2012-01-04T12:17:06 *** raemde_ has quit IRC (Ping timeout: 248 seconds) 2012-01-04T12:19:34 rwest: how you doing? 2012-01-04T12:19:42 what language are you doing it in btw? 2012-01-04T12:21:22 *** mleise has joined #aichallenge 2012-01-04T12:21:44 *** pairofdice has quit IRC (Ping timeout: 244 seconds) 2012-01-04T12:22:00 ahow984_: just tried bignum library in c 2012-01-04T12:22:07 this is not going to work lol 2012-01-04T12:22:21 I think mine is screwd anyways 2012-01-04T12:22:36 I had it done if it didn't overflow 2012-01-04T12:22:39 atoi() != array-to-GMP-class() :P 2012-01-04T12:22:55 rwest: I had it finished before mcstar if it didn't overflow ;) 2012-01-04T12:23:01 same 2012-01-04T12:23:14 like, its 50 lines of code lol 2012-01-04T12:23:31 do you know when i started? 2012-01-04T12:23:38 mine is 6 2012-01-04T12:23:48 so it was quite fast to write 2012-01-04T12:23:52 lol 2012-01-04T12:23:56 thats ridiculous 2012-01-04T12:24:10 but still, you don't have to do all the string to int conversions 2012-01-04T12:24:15 or deal with overflows 2012-01-04T12:24:31 *** Blkt`` is now known as Blkt 2012-01-04T12:24:53 but that is undeniable about Ocaml, Haskell, Mathematica, Lisp, etc 2012-01-04T12:25:06 they take a ridiculously short amount of lines 2012-01-04T12:26:34 i havent used ocaml much 2012-01-04T12:26:52 the last 2 im very familiar with 2012-01-04T12:27:06 Mathematica too? 2012-01-04T12:27:13 i said last 2 2012-01-04T12:27:17 man, that just looks ridiculous 2012-01-04T12:27:23 what? 2012-01-04T12:27:33 anyway, in c++ gmp is easy as pie 2012-01-04T12:29:49 *** treeform_ has quit IRC (Remote host closed the connection) 2012-01-04T12:29:58 bleh 2012-01-04T12:30:04 not really bothered by it any more 2012-01-04T12:30:11 damn technicalities 2012-01-04T12:34:09 *** McLeopold has left #aichallenge 2012-01-04T12:34:14 *** McLeopold has joined #aichallenge 2012-01-04T12:40:45 http://codepad.org/ni0fitMb 2012-01-04T12:40:54 Yes I started over in a new language 2012-01-04T12:40:55 lol 2012-01-04T12:41:55 >_< 2012-01-04T12:42:27 only language I actually know well enough with no limit on numbers heh 2012-01-04T12:42:44 C/++: has sent rockets to the moon but can't do a projecteuler problem :P 2012-01-04T12:43:25 I would have done gmp 2012-01-04T12:43:44 gmp didn't work for me 2012-01-04T12:43:44 but I didn't see a modular function 2012-01-04T12:43:45 :/ 2012-01-04T12:43:50 modulus 2012-01-04T12:43:52 even 2012-01-04T12:44:03 and I can't use atoi or anything 2012-01-04T12:44:34 why do you need atoi? 2012-01-04T12:45:10 http://codepad.org/hQxmrSQT 2012-01-04T12:45:43 @later tell amstan I'm bringing down our website again 2012-01-04T12:45:43 McLeopold: Yep. 2012-01-04T12:46:20 ahow984_: I guess when you do it that way 2012-01-04T12:46:26 I am not big on c++ 2012-01-04T12:46:33 so I wouldn't know the length 2012-01-04T12:46:41 my logic is flawless :P 2012-01-04T12:46:45 without checking it 2012-01-04T12:47:05 tcl worked ^^ 2012-01-04T12:47:26 :) 2012-01-04T12:47:42 did you guys finish? 2012-01-04T12:47:46 shoulda just used it from the beginning 2012-01-04T12:47:52 mcstar: yea, tcl haha 2012-01-04T12:48:06 mcstar: no, but I'm not going to get it finished lol :/ 2012-01-04T12:48:28 http://codepad.org/FxCQiMxT 2012-01-04T12:48:55 mcstar: I find it so difficult to read haskell 2012-01-04T12:49:17 but it isnt obfuscated, and the syntax is clear 2012-01-04T12:49:50 my head just wants to explode lol 2012-01-04T12:49:58 too much in very lil space 2012-01-04T12:50:00 mcstar: same here 2012-01-04T12:50:20 :( 2012-01-04T12:50:26 haha 2012-01-04T12:51:11 rwest: well, tbh, i takes more time to get my head around your code 2012-01-04T12:51:31 (aside from the fact that i know haskell better than tcl) 2012-01-04T12:52:22 mcstar: I can agree tcl is ugly too! 2012-01-04T12:54:17 *** zybk has joined #aichallenge 2012-01-04T12:55:17 *** zybk has quit IRC (Client Quit) 2012-01-04T12:56:09 *** pairofdice has joined #aichallenge 2012-01-04T12:59:43 *** Schoon has quit IRC (Ping timeout: 258 seconds) 2012-01-04T13:00:37 *** mviel_ has quit IRC (Quit: Leaving) 2012-01-04T13:01:58 *** amstan has joined #aichallenge 2012-01-04T13:02:01 *** ChanServ sets mode: +o amstan 2012-01-04T13:05:54 want to do a different problem mcstar rwest? 2012-01-04T13:06:08 wait a minute 2012-01-04T13:06:31 hi, what's the topic? 2012-01-04T13:06:46 ./topic 2012-01-04T13:06:56 mleise: euler 2012-01-04T13:07:01 oh or that 2012-01-04T13:07:02 hah 2012-01-04T13:07:21 euler, that dude that came up with e ? 2012-01-04T13:07:25 ahow984_: I will do one 2012-01-04T13:07:44 mleise: guys solving problems from Projec Euler problem set. 2012-01-04T13:07:49 I hate how it is pronounced 2012-01-04T13:07:54 oiler 2012-01-04T13:08:01 *Project 2012-01-04T13:08:18 it is pronounced perfectly fine in germany, hey :) 2012-01-04T13:08:25 mleise: I bet heh 2012-01-04T13:08:41 I read it to myself as youler 2012-01-04T13:09:04 rwest: me too :)_ 2012-01-04T13:09:09 How do you read Medwedew? 2012-01-04T13:09:12 I pronounce it Yeulyer. u like in Doom. 2012-01-04T13:09:32 I think there is a "dj"-sound in there 2012-01-04T13:09:38 mleise: med wed oo 2012-01-04T13:09:56 or med wee do 2012-01-04T13:10:16 janzert: are you working on the archive? 2012-01-04T13:10:19 i found apache stopped 2012-01-04T13:10:44 McLeopold: oh, you are 2012-01-04T13:10:44 amstan: McLeopold left you a message about it 2012-01-04T13:10:56 stopping 2012-01-04T13:11:02 12:45 < McLeopold> @later tell amstan I'm bringing down our website again 2012-01-04T13:11:21 rwest: or whoever 2012-01-04T13:11:37 amstan: coming back up 2012-01-04T13:11:39 I'll be back in about 40 mins if someone wants to pick out a problem 2012-01-04T13:11:40 ttyl 2012-01-04T13:11:46 McLeopold: what's up? 2012-01-04T13:11:51 apache and mysql 2012-01-04T13:12:05 as in what are you working on? 2012-01-04T13:12:12 I've added stuff to robots.txt, which I think baidu ignores anyway... 2012-01-04T13:12:20 plus, I'm blocking their ipaddresses 2012-01-04T13:12:27 this baidu business is annoying me, yeah, let's block 2012-01-04T13:12:33 already done 2012-01-04T13:12:33 *** Israfel has quit IRC (Read error: Operation timed out) 2012-01-04T13:12:42 we get like 99.99% of our results from google anyway 2012-01-04T13:12:51 but, I'm not sure if it will stay blocked on reboot, where is the file that iptables-save creates? 2012-01-04T13:13:03 i'm not sure 2012-01-04T13:14:04 Project Euler: "What is the sum of the digits of the number 2^1000?" - Me: uh... 1 ? 2012-01-04T13:15:27 mleise: what number is that? 2012-01-04T13:15:40 problem # 2012-01-04T13:15:52 McLeopold: 16 2012-01-04T13:16:11 *** treeform has joined #aichallenge 2012-01-04T13:16:11 mcstar posted the answer to that earlier 2012-01-04T13:16:22 :( 2012-01-04T13:16:31 *** amstan_ has joined #aichallenge 2012-01-04T13:16:31 *** ChanServ sets mode: +o amstan_ 2012-01-04T13:16:37 so far we have done, 16, 55, 215 2012-01-04T13:16:41 one problem for each day of year? yay! 2012-01-04T13:17:25 Don't be posting answers to PE problems :( 2012-01-04T13:17:36 I can come up with a problem if you want. 2012-01-04T13:18:04 pairofdice: don't look! 2012-01-04T13:18:10 mleise: sum of 2**1000? isn't that as easy as sum(map(int,str(2**1000))) in python? 2012-01-04T13:18:20 I've solved only 29 of them 2012-01-04T13:18:35 amstan_: Python... always taking the fun out of programming 2012-01-04T13:18:37 I have 7 2012-01-04T13:18:42 oh we also did 19 earlier 2012-01-04T13:18:59 it can even do sum(map(int,str(2**1000000))) 2012-01-04T13:18:59 I have a problem for you that took my computer 3:40 to brute force :D 2012-01-04T13:19:07 takes a while though 2012-01-04T13:19:08 3 hours that is 2012-01-04T13:19:09 mleise: 7 2012-01-04T13:19:41 mleise: hey.. it was fun 2012-01-04T13:19:57 i had to think of how to extract the digits out 2012-01-04T13:20:09 map(int,str(number)) 2012-01-04T13:20:10 ok 2012-01-04T13:20:11 is the way 2012-01-04T13:20:20 I am doing everything on euler in tcl now 2012-01-04T13:20:37 sick of overflowing long long's 2012-01-04T13:20:57 So here is my problem for you: 2012-01-04T13:20:59 so what's the point of project euler? can you bruteforce a lot of those problems? or do you have to do lots of math first? 2012-01-04T13:21:20 amstan: a lot of them are huge numbers that take hours to brute force 2012-01-04T13:21:27 like 215 for example 2012-01-04T13:21:32 You're adviced to find a solution that takes less than one second 2012-01-04T13:21:42 amstan_: dang, slow again... 2012-01-04T13:21:43 there is a solution that can be .1s in c 2012-01-04T13:21:50 but brute force is days 2012-01-04T13:21:52 interesting 2012-01-04T13:23:14 Take a deck of skat cards (http://en.wikipedia.org/wiki/Skat_(card_game)#Deck) and consider the colors equal (so there are really 4 duplicates of each of the 8 values). How many ways are there to give 4 players 8 cards? 2012-01-04T13:23:35 The order of cards doesn't matter. 2012-01-04T13:24:19 Your solution must run in under 4 hours *g* 2012-01-04T13:24:20 32c4*28c4*24c4*20c4 2012-01-04T13:24:33 divided by something 2012-01-04T13:24:36 rwest: uh... that easy? :( 2012-01-04T13:24:43 it's combinatorics 2012-01-04T13:24:45 McLeopold: can we stop apache when it's slow while we debug? 2012-01-04T13:24:47 it's something like that 2012-01-04T13:25:04 err 8 cards 2012-01-04T13:25:05 whoops 2012-01-04T13:25:19 8 cards, and each value has 4 duplicates 2012-01-04T13:25:27 32c8 * 24c8 * 16c8 * 8c1 2012-01-04T13:25:35 oh the duplicates 2012-01-04T13:25:40 McLeopold: http://www.simplemachines.org/community/index.php?P=ae12b92af6ea698935ae77d8e3b42679&topic=350439.msg2379117#msg2379117 2012-01-04T13:25:41 slightly more complicated 2012-01-04T13:25:46 ;) 2012-01-04T13:25:49 but you can do it with paper and pencil 2012-01-04T13:25:51 I am sure of it 2012-01-04T13:26:06 guys, be here when I'll be writing my math exam :D 2012-01-04T13:26:09 amstan_: now googlebot is getting us... 2012-01-04T13:26:17 I have irc-client in my phone 2012-01-04T13:26:18 ... 2012-01-04T13:26:19 rwest: the number I got has 10 digits 2012-01-04T13:26:19 It's been a couple years since I have taken discrete math though 2012-01-04T13:26:40 mleise: I think that is a wrong answer then 2012-01-04T13:26:47 hmm 2012-01-04T13:26:51 amstan_: iptables is better, and I have the ips from the access logs 2012-01-04T13:27:17 mleise: it would be something like that if they weren't considered duplicates 2012-01-04T13:27:28 and then you could express it as a factorial anyway 2012-01-04T13:28:04 I'm not into math. I have no idea. That is why I brute forced it. 2012-01-04T13:28:06 McLeopold: what ip is it? does it match the baidu? 2012-01-04T13:28:15 *** Israfel has joined #aichallenge 2012-01-04T13:28:46 McLeopold: Crawl-delay: 10 2012-01-04T13:28:53 google should respect that 2012-01-04T13:28:53 for one player I got 5475 possibilities 2012-01-04T13:29:12 mleise: are you going to make visualizer again? 2012-01-04T13:29:32 UncleVasya: That depends on the game 2012-01-04T13:30:04 (32c8 * 24c8 * 16c8 * 8c1)/((8*4)!) 2012-01-04T13:30:06 If someone else wants to do it for the next contest, that's fine with me. 2012-01-04T13:30:12 that should be the answer 2012-01-04T13:30:34 rwest: cool, now give me a calculator that does 'c' 2012-01-04T13:30:38 where c = choose 2012-01-04T13:31:32 mleise: what do you think of asteroids? 2012-01-04T13:31:48 https://github.com/aichallenge/aichallenge/tree/amstan-asteroids 2012-01-04T13:31:56 amstan_: okay, google was much nicer to our system 2012-01-04T13:32:00 I think we are ok 2012-01-04T13:32:03 ok 2012-01-04T13:32:07 started apache? 2012-01-04T13:32:08 mleise: 32c8 = 32!/(32-8)! 2012-01-04T13:32:13 it's been up 2012-01-04T13:32:21 McLeopold: oh yeah, which url is it accessing on? 2012-01-04T13:32:25 it should be ants.aichallenge.org 2012-01-04T13:32:30 amstan: Is it about steering a ship and shooting incoming rocks? 2012-01-04T13:32:31 if not, we shouldn't allow it to index 2012-01-04T13:32:36 mleise: yes 2012-01-04T13:32:39 mleise: and shooting others too 2012-01-04T13:32:48 wait.. 2012-01-04T13:32:57 no, not that boring one 2012-01-04T13:33:09 amstan_: I was only tailing the tron access log 2012-01-04T13:33:10 amstan: That sounds like it doesn't require 2000 units on screen, cool! 2012-01-04T13:33:29 it's where you can rotate you ship, you have momentum, and you can accelerate in the direction you're pointed at 2012-01-04T13:33:49 well, having a lot of asteroids would be cool 2012-01-04T13:33:54 *** TheLinker has joined #aichallenge 2012-01-04T13:34:01 amstan: Yes, I know those :) 2012-01-04T13:34:20 mleise: something is off with that equatio I put there heh 2012-01-04T13:34:23 amstan: many asteroids == constant fire 2012-01-04T13:34:49 amstan_: I'll leave you to finalize the robots stuff 2012-01-04T13:35:01 so we would program one of those board computers from sci-fi movies that evade asteroids 2012-01-04T13:35:17 mleise: final answer: 32!/8!4! 2012-01-04T13:35:26 so maybe it is high 2012-01-04T13:35:26 lol 2012-01-04T13:35:30 rwest: that looks WAY to simple 2012-01-04T13:35:58 my computer had to crunsh numbers for 4 hours! 2012-01-04T13:36:32 http://mathforum.org/library/drmath/view/56197.html 2012-01-04T13:36:38 it's larget than your number lol 2012-01-04T13:37:01 I may be missing a limiting factor somewhere 2012-01-04T13:37:11 oh I know 2012-01-04T13:37:12 I came across that awhile ago when analizing pinochle 2012-01-04T13:37:21 McLeopold: cheater ;) 2012-01-04T13:37:30 amstan_: In robocode you are able to determine colors of your tank. What do you think about giving a possibility for contestant to customise the looking of his ship? Only in visualizer, so another bots can't determine opponent by colors. 2012-01-04T13:37:43 I've already done euler <100 :) 2012-01-04T13:37:47 UncleVasya: I loved RoboCode 2012-01-04T13:37:56 UncleVasya: good idea, heheh 2012-01-04T13:38:06 heheh? 2012-01-04T13:38:08 be able to send a polygon 2012-01-04T13:38:13 and a brush colour 2012-01-04T13:38:24 Is it means 'Implement it yourself and be happy'? :D 2012-01-04T13:38:25 as long as it's under n vertexes and they're all within a small area 2012-01-04T13:38:27 McLeopold: thank you for posting that, I missed part of my conversion 2012-01-04T13:38:28 McLeopold: so ... you have the background to solve the cards problem? 2012-01-04T13:38:30 and if you crash into an asteroid, you ship should be pasted to it for the rest of the game 2012-01-04T13:38:39 mleise: yes 2012-01-04T13:38:40 McLeopold: lol 2012-01-04T13:38:47 yes! 2012-01-04T13:38:52 And we should have Vipers and Raiders 2012-01-04T13:39:22 oh man, archlinux is awesome 2012-01-04T13:39:32 everything is just faster... 2012-01-04T13:39:37 Also, 1000 turns for ants killed our workers. Too much processing. I'm a big fan of making the game wind down faster. 2012-01-04T13:39:44 archlinux is awesome 2012-01-04T13:39:48 *** HaraKiri has joined #aichallenge 2012-01-04T13:40:01 McLeopold: what do you think of changing our contest to it? 2012-01-04T13:40:05 If you want even faster, go gentoo, but it's a lot of work 2012-01-04T13:40:28 amstan_: not a fan, rolling release will bite us 2012-01-04T13:40:44 hmm, you're right 2012-01-04T13:40:53 I think ubuntu is popular enough that we can find volunteers 2012-01-04T13:41:02 but i would like to avoid that issue that we had 2012-01-04T13:41:03 and ubuntu server is almost as easy as archlinux 2012-01-04T13:41:10 which one? 2012-01-04T13:41:18 mleise: 36468696706 2012-01-04T13:41:19 when we picked 10.10 for the contest and then we had to switch to 11.04 because we took forever 2012-01-04T13:41:25 Does anybody really use Slackware or it is just to play and throw away? 2012-01-04T13:41:36 UncleVasya: no dependency management is annoying 2012-01-04T13:41:47 amstan: meh, whatever 2012-01-04T13:41:47 rwest: That's a good number. Mine differs a bit. 2012-01-04T13:41:59 we only need to finalize language versions at the start 2012-01-04T13:42:00 mleise: I am missing something that should make it even 2012-01-04T13:42:09 I've heard in last versions it was included, but not sure. 2012-01-04T13:42:15 I have 5_796_870_115. 2012-01-04T13:42:23 mleise: been way too long since I have done this sort of math 2012-01-04T13:44:32 back 2012-01-04T13:44:32 McLeopold: yeah, but you saw that it took us quite a few months to get it going, a few months is a lot for old versions 2012-01-04T13:44:48 and ubuntu package versions are already old to begin with(<6 months) 2012-01-04T13:45:18 amstan_: include xotcl imo 2012-01-04T13:45:41 *** Harpyon has joined #aichallenge 2012-01-04T13:45:46 amstan_: guy I work with tried to submit on the 17th and it didn't work, I just laughed at him 2012-01-04T13:46:43 amstan_: I don't think it really matters. I wouldn't say our ubuntu version was a source of pain at all 2012-01-04T13:46:46 random question: I have this broken window on screen. doesn't show up in top or jobs. How can I kill it? 2012-01-04T13:47:05 ahow984_: OS? 2012-01-04T13:47:10 oh nvm 2012-01-04T13:47:11 lol 2012-01-04T13:47:15 read sentence ftw 2012-01-04T13:47:33 Fedora 16 :P 2012-01-04T13:47:37 it's not in ps? 2012-01-04T13:47:53 nope 2012-01-04T13:48:04 gdm -r I think it is 2012-01-04T13:48:20 there is a gnome3 command to redraw everything 2012-01-04T13:48:24 from alt+f2 2012-01-04T13:48:43 so if it's just graphical that would get it 2012-01-04T13:48:47 nope 2012-01-04T13:48:51 doesn't work 2012-01-04T13:48:57 ahow984_: the process *must* be listed 2012-01-04T13:49:00 yea 2012-01-04T13:49:04 then it has to be there 2012-01-04T13:49:06 I know, but I don't know where 2012-01-04T13:49:14 if redrawing gnome-shell doesn't fix it 2012-01-04T13:49:32 I don't want to upgrade to gnome-shell :( 2012-01-04T13:49:38 *** amstan_ has quit IRC (Ping timeout: 240 seconds) 2012-01-04T13:49:39 mleise: done 2012-01-04T13:49:41 dont 2012-01-04T13:50:05 mleise: use MATE 2012-01-04T13:50:07 ahow984_: did you start the program as root? 2012-01-04T13:50:10 no 2012-01-04T13:50:20 gnome2 fork that can run along side of gnome-3 2012-01-04T13:50:21 can I browse top? 2012-01-04T13:50:34 ahow984_: do you know what program it is? 2012-01-04T13:50:42 yes, but not its name 2012-01-04T13:50:44 press h in top, I don't know if you can browse 2012-01-04T13:50:47 actually yes 2012-01-04T13:50:51 but there is a help after all 2012-01-04T13:50:55 ahow984_: well you need it's name heh 2012-01-04T13:51:13 ps -ef | grep -i name 2012-01-04T13:51:29 if you launched it recently, it probably has one of the highest PIDs 2012-01-04T13:51:55 :D 2012-01-04T13:51:56 if it is in an endless loop it will show up using most of the cpu 2012-01-04T13:51:57 ty 2012-01-04T13:52:06 ps -ef found it 2012-01-04T13:52:15 I dunno what I was trying before lol 2012-01-04T13:52:20 all sorted :) 2012-01-04T13:52:23 np 2012-01-04T13:52:31 so project euler? 2012-01-04T13:52:32 :P 2012-01-04T13:53:19 ahow984_: I have done 2 since you left lol 2012-01-04T13:53:24 :O 2012-01-04T13:53:28 which ones? :P 2012-01-04T13:53:29 :) 2012-01-04T13:53:31 4 and 5 2012-01-04T13:53:32 lol 2012-01-04T13:53:44 just simple ones 2012-01-04T13:54:04 heh, yeah 2012-01-04T13:54:30 I've done the first 11, 14, 17 and 19 :P 2012-01-04T13:55:34 we have to solve more then mcstar ;) 2012-01-04T14:00:07 nvm I didn't get 5 2012-01-04T14:00:16 either the number is huge, or I fucked up lol 2012-01-04T14:00:35 yes, you must have fucked up :P 2012-01-04T14:00:50 fits in an unsigned long long I imagine 2012-01-04T14:00:52 heh, found interesting line in one c++ source: while (K-->0) { 2012-01-04T14:01:30 lolwut? 2012-01-04T14:01:35 I've scratced my head and though: 'hmm, I didn't know this Arrow operator before' 2012-01-04T14:01:40 yeah 2012-01-04T14:01:50 K->0 wouldn't even make sense 2012-01-04T14:01:56 does it compile? 2012-01-04T14:01:59 *scratched, thought 2012-01-04T14:02:08 of course it does! 2012-01-04T14:02:19 what does it do rwest? 2012-01-04T14:02:20 k-- > 0 2012-01-04T14:02:25 >_< 2012-01-04T14:02:29 lol 2012-01-04T14:02:30 #ifdef NEVER_SET K-->0 #endif 2012-01-04T14:02:31 yea 2012-01-04T14:02:35 lol 2012-01-04T14:02:35 I'm an idiot 2012-01-04T14:02:52 that is why I space my operators out 2012-01-04T14:02:52 lol 2012-01-04T14:02:57 same here 2012-01-04T14:03:12 oh it means K-- > 0 2012-01-04T14:04:38 *** Accoun has quit IRC () 2012-01-04T14:05:02 ahow984_: it was really big 2012-01-04T14:05:03 lol 2012-01-04T14:05:16 fits in an unsigned long long though ;) 2012-01-04T14:05:21 yep 2012-01-04T14:05:38 If ulong sounds better to you, use D 2012-01-04T14:07:02 I'm not able for anymore projecteuler today :( 2012-01-04T14:07:25 really want an arduino to mess around with 2012-01-04T14:07:43 ahow984_: what do you intend to do with it? 2012-01-04T14:08:05 android peripheral! 2012-01-04T14:08:06 gogo 2012-01-04T14:08:11 if it's just leds i recomend the msp430 2012-01-04T14:08:14 heh 2012-01-04T14:08:24 no, wheels :) 2012-01-04T14:08:34 robot controlled over wifi 2012-01-04T14:08:53 or by some other wireless ways, but wifi is cool :) 2012-01-04T14:09:21 and possibly an exploring robot that maps out the area 2012-01-04T14:09:50 depending on if I'm smart enough :P 2012-01-04T14:11:31 I'll try to solve some card game I play with my family now and then. 2012-01-04T14:11:40 oh? 2012-01-04T14:12:11 That's where the problem came from, that I posted 2012-01-04T14:12:21 * ahow984_ scrolls 2012-01-04T14:12:30 ok, 6 done 2012-01-04T14:13:08 guess I can go back and do 3 real quick 2012-01-04T14:14:32 *** raemde has joined #aichallenge 2012-01-04T14:14:35 heh, I need to learn some maths 2012-01-04T14:14:48 It's a simple version of "President" with a 32-card deck 2012-01-04T14:15:08 *** smiley1983 has quit IRC (Ping timeout: 240 seconds) 2012-01-04T14:16:00 bleh I want to code something, any ideas? 2012-01-04T14:16:13 you need to play cards that are higher and at least the same amount of those on the table. So two 7s have to be beaten by at least two 8s. But three 8s or two 10s are also fine. 2012-01-04T14:17:18 *** smiley1983 has joined #aichallenge 2012-01-04T14:18:16 ahow984_: anything that motivates you. it is difficult to know for someone else 2012-01-04T14:18:36 maybe you want to detect faces in a picture? 2012-01-04T14:18:48 *** Accoun has joined #aichallenge 2012-01-04T14:19:11 mleise: too advanced for me I'm afraid :/ 2012-01-04T14:19:54 hehe, for me too, but these new digicams do it quite well in little time 2012-01-04T14:21:02 *** chris_0076 has joined #aichallenge 2012-01-04T14:22:01 *** smiley1983 has quit IRC (Ping timeout: 260 seconds) 2012-01-04T14:24:19 *** Paradoxiality has joined #aichallenge 2012-01-04T14:27:32 rofl at PE problems solved by wolfram alpha 2012-01-04T14:27:35 http://www.wolframalpha.com/input/?_=1325705200928&i=sum+of+all+primes+%3C+2000000&fp=1&incTime=true 2012-01-04T14:27:50 just look what I typed in to get that 2012-01-04T14:28:20 lol, pointless 2012-01-04T14:28:48 *** smiley1983 has joined #aichallenge 2012-01-04T14:28:54 derp 2012-01-04T14:28:57 I couldn't find my sieve of erathos program, so I asked wolfram 2012-01-04T14:29:14 It's not paricularly hard to write 2012-01-04T14:29:17 I know 2012-01-04T14:29:21 lol exactly pairofdice 2012-01-04T14:29:25 but I have done it many times before 2012-01-04T14:29:26 why bother 2012-01-04T14:29:31 true 2012-01-04T14:30:27 pick another problem to do? 2012-01-04T14:31:50 *** chris_0076 has quit IRC (Quit: Leaving) 2012-01-04T14:32:02 ahow984_: go ahead 2012-01-04T14:32:20 ahow984_: I am 1 behind you now 2012-01-04T14:32:22 I did 6 2012-01-04T14:32:23 lol 2012-01-04T14:32:59 bleh 2012-01-04T14:33:06 I don't know which one to do 2012-01-04T14:33:29 *** smiley1983 has quit IRC (Ping timeout: 252 seconds) 2012-01-04T14:33:29 *** mleise has quit IRC (Read error: Connection reset by peer) 2012-01-04T14:33:39 *** Chris_0076 has joined #aichallenge 2012-01-04T14:33:44 *** mleise has joined #aichallenge 2012-01-04T14:33:51 ahow984_: I am just doing the ones I know that will take me 5 mins 2012-01-04T14:34:17 heh 2012-01-04T14:35:06 ooo 1000 digit fibonacci 2012-01-04T14:35:22 still pE? 2012-01-04T14:35:30 sorry, you lost me at 1000 digits :P 2012-01-04T14:35:32 yeah mcstar 2012-01-04T14:35:37 ah, 240 :P 2012-01-04T14:35:43 http://projecteuler.net/problem=240 2012-01-04T14:35:50 I should learn something from that 2012-01-04T14:35:54 ahow984_: ill have a gmp solution soon for the previous problem 2012-01-04T14:36:04 lol 2012-01-04T14:36:13 I am doing pe 25 2012-01-04T14:36:13 I'm a terrible coder :P 2012-01-04T14:36:17 should take a minute 2012-01-04T14:36:28 I have fib with my own custom bigint type 2012-01-04T14:36:31 from school 2012-01-04T14:36:50 huh, nice 2012-01-04T14:36:53 67 and 97 should be easy 2012-01-04T14:37:18 and 48 2012-01-04T14:37:21 97 :O 2012-01-04T14:37:36 all of you have done math in college though 2012-01-04T14:37:46 I haven't even been near a college 2012-01-04T14:37:59 oh, same here 2012-01-04T14:38:01 In fact, I dropped out of high-school 2012-01-04T14:38:08 well you know a lot of maths so :P 2012-01-04T14:38:14 I really don't 2012-01-04T14:38:22 then how could 97 be easy!? 2012-01-04T14:38:29 *** UncleVasya has quit IRC (Ping timeout: 252 seconds) 2012-01-04T14:38:40 it's one line in python 2012-01-04T14:38:59 >_< py doesn't care how big numbers are, does it? 2012-01-04T14:39:05 No 2012-01-04T14:39:10 lol 2012-01-04T14:39:11 lol 2012-01-04T14:39:13 lol 2012-01-04T14:39:15 FUCK 2012-01-04T14:39:25 segfault 2012-01-04T14:39:27 :P 2012-01-04T14:39:32 ive been looking around for a bug in c++ 2012-01-04T14:39:45 the functional world made me forget i need RETURN 2012-01-04T14:39:58 unsafe sob language 2012-01-04T14:39:59 :D 2012-01-04T14:40:02 heh 2012-01-04T14:40:45 ahow984_: http://codepad.org/yCJSFq4K the algorithm is almost like in my haskell version 2012-01-04T14:41:26 the problem with gmp is that it cant make a number from a string like this "000342423" 2012-01-04T14:41:31 mcstar: mpz_class n(i) 2012-01-04T14:41:36 what does that mean? 2012-01-04T14:41:49 you get a bignum n initilized with i 2012-01-04T14:41:55 ah 2012-01-04T14:42:02 you could say this too: 2012-01-04T14:42:14 for(mpz_class i=0; ; i++) 2012-01-04T14:42:34 and the lychrel would make a copy of it 2012-01-04T14:42:59 my lack of knowledge in recursion is ruining me with these problems 2012-01-04T14:43:49 ok 25 done 2012-01-04T14:44:26 if you have 5 dice with 6 sides, how many permutations can you have? 2012-01-04T14:44:39 6^5 2012-01-04T14:44:43 5^6 2012-01-04T14:44:45 rather 2012-01-04T14:44:50 or wait 2012-01-04T14:44:53 bleh, should have known that 2012-01-04T14:44:53 not first was right 2012-01-04T14:45:02 ok 2012-01-04T14:45:03 ty 2012-01-04T14:45:15 lol 2012-01-04T14:45:19 6^5 2012-01-04T14:45:26 6 possibilities repeated 5 times 2012-01-04T14:45:39 yeah 2012-01-04T14:45:56 amstan: did you see my proposal? 2012-01-04T14:46:04 where? 2012-01-04T14:46:31 amstan: ill get the backlog 2012-01-04T14:47:05 amstan: i have an idea: id make the asteroids some kind of accumulators, the spaceship could fire a given "number" at them, that number identifies an enemy, the bigger the accumulated value for that id is, the faster the asteroid approaches that enemy, multiple spaceships can fire at a give asteroid, so players can balance it, but asteroids have a limit to this accumulation, when this value is exceeded, 2012-01-04T14:47:11 the asteroid explodes 2012-01-04T14:47:11 ahow984_: what problem you doing? 2012-01-04T14:47:31 240, I think it should be ok 2012-01-04T14:47:34 amstan: i told to aerique but i didnt receive an answer 2012-01-04T14:47:42 it's rather complicated 2012-01-04T14:47:52 it would be nicer if it was simple and intuitive 2012-01-04T14:48:01 *** UncleVasya has joined #aichallenge 2012-01-04T14:48:01 not more complicated than PW 2012-01-04T14:48:23 it kinda is, in pw the numbers meant number of ships 2012-01-04T14:48:27 amstan: that idea needs a stiwst 2012-01-04T14:48:32 twist 2012-01-04T14:48:35 friend told me a cool joke: 2012-01-04T14:48:48 asteroids alone wont make it 2012-01-04T14:48:54 or if it would, itd be boring 2012-01-04T14:48:56 why is the asteroid approaching enemies? 2012-01-04T14:49:05 because you charged it 2012-01-04T14:49:10 hehe 2012-01-04T14:49:21 i saw your mockup 2012-01-04T14:49:27 If you shoot at it it should go away from you ;p 2012-01-04T14:49:35 or explode 2012-01-04T14:49:38 no 2012-01-04T14:49:48 only explodes after it cant take more bullets 2012-01-04T14:49:50 or phaser fire 2012-01-04T14:49:53 whatever 2012-01-04T14:50:15 and the spacehips needs to target multiple asteroids after each other 2012-01-04T14:50:18 asteroids but you can't shoot directly at people? 2012-01-04T14:50:30 probably 2012-01-04T14:50:32 dunno 2012-01-04T14:50:32 you need to hit them with asteroids propelled at them by fire? 2012-01-04T14:50:39 i didnt work on the details 2012-01-04T14:50:40 And But I don't really like the asteroids anyway 2012-01-04T14:51:03 i think it would be something new 2012-01-04T14:51:05 pairofdice: i agree, me neither, im just saying, it needs a twist 2012-01-04T14:51:05 Year 2030. Vacantion: 'Our company looking for a talented web-programmer. Requirements: Html 7, CSS 5, ability to code a multibrowser sites (Firefox 45, Chrome 23, Opera 33.17, IE 6)' 2012-01-04T14:51:07 I would prefer just a straight dog-fight, with perhaps gravity 2012-01-04T14:51:32 Maybe in a an asteroids environment or maze or whatever 2012-01-04T14:51:40 great joke 2012-01-04T14:51:42 UncleVasya: yeah, just get IE93.js 2012-01-04T14:51:54 and wait until it boots on ie6 2012-01-04T14:52:04 xpilot gogo 2012-01-04T14:52:22 There are millions upon millions of games similar to xpilot 2012-01-04T14:52:35 Half of them from Finland D: 2012-01-04T14:53:01 * mcstar cant figure out what D: stands for 2012-01-04T14:53:05 rwest: I have an idea but I don't know how I'd put it in code 2012-01-04T14:53:09 mcstar: it's a frown 2012-01-04T14:53:31 turn your head 90deg clockwise 2012-01-04T14:53:41 somehing between a :| and a >: ? 2012-01-04T14:54:04 D: is to :D as ): is to :) 2012-01-04T14:54:14 anyah 2012-01-04T14:54:16 ah 2012-01-04T14:54:18 ok 2012-01-04T14:54:20 rwest: Its obvious that you can't sum 12^20 possibilities 2012-01-04T14:54:21 but pairofdice never smiley then 2012-01-04T14:54:29 well, in a reasonable length of time 2012-01-04T14:54:42 f 2012-01-04T14:54:44 smiles* 2012-01-04T14:54:55 he can only frown 2012-01-04T14:54:59 :) 2012-01-04T14:55:11 typo? 2012-01-04T14:55:30 rwest: nvm, I dunno what I'm saying 2012-01-04T14:56:23 Anyway, an environment which eventually will kill you if your AI doesn't know what to do would be great imo 2012-01-04T14:56:28 ahow984_: i hope you know btw that the fibonacci sequence has a closed form formula for its nth member 2012-01-04T14:56:57 yeah, I remember that now 2012-01-04T14:57:09 I still wouldn't be able to deal with 1000 digits though 2012-01-04T14:57:34 mcstar: fibs = 0 : 1 : zipWith (+) fibs (tail fibs) ? 2012-01-04T14:58:42 f_n=(\phi^n-\psi^n)/sqrt(5) 2012-01-04T14:59:12 i was quite proud when i came up with it out of nothing 2012-01-04T14:59:23 (ofc im quoting wikipedia now) 2012-01-04T14:59:45 pairofdice: yes! i like that 2012-01-04T14:59:48 btw, that code was on Haskell. 2012-01-04T14:59:52 Lazy. 2012-01-04T15:00:05 ive seen that before too 2012-01-04T15:00:09 i have a better one 2012-01-04T15:00:20 filetM(const [True,False]) 2012-01-04T15:00:25 filterM(const [True,False]) 2012-01-04T15:01:20 filterM is like filter(filters a list according to a predicate) but it is non-deterministic 2012-01-04T15:01:39 anyway, that function produces the power set of a set 2012-01-04T15:13:34 ahow984_: http://imgur.com/pZDPJ number of digits in the nth fibonacci number vs n 2012-01-04T15:13:43 (approximate) 2012-01-04T15:14:04 lol 2012-01-04T15:14:26 maybe I should learn py for the laugh.... 2012-01-04T15:14:29 brb 2012-01-04T15:20:09 contestbot_: quit 2012-01-04T16:39:40 *** contestbot has joined #aichallenge 2012-01-04T16:40:14 ahow984_: http://codepad.org/ZyKEDUmy 2012-01-04T16:41:21 :) 2012-01-04T16:41:22 yeah 2012-01-04T16:41:30 I got that a few seconds after you 2012-01-04T16:41:32 tyvm 2012-01-04T16:42:02 after this i dont expect you to understand my haskell codes, they use recusion heavily 2012-01-04T16:42:19 you might want to look around in the world of scheme 2012-01-04T16:42:24 or haskell 2012-01-04T16:42:26 or clojure 2012-01-04T16:42:36 in these languages recursion plays a big role 2012-01-04T16:42:42 I _hate_ recursion :( 2012-01-04T16:42:48 no 2012-01-04T16:42:49 whats annoying is that its so good 2012-01-04T16:42:53 you just dont love it yet 2012-01-04T16:42:56 but its such a strange concept 2012-01-04T16:44:46 ok got 34 :) 2012-01-04T16:44:51 :) 2012-01-04T16:44:53 congrats 2012-01-04T16:45:49 lol 2012-01-04T16:46:11 I just realised how am I supposed to add all the numbers together if I cant split it :P 2012-01-04T16:46:49 rwest: Was it interesting? 2012-01-04T16:58:41 *** thestinger has joined #aichallenge 2012-01-04T16:58:46 *** UncleVasya has quit IRC (Read error: Connection reset by peer) 2012-01-04T17:07:58 *** UncleVasya has joined #aichallenge 2012-01-04T17:09:35 damn, those recursive data structures 2012-01-04T17:10:00 recursive data structures 2012-01-04T17:10:05 wow, that sounds like hell 2012-01-04T17:10:14 tyvm mcstar, I finished 20 2012-01-04T17:10:24 im glad 2012-01-04T17:10:25 using both recursion and GMP lol 2012-01-04T17:10:33 damn 2012-01-04T17:10:41 i froze ghci with my data structure 2012-01-04T17:11:23 whoa, only -9 helped 2012-01-04T17:11:30 thats rare 2012-01-04T17:13:43 ahow984_: Infinite recursive data structures sounds even more awful. 2012-01-04T17:14:17 UncleVasya: ull see some very useful one, if i can finish it 2012-01-04T17:15:28 anything recursive sounds awful to me atm ;) I'm getting more comfortable though I think 2012-01-04T17:16:34 mcstar: why don't you ask why 34? 2012-01-04T17:16:58 why 34? 2012-01-04T17:17:12 it's too late :) 2012-01-04T17:17:41 * why didn't is more correct in this case, right? 2012-01-04T17:18:32 yes 2012-01-04T17:18:48 why didnt you ask my why i chose 34? 2012-01-04T17:18:50 " " 2012-01-04T17:18:55 so why? 2012-01-04T17:19:03 *** HaraKiri has quit IRC () 2012-01-04T17:19:07 oh 2012-01-04T17:19:13 i was supposed to asnwer that 2012-01-04T17:19:17 i dont know 2012-01-04T17:19:23 why should have i asked? 2012-01-04T17:19:48 because im not a curious problem? 2012-01-04T17:20:38 Because it must be interesting why I pick 34 2012-01-04T17:20:59 Beause I don't do Eulers problems. 2012-01-04T17:21:14 And even didn't read any of them. 2012-01-04T17:21:51 soooo why then? 2012-01-04T17:22:11 So... 34 might be some meaningful number for me ==> it even can be used somewhere in my passwords ==> it is useful to know somethin about it... 2012-01-04T17:22:56 althought it isn't true it could be a flow of ones thoughts 2012-01-04T17:23:28 ok, nvm. I realized I'm printing a crap :D 2012-01-04T17:24:26 ill keep that in mind 2012-01-04T17:24:35 and 16 down :) 2012-01-04T17:24:54 compiled first time using recursion 2012-01-04T17:25:11 *** GarfTop has joined #aichallenge 2012-01-04T17:25:12 recursion does make things simpler mcstar I will acknowledge that. Now I just need to practise 2012-01-04T17:25:25 gl 2012-01-04T17:25:51 i wish you a large stackspace 2012-01-04T17:25:56 heh 2012-01-04T17:26:22 O(N^N) or O(N!) 2012-01-04T17:26:24 *** Garf has quit IRC (Ping timeout: 240 seconds) 2012-01-04T17:26:31 which one is it for recursive functions? 2012-01-04T17:27:00 i have no ida what you mean 2012-01-04T17:27:01 I believe it depends of the type of recursion. 2012-01-04T17:27:41 the time taken for the function mcstar 2012-01-04T17:27:43 a simple recursion is liner in time in the number of applications 2012-01-04T17:27:49 O(n) 2012-01-04T17:27:56 Because in every function call you can call your recursive function 1 or more times. 2012-01-04T17:27:58 :O really 2012-01-04T17:28:01 wow 2012-01-04T17:28:21 I thought it was much larger.... 2012-01-04T17:28:26 it doesnt branch or anything 2012-01-04T17:28:32 suppose 2012-01-04T17:28:42 *** amstan_ has joined #aichallenge 2012-01-04T17:28:42 *** ChanServ sets mode: +o amstan_ 2012-01-04T17:28:48 but the work it does can be succesively harder to do 2012-01-04T17:28:54 so that can have a great impact 2012-01-04T17:29:20 just by saying "recursion" you doesnt describe the algorithmic complexity of your alg. 2012-01-04T17:29:27 dont* 2012-01-04T17:30:04 ahow984_: try to make the connection to an iteration ok? 2012-01-04T17:30:10 it is just like that 2012-01-04T17:30:35 mcstar: I have a billiard table and I know: position of my ball, position of another balls, size of the table and diameter of every ball. I need to determine if my ball can go to the right side of the table without collisions or not. 2012-01-04T17:30:44 What kind of problem is that? 2012-01-04T17:30:45 *** foRei has quit IRC (Quit: Bye) 2012-01-04T17:30:56 mcstar: ok 2012-01-04T17:31:14 What do I need to learn to be able to do it? 2012-01-04T17:31:26 UncleVasya: you mean "if your ball can fit in?" 2012-01-04T17:31:55 What I need to learn to be able solve such programming tasks? 2012-01-04T17:32:07 where is it? 2012-01-04T17:32:12 theres seems to be something missing 2012-01-04T17:32:25 It's an example problem from contest I will compete on April 4. 2012-01-04T17:32:34 link? 2012-01-04T17:32:35 rwest: how you getting on? 2012-01-04T17:33:27 *** Palmik has quit IRC (Remote host closed the connection) 2012-01-04T17:34:15 My uni sends me to participiate but I never did olympiadic programming, never solved tasks. In these fe months I need to learn at least something to take not-last place. 2012-01-04T17:34:33 It is on my computer, I can upload file. 2012-01-04T17:34:46 *few 2012-01-04T17:35:00 seems to me like some kind if linear programming 2012-01-04T17:35:24 you have imequalities, and the questions is whether you can satisfy a condition 2012-01-04T17:35:30 i need more info 2012-01-04T17:37:47 I'm uploading a bunch of example problems. Can you take a look and say how can I most effectively prepare for solving these tasks in given time? 2012-01-04T17:37:54 http://ompldr.org/vYzI2eQ/Problems.7z 2012-01-04T17:38:47 Problem A is a Dynamic Programming problem, C is for math. 2012-01-04T17:38:51 *** smjms has quit IRC (Quit: Konversation terminated!) 2012-01-04T17:38:57 UncleVasya: why do you think i have a clue :S 2012-01-04T17:39:17 You are solving Euler problems :) 2012-01-04T17:39:53 mcstar: about billiard is Problem G 2012-01-04T17:40:05 ok 2012-01-04T17:43:41 mcstar: I do not need a solution. I'm interested in what I need to read to be able to come with my own solution. 2012-01-04T17:45:00 *** g0llum has quit IRC (Read error: Connection reset by peer) 2012-01-04T17:45:55 first one: id get the power set of the indices, get all the permutations of them each, and then go over them(deleting characters as indicated by the elements), and checking for polindromiticity 2012-01-04T17:47:07 second one: i dont even understand 2012-01-04T17:47:31 UncleVasya: i want to do problem 26 tonight 2012-01-04T17:47:44 ok 2012-01-04T17:47:50 ok, ill read g 2012-01-04T17:48:16 Feel free to answer my question when you'll have a time 2012-01-04T17:48:28 G has a horrible translation 2012-01-04T17:49:28 *** sigh has quit IRC (Remote host closed the connection) 2012-01-04T17:50:06 UncleVasya: must the ball travel only horizontally? 2012-01-04T17:50:18 no 2012-01-04T17:50:35 so can it hit the wall/white balls? 2012-01-04T17:51:07 aha 2012-01-04T17:51:12 if so, it'd was easy even for me. 2012-01-04T17:51:25 ok, so the black ball can travel on ANY path 2012-01-04T17:51:32 so long it only touched the whie balls 2012-01-04T17:51:37 touches* 2012-01-04T17:51:40 white* 2012-01-04T17:52:41 I need to putput "Yes" if black ball can travel to the right side without touching white balls. 2012-01-04T17:52:49 *output 2012-01-04T17:53:07 yes 2012-01-04T17:53:27 well 2012-01-04T17:54:50 well 2012-01-04T17:54:55 i have some ideas 2012-01-04T17:55:27 the centers of the circles and the rectangle make up a polygonal-mesh 2012-01-04T17:55:46 *** amstan_ has quit IRC (Quit: Konversation terminated!) 2012-01-04T17:56:11 you draw points on the upper/lower sides closest to a ball 2012-01-04T17:56:13 *** amstan_ has joined #aichallenge 2012-01-04T17:56:13 *** ChanServ sets mode: +o amstan_ 2012-01-04T17:56:28 which leaves less space than the diameter of the black ball 2012-01-04T17:56:56 so anyway, these distances(from center to center) describe some connectivity 2012-01-04T17:57:19 if the distance is longer than D, the 2 regions are open to each other 2012-01-04T17:57:48 so after that you only have to find 1 path from the starting region to the end region to tell if ts ok 2012-01-04T17:58:05 so id make up some graph, and its easy after that 2012-01-04T17:58:45 i dont think you need any particular kind of math/technique to solve this 2012-01-04T17:59:02 To be fair, I need the solution to build my superior bot for Asteroids :D 2012-01-04T18:00:06 Space --> Ground --> Space. Next time I want something on water. 2012-01-04T18:00:13 Like Pirates. 2012-01-04T18:00:28 Or Deep Fish Batte. 2012-01-04T18:00:28 Ants had water 2012-01-04T18:00:35 Aquarium etc 2012-01-04T18:00:47 *** Blkt has quit IRC (Quit: ERC Version 5.3 (IRC client for Emacs)) 2012-01-04T18:00:57 1. The action was on the ground. 2012-01-04T18:01:15 *** Anilm3 has joined #aichallenge 2012-01-04T18:01:26 Hi 2012-01-04T18:01:34 2. Nobody but specs was calling it Water. Everyone was calling it Walls. 2012-01-04T18:01:45 Hi. 2012-01-04T18:01:56 Water is better though 2012-01-04T18:02:11 ants can climb walls 2012-01-04T18:02:15 no 2012-01-04T18:02:20 everyone called it water 2012-01-04T18:02:24 it was blue 2012-01-04T18:04:38 *** amstan_ has quit IRC (Ping timeout: 240 seconds) 2012-01-04T18:06:53 mcstar: i have no idea what you mean with the accumulators, but i'm sleepy and off to bed in a sec :-) 2012-01-04T18:07:04 aerique: hey! 2012-01-04T18:07:15 the asteroid could accumulate the fire it takes 2012-01-04T18:07:22 from different spaceships 2012-01-04T18:07:33 and it would only break into pieces if it exceeeds a limit 2012-01-04T18:07:48 so this is some kind of collaboration too 2012-01-04T18:08:04 because then you have many pieces that you can target the other ship 2012-01-04T18:08:09 with 2012-01-04T18:08:15 and it has the same 2012-01-04T18:08:16 ah i get it 2012-01-04T18:08:20 that's cool 2012-01-04T18:08:30 please add it to the prototype: http://github.com/aerique/aichallenge/tree/asteroids/asteroids 2012-01-04T18:08:35 ;-) 2012-01-04T18:08:36 :) 2012-01-04T18:08:39 lol 2012-01-04T18:08:41 mcstar: is there a game selected already? 2012-01-04T18:08:51 Anilm3: aerique proposed one 2012-01-04T18:08:54 mcstar: cool idea though 2012-01-04T18:09:07 well see 2012-01-04T18:09:09 Anilm3: They already have a protoype for asteroids. 2012-01-04T18:09:10 -e 2012-01-04T18:09:13 http://forums.aichallenge.org/viewtopic.php?f=21&t=2241 2012-01-04T18:09:20 But there was no official announce yet 2012-01-04T18:09:26 yeah, it is just a prototype to see if it is any fun 2012-01-04T18:09:27 ok 2012-01-04T18:09:35 i'm off to bed... o/ 2012-01-04T18:10:00 I wish you sweet dreams with Freddy. 2012-01-04T18:14:49 *** Anilm3 has quit IRC (Quit: leaving) 2012-01-04T18:17:45 *** X-Scale has quit IRC (Ping timeout: 268 seconds) 2012-01-04T18:18:31 bleh 2012-01-04T18:18:45 should have gotten 13 by now. GMP doesn't like arrays though 2012-01-04T18:20:50 *** X-Scale has joined #aichallenge 2012-01-04T18:21:09 *** X-Scale is now known as Guest1482 2012-01-04T18:26:42 *** Jak_o_Shadows has joined #aichallenge 2012-01-04T18:28:03 *** epicmonkey has quit IRC (Ping timeout: 244 seconds) 2012-01-04T18:35:07 awww yeah, problem 13 done 2012-01-04T18:35:24 I've done more PE problems today then I did in the last 9 months lol 2012-01-04T18:37:21 I haven't done any PE's for about a year I think 2012-01-04T18:37:24 :< 2012-01-04T18:38:33 heh, they're nice when you get them, but they eat up so much time 2012-01-04T18:41:34 *** dapplegate has quit IRC (Quit: Ex-Chat) 2012-01-04T18:45:06 yeah, I did 54 of them when I was learning to program 2012-01-04T18:45:08 but I got stuck 2012-01-04T18:45:15 *** JorgeB has quit IRC (Ping timeout: 252 seconds) 2012-01-04T18:45:18 I found that I either got them from the start, and they were easy 2012-01-04T18:45:30 or I would just waste time on them and couldn't figure them out 2012-01-04T18:45:50 also some of them I was just too lazy to do 2012-01-04T18:48:04 maybe I should try the ones I got stuck on before 2012-01-04T18:48:24 I was using python, so maybe I actually had some working solutions that were just too slow with cpython 2012-01-04T18:49:26 thestinger: 2012-01-04T18:49:40 I got stuck ages ago, but now I'm doing much better :) 2012-01-04T18:50:31 http://projecteuler.net/progress=strcat 2012-01-04T18:50:37 lets see if I can get to 100 :) 2012-01-04T18:50:49 I barely remember doing any of this 2012-01-04T18:51:00 I'm conor_f 2012-01-04T18:51:14 I guess I should find tree/graph search ones that I ignored before 2012-01-04T18:53:00 ahow984_: are you use gmp in C++? 2012-01-04T18:53:14 anyway I think you can get by with 64-bit ints 2012-01-04T18:53:32 yeah 2012-01-04T18:53:33 gmp 2012-01-04T18:53:41 I couldn't do any of them without it lol 2012-01-04T18:53:43 with the C API or the C++ one though? 2012-01-04T18:53:44 * ahow984_ is a brute 2012-01-04T18:53:49 what do you mean? :P 2012-01-04T18:53:55 * antimatroid might play around with some project euler later too 2012-01-04T18:54:03 I just brute force them all instead of doing the smart thing 2012-01-04T18:54:04 i haven't tried any problems in ages 2012-01-04T18:54:07 I don't know much math :( 2012-01-04T18:54:13 ahow984_: but how does gmp help you with that? 2012-01-04T18:54:21 it will be slower than just using 64-bit ints 2012-01-04T18:54:33 unless you mean you're just cheating and using their prime generation stuff, etc. :P 2012-01-04T18:54:35 lets you reach 2^1000 or 100! which unsigned long longs won't 2012-01-04T18:55:18 I seem to remember them saying on the forum that you can do it with just 64-bit ints though 2012-01-04T18:55:35 I don't really remember it since I did it like a year and a half ago 2012-01-04T18:56:26 prime generation is pretty easy anyway 2012-01-04T18:56:28 ahow984_: anyway, C++ is kind of a crappy language to do it in :P 2012-01-04T18:56:30 it's just a bunch of for loops 2012-01-04T18:56:35 yeah 2012-01-04T18:56:37 antimatroid: yeah 2012-01-04T18:56:43 simple and quick with a sieve 2012-01-04T18:56:48 an unoptimized sieve of eratosthenes is good enough 2012-01-04T18:56:55 but it's fun to optimize a bit 2012-01-04T18:57:55 yeah 2012-01-04T18:59:40 *** kevlar_work has quit IRC (Remote host closed the connection) 2012-01-04T19:00:25 antimatroid: What does it means? if(((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]))>=16*R*R) 2012-01-04T19:01:04 I'm trying to understand someone elses code. 2012-01-04T19:02:34 ((x1-x2) ^ 2 + (y1-y2) ^ 2)) ^ 1/2 is distance between to points, but here is no ^ /2 2012-01-04T19:02:44 And why exactly 16? 2012-01-04T19:03:02 UncleVasya: a magic number 2012-01-04T19:03:06 yeah no idea 2012-01-04T19:03:38 UncleVasya: probably 2^4, but who knows how they got to that 2012-01-04T19:04:19 *** cyphase has quit IRC (Ping timeout: 252 seconds) 2012-01-04T19:07:44 *** replore has joined #aichallenge 2012-01-04T19:09:33 *** Friblurks has joined #aichallenge 2012-01-04T19:10:05 thestinger, antimatroid, take a look if you have some time http://ompldr.org/vYzI5NQ/Billiard.zip 2012-01-04T19:10:23 There is a problem and 4 accepted solutions 2012-01-04T19:12:31 All of them used this formula so I thought it is some known one. 2012-01-04T19:12:31 *** Frib has quit IRC (Ping timeout: 248 seconds) 2012-01-04T19:14:29 *** mleise has quit IRC (Read error: Connection reset by peer) 2012-01-04T19:15:12 *** dr0b3rts has joined #aichallenge 2012-01-04T19:22:32 |__.__||__.__||__.__| 2012-01-04T19:22:41 thats (4*R)^2 2012-01-04T19:22:58 from __A____B____C__ 2012-01-04T19:23:02 from A to C 2012-01-04T19:23:51 seems to me i have to gave up my infinite recursive data declaration 2012-01-04T19:25:39 *** JorgeB has joined #aichallenge 2012-01-04T19:28:27 mcstar: ^2 goes as ^/2 to the left side => this condition checks if the distance between ball centers bigger than Ball radius * 2 (and 2 * radius = diameter) => my ball can go between these balls. Right? 2012-01-04T19:28:37 To be fair, I need the solution to build my superior bot for Asteroids :D 2012-01-04T19:28:45 sry 2012-01-04T19:28:53 last message was from history 2012-01-04T19:29:08 * ^ 1/2 2012-01-04T19:29:35 A and C must be that far apart for B to pass 2012-01-04T19:29:55 what is ^/2? 2012-01-04T19:29:59 thanks a lot! 2012-01-04T19:30:13 * ^ 1/2 2012-01-04T19:30:19 UncleVasya: im almost done with #26 2012-01-04T19:30:19 sqrt 2012-01-04T19:30:22 wait for it 2012-01-04T19:30:44 I think I understood the code now! 2012-01-04T19:32:41 thanks again, I'd could not understand that (x1-x2) ^ 2 + (y1-y2) ^ 2 == 16 * R * R is sqrt ( (x1-x2) ^ 2 + (y1-y2) ^ 2) == 4 * R 2012-01-04T19:36:53 mcstar: And you asked "why do you think I can help you?". That's why! :) 2012-01-04T19:37:04 *** Guest1482 is now known as X-Scale 2012-01-04T19:39:29 *** ahow984_ has quit IRC (Quit: leaving) 2012-01-04T19:42:59 *** smiley1983 has joined #aichallenge 2012-01-04T19:53:43 damn 2012-01-04T19:53:46 so close 2012-01-04T19:53:50 yet not there 2012-01-04T19:55:02 oh 2012-01-04T19:55:05 weird 2012-01-04T19:55:27 (97,96),(194,96),(291,96),(485,96),(873,96),(970,96) all these numbers have 96 long cycles 2012-01-04T19:58:06 http://boardgamegeek.com/blogpost/6931/ai-game-design-the-shibumi-challenge 2012-01-04T20:07:26 *** cyphase has joined #aichallenge 2012-01-04T20:08:48 *** smiley1983 has quit IRC (Ping timeout: 244 seconds) 2012-01-04T20:10:49 *** Fandekasp has joined #aichallenge 2012-01-04T20:12:54 ah damn 2012-01-04T20:13:06 *** Paradoxiality has joined #aichallenge 2012-01-04T20:26:25 mcstar: good luck with 26. 2012-01-04T20:26:32 aaaa 2012-01-04T20:26:32 *** UncleVasya has quit IRC () 2012-01-04T20:29:25 *** cyphase has quit IRC (Ping timeout: 252 seconds) 2012-01-04T20:30:48 *** mcstar has quit IRC (Quit: WeeChat 0.3.6) 2012-01-04T20:31:44 Hummmm 2012-01-04T20:41:49 *** cyphase has joined #aichallenge 2012-01-04T20:45:02 Yeah, not now... 2012-01-04T21:00:44 *** GarfTop has quit IRC (Read error: Connection reset by peer) 2012-01-04T21:11:02 *** smiley1983 has joined #aichallenge 2012-01-04T21:19:03 *** X-Scale has quit IRC (Ping timeout: 268 seconds) 2012-01-04T21:39:08 *** replore has quit IRC (Remote host closed the connection) 2012-01-04T21:51:29 *** smiley1983 has quit IRC (Ping timeout: 240 seconds) 2012-01-04T21:53:33 *** smiley1983 has joined #aichallenge 2012-01-04T22:00:09 *** nickjohnson has joined #aichallenge 2012-01-04T22:08:19 *** JorgeB has quit IRC (Ping timeout: 252 seconds) 2012-01-04T22:12:42 *** gaussin1 has joined #aichallenge 2012-01-04T22:13:06 *** grc48 has joined #aichallenge 2012-01-04T22:26:37 *** gaussin1 has quit IRC (Quit: Leaving.) 2012-01-04T22:31:16 *** AlliedEnvy has quit IRC (Ping timeout: 252 seconds) 2012-01-04T22:44:35 *** AlliedEnvy has joined #aichallenge 2012-01-04T22:50:00 *** Harpyon has quit IRC (Ping timeout: 244 seconds) 2012-01-04T22:53:54 *** treeform has quit IRC (Remote host closed the connection) 2012-01-04T22:54:09 *** Harpyon has joined #aichallenge 2012-01-04T23:11:06 *** u_ has joined #aichallenge 2012-01-04T23:14:11 *** treeform has joined #aichallenge 2012-01-04T23:21:02 *** replore has joined #aichallenge 2012-01-04T23:48:44 *** amstan_ has joined #aichallenge 2012-01-04T23:48:44 *** ChanServ sets mode: +o amstan_ 2012-01-04T23:49:44 *** AlliedEnvy has quit IRC (Ping timeout: 240 seconds) 2012-01-04T23:51:08 *** amstan has quit IRC (Ping timeout: 240 seconds) 2012-01-04T23:52:36 *** AlliedEnvy has joined #aichallenge