2011-03-07T00:00:07 do you have bss03's latest version of the matchmaking page open? 2011-03-07T00:00:10 *** davidjliu has quit IRC (Quit: Page closed) 2011-03-07T00:00:17 no 2011-03-07T00:01:19 I don't like the "at random" part. 2011-03-07T00:01:25 I really don't want to disqualify any submissions after they've entered the contest unless they are causing actual problems with the servers 2011-03-07T00:01:34 You don't really do that in sql with any effeciency. 2011-03-07T00:02:45 it's kinda wordy... 2011-03-07T00:02:53 since it's only used to break ties getting rid of it shouldn't be effect much 2011-03-07T00:03:11 anyway in the future section 2011-03-07T00:03:13 where do you see disqualify? 2011-03-07T00:03:31 it's not in the page anymore 2011-03-07T00:03:44 I noticed it in your old page 2011-03-07T00:03:47 but anyway 2011-03-07T00:04:05 that was probably the "functional test game" 2011-03-07T00:04:14 in the future section I'd like to get rid of the first choice for seed the seed player 2011-03-07T00:04:15 I just didn't explain it well. 2011-03-07T00:04:41 so the seed is always based on user not submission basically 2011-03-07T00:05:19 new submission should come first, the cooldown prevents spamming 2011-03-07T00:05:20 then you don't need to worry about a pairing/resubmission cooldown at all and spamming submissions doesn't give you any value 2011-03-07T00:05:55 any cooldown shorter than the time to play your next match gives you an incentive to spam 2011-03-07T00:06:02 true... 2011-03-07T00:06:19 at which point just go by player instead of submission and be done with it 2011-03-07T00:07:07 The "at random" just means I take the first row the DB outputs. 2011-03-07T00:07:14 That why it is "random". 2011-03-07T00:07:23 put in an order by and define the criteria 2011-03-07T00:07:33 bss03-AFK: ugh.. stop using afk nicks.. irc has /away 2011-03-07T00:07:39 (which is submission_id, aka timestamp) 2011-03-07T00:07:49 I use the timestamp. 2011-03-07T00:07:53 nothing happend 2011-03-07T00:08:07 That en I say, If there are ties (unlikely) I take whatever the DB gives first. 2011-03-07T00:08:12 *** bss03-AFK is now known as bss03 2011-03-07T00:08:35 you can't have a tie with a unique id 2011-03-07T00:09:39 I don't think we actually want to prefer thier earlier or later submissions, so I'm hesitant to order by submission_id. 2011-03-07T00:10:06 a single users earlier/later? 2011-03-07T00:10:18 or the set of all new submissions? 2011-03-07T00:10:31 There's no going to be a lot of ties that are resolved at "random" anyway. Usually my last comparision is either a timestamp or a trueskill match quality. 2011-03-07T00:11:01 don't use timestamp, use unique ids 2011-03-07T00:11:06 Set of all submissions. Of course we only want to use the latest submission for most stuff. 2011-03-07T00:12:09 where are you using a timestamp that submission_id wouldn't give the same ordering (except in the case of a tie for the timestamp of course)? 2011-03-07T00:12:26 Comparing timestamps is virtually required. 2011-03-07T00:12:37 Would you rather I went by game_id? 2011-03-07T00:12:40 yes 2011-03-07T00:12:50 unique_id's are in order of time anyway 2011-03-07T00:12:57 and integers are faster 2011-03-07T00:13:14 I don't want to index timestamps 2011-03-07T00:13:42 Well, unique id aren't guaranteed to increase monotonically as time does. 2011-03-07T00:13:51 btw, I glad you've been putting in the work you have, it is looking good so far. 2011-03-07T00:14:02 But, I'm not gonna fight on that point. game_id or somesuch is fine. 2011-03-07T00:14:45 I think they are, if I know what monotonically means. 2011-03-07T00:14:53 you always count up 2011-03-07T00:15:06 Now, I really must get to bed. "Wake up call" in 7 hours. 2011-03-07T00:15:25 k, cya 2011-03-07T00:15:27 RDBMSes are allowed to re-use unique ids that are not longer in the table. 2011-03-07T00:15:29 I think they're a reason they're also called autoincrement 2011-03-07T00:15:39 we won't be doing that 2011-03-07T00:15:41 Most don't. 2011-03-07T00:15:44 there's 2011-03-07T00:16:05 the mysql auto_inc does a max() on the table 2011-03-07T00:16:20 MySQL autoincrement in particular doesn't -- it just does max() + 1. 2011-03-07T00:17:02 which is exactly what we need to guarantee right? 2011-03-07T00:17:10 yes, so id's will work 2011-03-07T00:17:36 Yeah, game_id will work fine. I'm a theoretical purest though. 2011-03-07T00:17:44 Why do you think I learned Haskell? ;) 2011-03-07T00:17:50 :) 2011-03-07T00:17:51 Night all. 2011-03-07T00:17:54 night 2011-03-07T00:17:56 :) 2011-03-07T00:17:58 goodnight 2011-03-07T00:18:03 again :P 2011-03-07T00:20:59 so the main server setup script minimally works installing stuff and setting up apache to serve up pages 2011-03-07T00:21:37 but I'm going to wait to add anything about setting up cron jobs until the new scripts are done since it appears they are all changing names anyway 2011-03-07T00:22:32 so now I just need to give it a good dose of flexibility :P 2011-03-07T00:24:29 we still using compile_anything? 2011-03-07T00:24:56 on the main server? depends on what you mean by still 2011-03-07T00:25:08 can markdown blocks be given a language syntax for highlighting? 2011-03-07T00:25:15 for the workers to compile 2011-03-07T00:25:21 it was in planetwars, once compilation is moved to the workers no 2011-03-07T00:25:29 yes, I believe so 2011-03-07T00:26:18 or it will for sure once the workers do compilation unless we want to fully jump ship and just use compile.sh/run.sh scripts for all submissions 2011-03-07T00:26:44 I'm not quite sure whether I'm ready or not to go that far 2011-03-07T00:27:29 let's assume no compile.sh for now 2011-03-07T00:29:25 yeah, then the worker will need compile_anything 2011-03-07T00:31:01 are you ok with simply choosing seed players in least recently played order? 2011-03-07T00:31:04 *** _flag <_flag!~flag@69-165-173-172.dsl.teksavvy.com> has quit IRC (Quit: Lost terminal) 2011-03-07T00:31:23 * janzert is editing the wiki page 2011-03-07T00:32:30 janzert: yes for seed players, based on user_id only, meaning no cool down 2011-03-07T00:32:57 s/user_id/game_id ? 2011-03-07T00:33:07 I would like to try and give players not spamming some leeway, but we can do that later. 2011-03-07T00:33:45 oh no, but yes 2011-03-07T00:34:19 get the game_id's per user, then select the seed player lowest game_id, nulls being lowest 2011-03-07T00:35:03 so "Choose the player with the minimal maximum game_id (nulls being lowest)" :) 2011-03-07T00:35:16 although I'm not sure that's the best way to put it on that page 2011-03-07T00:35:34 yah 2011-03-07T00:35:48 btw, we need to add scotland as a country :) 2011-03-07T00:36:32 * janzert will take no responsibility for countries included or excluded from the countries list :P 2011-03-07T00:36:52 and that fake country where anyone from the internet can be a citizen 2011-03-07T00:37:01 I can't remember the name... 2011-03-07T00:38:43 http://en.wikipedia.org/wiki/Principality_of_Sealand 2011-03-07T00:38:58 that's not the one I was thinking of, but them too :) 2011-03-07T00:39:17 didn't that burn a few years back 2011-03-07T00:39:40 ahh, yes in 2006 2011-03-07T00:45:07 http://en.wikipedia.org/wiki/Talossa 2011-03-07T00:45:09 there we go 2011-03-07T00:48:15 *** Palmik has joined #aichallenge 2011-03-07T00:50:02 *** delt0r___ has joined #aichallenge 2011-03-07T00:51:14 *** delt0r_ has quit IRC (Ping timeout: 246 seconds) 2011-03-07T00:53:28 *** McLeopold has left #aichallenge 2011-03-07T01:00:46 *** McLeopold has joined #aichallenge 2011-03-07T01:37:54 *** sigh has quit IRC (Ping timeout: 276 seconds) 2011-03-07T01:47:45 *** Cyndre__ has joined #aichallenge 2011-03-07T01:50:24 janzert: do you know if the main server was using php as a module? 2011-03-07T01:52:45 *** computerwiz_222 has joined #aichallenge 2011-03-07T01:53:09 not offhand 2011-03-07T01:55:24 I'm seeing the lack of persistent database connections 2011-03-07T01:55:40 *** Cyndre_ has quit IRC (*.net *.split) 2011-03-07T01:55:41 *** sketchyd_ has quit IRC (*.net *.split) 2011-03-07T01:55:41 *** computer1iz_222 has quit IRC (*.net *.split) 2011-03-07T01:55:43 *** Zannick has quit IRC (*.net *.split) 2011-03-07T01:55:46 *** sketchyd_ has joined #aichallenge 2011-03-07T01:58:26 *** Zannick has joined #aichallenge 2011-03-07T01:58:38 ok, looks like mod_php5 is indeed being used 2011-03-07T01:59:02 wow, was it really run without sql connection pooling? 2011-03-07T02:00:27 so far as I see it has no configuration beyond specifying it's used for the php files 2011-03-07T02:00:42 *** ZanniqlcKzxkq has joined #aichallenge 2011-03-07T02:00:44 *** chris___0076 has joined #aichallenge 2011-03-07T02:01:21 *** ZanniqlcKzxkq has quit IRC (Client Quit) 2011-03-07T02:03:25 *** chris__0076 has quit IRC (Ping timeout: 255 seconds) 2011-03-07T02:03:59 well it looks like it also has safe_mode off and open_basedir none :} 2011-03-07T02:05:03 yeah, i'm fixing safe mode off issues as well :( 2011-03-07T02:05:18 not familiar with open_basedir yet 2011-03-07T02:05:47 McLeopold: I'm unsure about your format for "space" 2011-03-07T02:06:06 you might end up with losts of (0,1,2): x, (0,2,4): x etc. situations? 2011-03-07T02:06:18 restricts where php scripts can open files, sort of a php specific chroot I believe 2011-03-07T02:06:25 none simply disables 2011-03-07T02:08:16 antimatroid: yes, there might be lots of combos 2011-03-07T02:08:34 okay, well i'll update that in a bit then make everthing functions and i think it's done 2011-03-07T02:08:59 okay, add_maps_to_database will import the function 2011-03-07T02:09:49 so could i really just throw everything i have as "main" now into a function called analyze_map? 2011-03-07T02:09:49 with the combos, I can know how much space player X can get to first, and just as fast as all others, etc. 2011-03-07T02:10:12 I can just add up the numbers I'm interested in. 2011-03-07T02:10:24 yep 2011-03-07T02:10:43 it was a little tricky working out how to calculate who can get where first, but i think what i have now is general 2011-03-07T02:11:02 I saw the pictures, they looked cool. 2011-03-07T02:11:19 actually, i need to make a couple of changes to make sure it can handle each player starting with more than one ant 2011-03-07T02:11:23 i think that's ideal? 2011-03-07T02:11:30 yes 2011-03-07T02:11:39 I hope to have multiple start maps 2011-03-07T02:11:42 they're small changes anyway, just adding a line or two in places 2011-03-07T02:12:07 *** amstan has quit IRC (Ping timeout: 240 seconds) 2011-03-07T02:14:14 *** boegel has joined #aichallenge 2011-03-07T02:32:18 *** sigh has joined #aichallenge 2011-03-07T02:40:51 *** Kingpin13 has quit IRC (Quit: You're a kitty!) 2011-03-07T02:49:21 test = [ [3, 4], [2,5] ] 2011-03-07T02:49:21 if [3,_] in test: 2011-03-07T02:49:21 is there a way to do what i'm trying to do there? 2011-03-07T03:05:30 antimatroid: len([x for x in test if x[0] == 3]) > 0 2011-03-07T03:05:48 i just separated it to two different lists :P 2011-03-07T03:07:07 actually, my method sucks... 2011-03-07T03:07:57 len([x for x in test if 3 in x]) > 0 2011-03-07T03:08:22 still not that fast, but it's 1 line 2011-03-07T03:13:31 antimatroid: did you care if the 3 was first or last? 2011-03-07T03:13:47 i used something else anyway :P 2011-03-07T03:13:51 http://codepad.org/2iNmRzyX 2011-03-07T03:14:02 that's unsorted and needing of more formatting, but that's sort of what you will be getting 2011-03-07T03:14:44 so, no squares equidistant to 3 or more? 2011-03-07T03:15:00 not in that map, but it's easy to construct a situation where it will happen 2011-03-07T03:15:13 i think i could potentially get 8+ players at an equidistance 2011-03-07T03:15:33 i'm using shortest paths for players to find "access", not euclidean distance 2011-03-07T03:16:45 i should probably check that each player has the same number of starting ants and enforce that? 2011-03-07T03:18:11 boy kinder surprise toys don't require much construction these days 2011-03-07T03:18:13 just stats, no enforement 2011-03-07T03:18:26 on a better note, there are easter bunny sized kinder surprises on sale 2011-03-07T03:18:51 is that the crappy plastic toy inside of a chocolate egg? 2011-03-07T03:18:51 erm, whenever something has been wrong i've been raising a ValueError? 2011-03-07T03:19:01 yeah, but the chocolate is awesome 2011-03-07T03:19:10 the chocolate is plastic too 2011-03-07T03:19:26 can't possibly be the same 2011-03-07T03:19:29 but I still ate it 2011-03-07T03:19:33 sigh: is kinder surprise chocolate plastic? 2011-03-07T03:19:47 o_O 2011-03-07T03:20:06 *tastes* like plastic 2011-03-07T03:20:25 i think you tried a different toy chocolate 2011-03-07T03:20:32 kinder surprise chocolate is some of the best i know of 2011-03-07T03:20:33 it came from germany 2011-03-07T03:20:42 maybe it was old? 2011-03-07T03:21:10 this is from ferrero in australia 2011-03-07T03:21:26 they make nutella! 2011-03-07T03:21:33 yes, nutella is awesome 2011-03-07T03:21:37 milo is more awesome 2011-03-07T03:21:56 also ferrero rocher 2011-03-07T03:21:59 ValueError is the map is not valid. Having extra starting spots can be a valid map, just unfair. 2011-03-07T03:22:14 i'm not sure whether knowing the center of a ferrero rocher makes that worse or nutella better 2011-03-07T03:22:36 McLeopold: okay, done 2011-03-07T03:22:50 center is just nutella*** 2011-03-07T03:22:57 maybe a 'starts' list in the dict then 2011-03-07T03:23:10 already on it :) 2011-03-07T03:24:44 can i tell python to take two lists and sort them both but by ordering the first list? 2011-03-07T03:25:06 or have i shot myself in the foot? 2011-03-07T03:27:39 what do you mean? 2011-03-07T03:29:12 do you mean this: x,y = zip(*sorted(zip(x,y))) 2011-03-07T03:32:25 will that just sort y elements the same way it sorts x elements? 2011-03-07T03:32:32 yes 2011-03-07T03:32:41 i'll see how i go 2011-03-07T03:33:52 poo, didn't sort it how i wanted :( 2011-03-07T03:34:30 can you give an example of what you want? 2011-03-07T03:38:32 sigh: http://codepad.org/O1VS6olf 2011-03-07T03:38:50 i would want 0, 1, 2, (0,1), etc., not 0, (0,1), 1, 2 etc. 2011-03-07T03:39:10 your method worked sorry 2011-03-07T03:39:16 i was referring to the general sort :) 2011-03-07T03:39:34 i'm confused 2011-03-07T03:40:09 oh ok, you don't like how python is comparing objects 2011-03-07T03:40:20 i'm not hating this time 2011-03-07T03:40:21 you can pass your own compare function into sorted 2011-03-07T03:40:37 just it didn't happen to work the way that would have currently been convenient 2011-03-07T03:41:47 hmm... my python says that 0 < 1 < 2 < (0,1) is True 2011-03-07T03:41:53 which is what you said you wanted? 2011-03-07T03:42:13 hmm i just called list.sort() and got that 2011-03-07T03:42:26 oh wait 2011-03-07T03:42:39 try 1 < (0,1)? 2011-03-07T03:42:44 True 2011-03-07T03:42:48 nah, that should be fine, nevermind me 2011-03-07T03:42:52 hmmm 2011-03-07T03:42:56 ok... 2011-03-07T03:45:49 oh, i am using lists :P 2011-03-07T03:45:55 my output is using ()'s 2011-03-07T03:46:35 can i "press" a list into a tuple? 2011-03-07T03:46:43 press? 2011-03-07T03:46:51 x,y = zip(*sorted(zip(x,y))) 2011-03-07T03:46:54 sorry 2011-03-07T03:47:08 either convert x,y manually or you can x,y = map(list,zip(*sorted(zip(x,y)))) 2011-03-07T03:47:08 like, make [1,2] = (1,2) 2011-03-07T03:47:15 list(x) 2011-03-07T03:47:29 tuple(list) 2011-03-07T03:48:08 i suggested just doing: x,y = list(x), list(y) 2011-03-07T03:48:16 clearest 2011-03-07T03:48:20 that wont help me :P 2011-03-07T03:48:36 i need to convert a list of lists into a list of tuples, not too bad 2011-03-07T03:48:43 then sort should just work for me 2011-03-07T03:48:57 map(tuple, x) 2011-03-07T03:48:58 [tuple(x) for x in list] 2011-03-07T03:49:06 I win 2011-03-07T03:50:15 not in python 3 :) 2011-03-07T03:50:36 oh, what does python 3 do? 2011-03-07T03:51:00 list(map(tuple, x)) 2011-03-07T03:51:10 but yeah, i forget about map and zip all the time 2011-03-07T03:51:36 python 3 is lazy and give you an iterator 2011-03-07T03:51:42 fair enough 2011-03-07T03:51:55 map is fun but crappy lambdas make it less useful 2011-03-07T03:53:13 no lambda in p3k 2011-03-07T03:54:04 dammit, they added back in, wrong again 2011-03-07T03:54:54 haha, I was hunting docs to verify that :P 2011-03-07T04:00:01 now python is just trolling me :\ 2011-03-07T04:00:16 i get the same logic response as sigh with a simple if, but if i sort by the tuples, same result :\ 2011-03-07T04:00:35 me thinks python sort isn't just using it is 2011-03-07T04:00:59 then that makes no sense :s 2011-03-07T04:01:04 paste code 2011-03-07T04:01:27 preferably a minimal case that demonstrates the problem 2011-03-07T04:01:49 bleh, have to reset internet 2011-03-07T04:02:34 I didn't know he was in control of the whole internet... 2011-03-07T04:03:41 *** antimatroid1 has joined #aichallenge 2011-03-07T04:03:52 the internet is back! 2011-03-07T04:06:11 *** antimatroid has quit IRC (Ping timeout: 248 seconds) 2011-03-07T04:06:42 well this is annoying 2011-03-07T04:07:15 i can't replicate it sorting the way it does with the analyzer with a simple test case :\\ 2011-03-07T04:08:27 got it 2011-03-07T04:09:45 is it this: 0 < [0] < (0,) 2011-03-07T04:10:11 yeah i think 2011-03-07T04:10:56 not sure how you've got lists and tuples mixed up in the same context, but good luck! 2011-03-07T04:12:38 http://codepad.org/vaq3GmXR - analyzer.py 2011-03-07T04:12:39 http://codepad.org/8dpwJaCs - amap.py 2011-03-07T04:12:43 that's the mess i'm dealing with :P 2011-03-07T04:13:51 i seriously need someone that knows python to write the "space" output part :P 2011-03-07T04:14:49 amap.map*** 2011-03-07T04:15:45 sigh: did i mention i've made my symmetric maps ensure now that no two players ever start in the same row or column? :P 2011-03-07T04:15:53 and i cant start everyone outside vision if necessary 2011-03-07T04:16:09 and i can do any number of players in a reasonable size 2011-03-07T04:16:10 cool 2011-03-07T04:16:13 well, within reason 2011-03-07T04:16:34 so the space output part, what needs to change? 2011-03-07T04:16:44 the code is awful? 2011-03-07T04:17:09 131 is the line where i'm trying to sort my information 2011-03-07T04:17:25 so it works? 2011-03-07T04:18:03 you can run that code with the given map and it should run fine 2011-03-07T04:18:09 it just wont sort properly 2011-03-07T04:18:15 "properly"* 2011-03-07T04:18:22 i'm sure whatever it's doing is considered proper 2011-03-07T04:18:42 I'll play around with it 2011-03-07T04:19:07 :) cheers 2011-03-07T04:19:27 feel free to uncomment the partion part and play around with the maps for cool pictures :P 2011-03-07T04:20:00 *** McLeopold has left #aichallenge 2011-03-07T04:20:04 i might change the print '.' line to print len(accessMap[row][col][1]) so it gives you more info 2011-03-07T04:26:25 lol, check this example map 2011-03-07T04:26:58 http://codepad.org/PxNQKauD 2011-03-07T04:27:23 12 people are at an equal distance to one square 2011-03-07T04:39:27 it would be cool if SOME of the maps required cooperating with your close enemy(s) in order to not just kill each other right away 2011-03-07T04:45:16 antimatroid1: I made the space output shorter: http://codepad.org/0SDBxlFR 2011-03-07T04:45:43 although I have no idea why you require what is formatted as a dictionary to be ordered 2011-03-07T04:47:08 *** iFire has quit IRC (Ping timeout: 264 seconds) 2011-03-07T04:48:43 *** iFire has joined #aichallenge 2011-03-07T04:50:13 *** kaemo has joined #aichallenge 2011-03-07T04:51:36 sigh: you think i could just leave it unordered? 2011-03-07T04:51:40 i should ask mcleopold 2011-03-07T04:51:44 that'd make my life much easier 2011-03-07T04:51:59 antimatroid1: more that the semantics of a dictionary imply unordered 2011-03-07T04:52:02 sigh: did you look at the case where 12 players are at an equal distance? 2011-03-07T04:52:21 yup 2011-03-07T04:52:30 http://codepad.org/frlP3LrS 2011-03-07T04:52:42 i suspect you could make it work for arbitrary numbers of players given enough room 2011-03-07T04:52:53 it would be fun to make such maps with a single food square right in the middle :D 2011-03-07T04:53:08 -) 2011-03-07T04:53:09 :) 2011-03-07T04:54:57 while the equilibrium would be a draw, the actual better position would be on the row near the center 2011-03-07T04:55:42 oh man 2011-03-07T04:55:58 i wonder if i could construct repeated rock paper scissors with those maps 2011-03-07T05:00:25 don't think rps would work, but some kind of game would 2011-03-07T05:01:28 antimatroid1: here you go, fixed your ordering problems and made the code a lot shorted and easier to read: http://codepad.org/qv9Wlcv6 2011-03-07T05:06:17 sigh: cheers :) 2011-03-07T05:26:56 have any of you seen modern family? 2011-03-07T05:27:05 i started watching it a few days ago, it's surprisingly funny 2011-03-07T05:33:39 nah, I haven't much of any tv recently 2011-03-07T05:42:17 *** iFire has quit IRC (Read error: Connection reset by peer) 2011-03-07T05:42:41 *** iFire has joined #aichallenge 2011-03-07T06:25:32 *** kaemo has quit IRC (Ping timeout: 240 seconds) 2011-03-07T06:29:22 *** javagamer has joined #aichallenge 2011-03-07T06:58:33 *** chris__0076 has joined #aichallenge 2011-03-07T07:01:08 *** chris___0076 has quit IRC (Ping timeout: 246 seconds) 2011-03-07T07:29:40 *** kaemo has joined #aichallenge 2011-03-07T07:53:53 *** sente has joined #aichallenge 2011-03-07T08:15:31 *** boegel has quit IRC (Quit: Leaving) 2011-03-07T08:16:46 *** boegel has joined #aichallenge 2011-03-07T08:18:06 *** sigh has quit IRC (Remote host closed the connection) 2011-03-07T08:36:27 *** Mathnerd314 has quit IRC (Ping timeout: 276 seconds) 2011-03-07T08:50:01 *** delt0r_ has joined #aichallenge 2011-03-07T08:51:24 *** delt0r___ has quit IRC (Ping timeout: 246 seconds) 2011-03-07T08:53:22 *** iFire has quit IRC (Read error: Connection reset by peer) 2011-03-07T08:53:42 *** kaemo has quit IRC (Ping timeout: 248 seconds) 2011-03-07T08:54:51 *** iFire has joined #aichallenge 2011-03-07T09:02:40 *** iFire has quit IRC (Read error: Connection reset by peer) 2011-03-07T09:02:57 *** iFire has joined #aichallenge 2011-03-07T09:07:40 *** iFire has joined #aichallenge 2011-03-07T09:13:33 *** amstan has joined #aichallenge 2011-03-07T09:13:33 *** ChanServ sets mode: +o amstan 2011-03-07T09:23:37 *** mceier has joined #aichallenge 2011-03-07T09:24:41 *** amstan has quit IRC (Ping timeout: 240 seconds) 2011-03-07T10:45:54 *** smellyhippy has quit IRC (Quit: Take your stinking clause off me you damn dirty predicate!) 2011-03-07T10:46:25 *** smellyhippy has joined #aichallenge 2011-03-07T10:46:26 *** smellyhippy has joined #aichallenge 2011-03-07T10:59:48 *** mega1 has joined #aichallenge 2011-03-07T11:10:49 *** superflit has joined #aichallenge 2011-03-07T12:08:01 *** Cyndre__ is now known as Cyndre 2011-03-07T12:09:24 *** amstan_ has joined #aichallenge 2011-03-07T12:09:24 *** ChanServ sets mode: +o amstan_ 2011-03-07T12:10:47 *** McLeopold has joined #aichallenge 2011-03-07T12:10:59 @seen j3camero 2011-03-07T12:10:59 McLeopold: j3camero was last seen in #aichallenge 5 days, 12 hours, 16 minutes, and 59 seconds ago: McLeopold: do you have a magic main-server-setup script, or did you manually do a bunch of stuff to create a test server? 2011-03-07T12:15:05 *** amstan_ has quit IRC (Ping timeout: 255 seconds) 2011-03-07T12:15:44 @later tell antimatroid: no, I don't care about order. I would just do a sum(count for players, count in stats['space'].items() where player in players). And then sigh would improve it. 2011-03-07T12:15:45 McLeopold: I come to serve. 2011-03-07T12:18:41 i'm here :P 2011-03-07T12:19:05 it's sorted now anyway thanks to sigh 2011-03-07T12:19:11 was about to say that it looks like you misunderstand and are printing the output 2011-03-07T12:19:19 i went to sleep early before, i'll add in ant counts in a minute then i think it's done 2011-03-07T12:19:42 janzert: i am printint it, what am i meant to be doing? 2011-03-07T12:19:52 all you need to do is place it in an actual python dict and return it 2011-03-07T12:20:11 ah, okay, i have no idea what they are, i'll go look them up 2011-03-07T12:20:17 (i don't know python :P) 2011-03-07T12:20:18 just sec I'll try and edit it on codepad 2011-03-07T12:20:41 have you got the link sigh gave me? 2011-03-07T12:20:44 i haven't edited that yet 2011-03-07T12:24:35 something like this http://codepad.org/5ja5Smwt 2011-03-07T12:25:22 also if your editor can do it all the tabs should be expanded into 4 spaces 2011-03-07T12:26:39 also just noticed landAccessPlayers should have tuples for all the keys, just change line 126 to 2011-03-07T12:26:59 landAccessPlayers[tuple(t[0])] += 1 2011-03-07T12:27:23 or actually just get rid of the if/elif all together 2011-03-07T12:28:18 so t[0] isn't needed? 2011-03-07T12:28:23 cheers for that 2011-03-07T12:28:44 t is a list right? 2011-03-07T12:28:52 oh hi 2011-03-07T12:29:20 hmm, let me work this out, sigh did that 2011-03-07T12:30:07 the whole thing from 120 to 126 could be changed into a list comprehension 2011-03-07T12:30:13 what happened to my accessCounts :\ 2011-03-07T12:30:30 is that all just in the landAccessPlayers? 2011-03-07T12:31:06 also, python isn't java, don't use fake reverse Hungarian notatioin 2011-03-07T12:31:09 yes, it looks like 2011-03-07T12:31:27 McLeopold: what do you mean? 2011-03-07T12:32:17 Uppercasing all words except for the first one. but I'm not totally serious 2011-03-07T12:32:46 btw, I was wrong about changing to a list comprehension above 2011-03-07T12:33:38 antimatroid1: it's in pep8, don't use mixed case for new development 2011-03-07T12:34:27 that's just what i tend to use for my own programs, do you want _'s? 2011-03-07T12:34:40 i don't mind changing that, i'm very indifferent about my variable naming convention 2011-03-07T12:34:47 if you want to be a serious python programmer, then yes 2011-03-07T12:35:02 ^^ I don't, I hate python :P 2011-03-07T12:35:03 I totally doesn't matter. 2011-03-07T12:35:18 But read through pep8 and try an use good style. 2011-03-07T12:35:35 I bet there's a script out there to fix it. 2011-03-07T12:35:54 https://github.com/aichallenge/aichallenge/wiki/Python-Style-Guide 2011-03-07T12:35:56 i shall, i am slowly picking it up for the sake of my programs here not being as awful 2011-03-07T12:36:18 which has links to pep8 and google python style guide 2011-03-07T12:36:42 from what I can tell the google style guide is a superset of pep 8 2011-03-07T12:37:16 the only thing that really gets me is the 80 character limit 2011-03-07T12:37:31 I'm constantly going over a feel like I'm making my code less readable. 2011-03-07T12:38:29 I go over around every few hundred lines 2011-03-07T12:39:02 usually when I start going over I use it as an indicator that I need to factor out a separate function or break a single statement up 2011-03-07T12:39:22 because your indent starts to far over? 2011-03-07T12:39:24 or just use python's excellent line continuations to make it more readable :) 2011-03-07T12:39:37 if that's what's causing it yes 2011-03-07T12:40:08