2011-06-24T00:00:29 *** nullkuhl has joined #aichallenge 2011-06-24T00:01:01 *** nullkuhl_ has joined #aichallenge 2011-06-24T00:02:25 *** nullkuhl__ has joined #aichallenge 2011-06-24T00:05:29 *** nullkuhl_ has quit IRC (Ping timeout: 244 seconds) 2011-06-24T00:11:37 *** _flag <_flag!~flag@69-165-173-172.dsl.teksavvy.com> has quit IRC (Quit: Lost terminal) 2011-06-24T00:21:13 *** stocha has joined #aichallenge 2011-06-24T00:21:28 There is a problem in the way timeout are handle at the moment. (http://aichallengebeta.hypertriangle.com/visualizer.php?game=35074&user=226&turn=24) 2011-06-24T00:21:56 Timeout bot should rather be normal bot with the don't move order for every ant. 2011-06-24T00:22:01 than what is done now. 2011-06-24T00:22:42 (it also totally screw the stat on the bot page, the linked game is said to be decided at turn 29. Which is certainly wrong when you take into account the timeout) 2011-06-24T00:23:35 *** stocha has quit IRC (Client Quit) 2011-06-24T00:36:33 *** nullkuhl__ has quit IRC (Remote host closed the connection) 2011-06-24T00:44:02 *** eggs_ has quit IRC (Quit: Page closed) 2011-06-24T00:54:04 *** McLeopold has joined #aichallenge 2011-06-24T00:54:23 antimatroid-uni: so, you around? 2011-06-24T01:06:25 janzert: with our new cutoff code, I'm inclined to remove the food bonus 2011-06-24T01:43:30 *** McLeopold has left #aichallenge 2011-06-24T01:49:11 *** Chris_0076 has joined #aichallenge 2011-06-24T01:49:45 *** Chris_0076 has quit IRC (Client Quit) 2011-06-24T02:10:52 *** sigh has quit IRC (Ping timeout: 250 seconds) 2011-06-24T02:16:21 *** sigh has joined #aichallenge 2011-06-24T02:29:40 *** sigh has quit IRC (Ping timeout: 260 seconds) 2011-06-24T02:32:22 *** stocha has joined #aichallenge 2011-06-24T02:41:05 what is a bot "without matching opponent" ? There are always opponents arround any bot. If you use the ranking. Event the highest and lowest do have neighbors. 2011-06-24T02:42:53 You could have a bias that choose the best player a litle more often to offset that he has less neighbors. 2011-06-24T02:43:16 *** stocha has quit IRC (Quit: Page closed) 2011-06-24T03:01:20 *** gobang has joined #aichallenge 2011-06-24T03:10:05 *** gobang has quit IRC (Read error: Connection reset by peer) 2011-06-24T03:10:58 *** gobang has joined #aichallenge 2011-06-24T03:18:36 *** aerique has joined #aichallenge 2011-06-24T03:29:36 *** amstan has quit IRC (Ping timeout: 255 seconds) 2011-06-24T03:29:47 *** ltriant has quit IRC (Quit: Computer has gone to sleep) 2011-06-24T03:50:22 @later tell McLeopold I'm still not clear whether we're using Python 2.6 or 2.7 to run playgame.py. 2011-06-24T03:50:22 aerique: Aye, aye, sir 2011-06-24T03:56:47 * antimatroid is writing a new map gen with more symmetries 2011-06-24T04:08:30 *** okayzed is now known as okay 2011-06-24T04:10:58 *** Palmik has joined #aichallenge 2011-06-24T04:28:56 *** okay is now known as okayzed 2011-06-24T04:41:40 *** mcstar has joined #aichallenge 2011-06-24T05:03:49 *** Accoun has quit IRC (Read error: Connection reset by peer) 2011-06-24T05:08:09 *** Accoun has joined #aichallenge 2011-06-24T05:39:49 so there is one way to do a "rotational" symmetry on a square grid with 8 players, 3 ways with 4 players and 7 ways with 2 players 2011-06-24T05:41:26 *** foRei has joined #aichallenge 2011-06-24T05:44:09 *** Accoun has quit IRC (Read error: Connection reset by peer) 2011-06-24T05:45:32 *** Palmik_ has joined #aichallenge 2011-06-24T05:45:51 *** Palmik has quit IRC (Read error: Connection reset by peer) 2011-06-24T05:58:18 *** choas has joined #aichallenge 2011-06-24T06:03:22 *** UncleVasya has joined #aichallenge 2011-06-24T06:03:46 lol: Your next game should be in about 13.233561645805967348000000000000 minutes. 2011-06-24T06:04:14 i like that everyone feels the need to comment on that :P 2011-06-24T06:05:04 *** choas has quit IRC (Quit: leaving) 2011-06-24T06:05:26 *** choas has joined #aichallenge 2011-06-24T06:05:49 4 of the types of rotational symmetry for 2 players require square maps 2011-06-24T06:05:54 3 can be rectangles 2011-06-24T06:06:13 happy midsummer festival for all of you! 2011-06-24T06:06:23 2 need to be squares for 4 player, 1 can be a rectangle, and needs to be a square for the one type of 8 player rotational symmetry 2011-06-24T06:07:23 antimatroid: going to read history and find another comments :) 2011-06-24T06:07:40 UncleVasya: (19:39:31) antimatroid: so there is one way to do a "rotational" symmetry on a square grid with 8 players, 3 ways with 4 players and 7 ways with 2 players 2011-06-24T06:09:47 antimatroid: I thought you'd answered on my comment about that big number. 2011-06-24T06:12:54 distance function is hard if player is very near but actually other side of the map 2011-06-24T06:13:12 my a* is crashing over there 2011-06-24T06:13:54 Rabidus: what do you mean? 2011-06-24T06:14:06 use the distance function given on the specs page 2011-06-24T06:14:16 although it can be worthwhile squaring it 2011-06-24T06:14:33 actually, you probably want to use manhatten for pathfinding 2011-06-24T06:14:36 like food coordinate is 1,1 and ant is at 1,195 (when map size is 300,300) 2011-06-24T06:14:46 nono he means to wrap on the edges 2011-06-24T06:14:50 i meant 200 * 200 2011-06-24T06:15:01 yes 2011-06-24T06:15:04 that's what i ment 2011-06-24T06:15:16 im educated myself in A* finally 2011-06-24T06:15:19 i really like it 2011-06-24T06:15:29 but i dont want to use graph searching at all 2011-06-24T06:15:40 Rabidus: http://pastebin.com/SCrz7kHH 2011-06-24T06:15:56 mcstar: how to you plan to find food? 2011-06-24T06:16:04 bfs is also graph searching 2011-06-24T06:16:09 i know 2011-06-24T06:16:25 i try to precompute some things and rely on geometric considerations 2011-06-24T06:17:15 bad idea :P 2011-06-24T06:17:25 thanks 2011-06-24T06:17:32 i use a* with multiple sources and multiple targets 2011-06-24T06:18:14 i hate this actually: i look at the map, i immediately know what goes where, why doesnt the computer too??? 2011-06-24T06:18:41 so i say to myself, come on, this can be done without searching, just use a proper representation 2011-06-24T06:19:02 path finding is a pretty common problem :P 2011-06-24T06:19:16 thank you Mr. Obvious :D 2011-06-24T06:19:16 do you think bfs and a* would be so common if they didn't work so well for the given problem? :P 2011-06-24T06:20:49 it cant hurt to view things from a different angle 2011-06-24T06:21:10 ok, thats not always true 2011-06-24T06:22:24 i'm not trying to be an ass, honest, just trying to make you see the light :) 2011-06-24T06:22:43 *** onensora has joined #aichallenge 2011-06-24T06:22:49 i guess i should consider using cpp too, right? 2011-06-24T06:22:58 i heard it is fast and glorious 2011-06-24T06:23:03 no, i just try to sway people on the edge there :P 2011-06-24T06:23:04 cause it's fun 2011-06-24T06:23:12 also people using java 2011-06-24T07:02:16 *** UncleVasya has quit IRC (Ping timeout: 260 seconds) 2011-06-24T07:13:57 *** Zaphus has joined #aichallenge 2011-06-24T07:30:54 my next game will be in 12.464539009106156632000000000000 seconds, wait only 13.85829228413217986300000000000 2011-06-24T07:30:57 wth? 2011-06-24T07:30:58 *** Accoun has joined #aichallenge 2011-06-24T07:31:00 Oh and D is also working at a low level so you can optimize your ... innovative new represantation of the map that enables the computer to 'see' where ants must go 2011-06-24T07:31:42 ... innovative 2011-06-24T07:31:48 nice adjective 2011-06-24T07:33:11 of course I'm going to precompute everything which is even better :P 2011-06-24T07:33:37 yeah, sure, but you CANT precompute everything 2011-06-24T07:34:01 and you cant find a better representation -.- 2011-06-24T07:34:09 hehe 2011-06-24T07:34:09 *** Kingpin13 has joined #aichallenge 2011-06-24T07:34:16 lol 2011-06-24T07:34:22 there is always a better one 2011-06-24T07:34:23 i have 3 seconds for my precalculation 2011-06-24T07:34:32 as long as people's opinions differ 2011-06-24T07:34:46 that's true 2011-06-24T07:35:07 i we were the borg, everything would be nice, and we would have much less standards 2011-06-24T07:35:09 oh shit, I don't know the map from the beginning 2011-06-24T07:35:16 hehe 2011-06-24T07:35:20 only part of it 2011-06-24T07:35:28 didnt you know that? 2011-06-24T07:35:36 I forgot for a second 2011-06-24T07:35:45 i thought about pre-computing "highways" 2011-06-24T07:35:54 but that would have to be incremental too 2011-06-24T07:36:15 Yes, I'll incrementally precalculate everything if that makes any sense 2011-06-24T07:36:38 but still, pre-computing individual paths is not feasible 2011-06-24T07:37:34 only, if you really can find a way to make the ai "know" about obstacles, and do a representation of circle-graphs 2011-06-24T07:38:08 so you can make an ant join, or to make it go in the vicinity of a highway 2011-06-24T07:38:39 and then, when the destination is reached within a specified perimeter, it will deviate from it 2011-06-24T07:38:47 of course this is a bit too general 2011-06-24T07:39:12 because usually you dont want to send the ants to ANY distance, only in its viewradius 2011-06-24T07:39:44 thats one reason i dont want to fully implement an A* for example, i think its an overkill 2011-06-24T07:44:46 please, dont say anything, really 2011-06-24T07:45:02 im not interested, thats why i wrote 7 lines 2011-06-24T07:45:05 for the fun of it 2011-06-24T07:45:15 why not i say, i like typing 2011-06-24T07:45:22 it improves sexual performance 2011-06-24T07:45:33 or is it running, i cant recall 2011-06-24T07:46:27 mcstar: I was afk, no need to feel like an abandonned child, haha 2011-06-24T07:46:51 i was afraid, daddy 2011-06-24T07:47:05 I wonder if there isn't any case where you want to send an ant into the unexplored area of the map. 2011-06-24T07:47:27 but maybe you could just as well send it to the border of the view radius 2011-06-24T07:48:38 yeah, and again and again if nothing interesting is in view 2011-06-24T07:49:09 Anyway it may be a bad idea to cripple the pathfinding early on. Later you may find a use for longer routes and then you aren't motivated to go back to pathfinding 2011-06-24T07:49:20 but usually this is not the case, the map tends to be crowded 2011-06-24T07:50:11 actually i dont intend to cripple it 2011-06-24T07:50:15 in that case the focus should be on collision avoidance and optimal planning of what ant goes first 2011-06-24T07:50:25 it would remain stable and robust 2011-06-24T07:50:39 only difference is that it might not find the absolute shortest route 2011-06-24T07:51:29 so what else do you plan to precompute? 2011-06-24T07:52:05 nothing, I'm just trying to cache whatever is feasible 2011-06-24T07:52:20 i use the start up time to make my grid into a graph 2011-06-24T07:52:32 then as i receive water information i remove neighbour information from squares 2011-06-24T07:52:48 antimatroid: a struct with 4 legs? 2011-06-24T07:52:49 I estimate the map size and memory requirements for the data structures and if it is ~100 MB it can be done :p 2011-06-24T07:53:01 and an array of those of course? 2011-06-24T07:53:44 cause i beleive if i really wantod represent it as a "graph" i would use binary number system 2011-06-24T07:53:56 ____ for NWSE 2011-06-24T07:54:15 _ stands for 1,0 2011-06-24T07:54:33 i have have to grab the neighbour locations from the squares vector 2011-06-24T07:54:45 no need to use nsew 2011-06-24T07:54:48 *** FireFly has joined #aichallenge 2011-06-24T07:55:15 well, an integer would represent the conenctivity 2011-06-24T07:55:29 can be faster than always fetching nbors, and checking their values 2011-06-24T07:56:16 squares vector? you mean that you represent the board in 1D as me? 2011-06-24T07:56:39 no, i have a grid which is a 2-dimensional vector of Square structs 2011-06-24T07:56:51 then each square struct has a vector of Locations to neighbours that aren't water 2011-06-24T07:57:04 lol, isnt it an array? in cs a vector is always 1d 2011-06-24T07:57:26 yes, but i still have it as a 2-dimensional array, it's just easier 2011-06-24T07:57:28 antimatroid: I initially used a 'normal' distance function for A*, but using manhattan distance gave better results (less iterations to find the same route) 2011-06-24T07:57:40 i could probably change that actually, because I have index functions that would do it for me 2011-06-24T07:57:52 aerique: i use manhattne 2011-06-24T07:58:14 i have functions to switch: row,col <-> index 2011-06-24T07:58:17 aerique: do you use multiple targets? 2011-06-24T07:58:27 antimatroid: right, this was in reply to something you said at 12:14 :) 2011-06-24T07:58:28 mcstar: me too *g* 2011-06-24T07:58:45 *** choas has quit IRC (Ping timeout: 244 seconds) 2011-06-24T07:59:10 antimatroid: no, just running a* multiple times to multiple food sources and sorting the path lengths 2011-06-24T07:59:22 mleise: surely n-dimensional vectors in c++/D are just implemented in 1d? 2011-06-24T07:59:30 aerique: sounds messy :P 2011-06-24T07:59:47 euclidian distance is very different than manhattan, even more for large distances 2011-06-24T07:59:59 aerique: http://pastebin.com/Z1a9T7wu :P 2011-06-24T08:00:06 ignore the comment :P 2011-06-24T08:00:11 its nice that a rectangle has all the equally short paths 2011-06-24T08:00:32 that's my heuristic function for a* with multiple targets 2011-06-24T08:01:01 antimatroid: depends. static arrays of byte[256][256] are 1-D, but dynamic arrays of byte[][] are really 2-D 2011-06-24T08:02:07 antimatroid: cheers :) 2011-06-24T08:03:07 mcstar: you just present all the thoughts I had yesterday during a walk through the park 2011-06-24T08:03:21 :) 2011-06-24T08:03:32 i have themfor some time 2011-06-24T08:04:50 aerique: i'm not positive it's faster doing this than just bfs with that heuristic function 2011-06-24T08:05:07 I also don't think I'll use the multiple targets idea for finding the path to an enemy ant or food. I can think of something slightly faster, hmm... if it works? 2011-06-24T08:05:17 the search path is much smaller, but a bfs is probably faster if you have lots of food with some close to ants 2011-06-24T08:05:33 mleise: you can do it with bfs fairly easily 2011-06-24T08:05:59 with a* the heuristic function can be painful, you have to call it for every location added to your search queue 2011-06-24T08:05:59 nah, everyone uses it, i need something else,just because 2011-06-24T08:06:16 mleise: exactly 2011-06-24T08:06:54 antimatroid: the heuristic function is very cheap 2011-06-24T08:06:56 antimatroid: have you tried weighted a* yet? (http://en.wikipedia.org/wiki/A*#Weighted_A.2A) 2011-06-24T08:07:02 why not call it every time? 2011-06-24T08:07:21 maybe optimize it a bit, but its not a problem i guess 2011-06-24T08:07:21 antimatroid: gives almost the same routes but much less iterations 2011-06-24T08:07:52 aerique: i don't understand what weighted a* is? (i read the link...) 2011-06-24T08:08:18 aerique: still, it is for hard-maps and it is very general 2011-06-24T08:08:41 antimatroid: you just multiply your h by a value > 1 2011-06-24T08:08:53 aerique: who the hell would i do that? :P 2011-06-24T08:09:00 i have had a different idea for path finding 2011-06-24T08:09:14 Oo 2011-06-24T08:09:28 antimatroid: you didn't read the link then :) 2011-06-24T08:09:40 anyway, back to work for me 2011-06-24T08:09:41 make information about the shortest number of turns an enemy ant could get in battle range of each land square, then use that to disclude squares while searching to avoid enemies 2011-06-24T08:11:16 lol, thats a lot of calculation isnt it? 2011-06-24T08:11:49 just consider that possibly, you can see more enemies than your own ants 2011-06-24T08:11:59 it's one pass of the entire grid to get information like that 2011-06-24T08:12:23 but you want to keep that info up to date i guess 2011-06-24T08:12:27 you have to do it again 2011-06-24T08:12:32 yeah, you would have to do it once per turn 2011-06-24T08:12:33 fairly cheap 2011-06-24T08:12:54 idk 2011-06-24T08:13:19 compared to my iterative path finding to collect food and enemies, that is almost free 2011-06-24T08:14:09 you know, the problem is that it would not be stable 2011-06-24T08:14:30 what do you mean? 2011-06-24T08:14:43 consider that for every turn you precompute your path to a target, but it can change when an enemy ant changes position 2011-06-24T08:14:48 for a given turn, i can calculate the information based off the enemy ants i see then use that information with my path finding 2011-06-24T08:15:00 i don't store information across turns 2011-06-24T08:15:05 it can happen that your ant cant monotonically decrease its distance from the start 2011-06-24T08:15:06 i recalculate everything from scratch 2011-06-24T08:17:15 oh, and the new viewradius isnt that much larger than the battleradius 2011-06-24T08:17:21 right? 2011-06-24T08:17:24 what? 2011-06-24T08:17:34 attack2=5 and view2 = 77 yeah? 2011-06-24T08:17:52 77? 2011-06-24T08:17:55 it was 55 2011-06-24T08:17:58 yeah 2011-06-24T08:18:00 then it went up 2011-06-24T08:18:07 aaa who can follow this.... 2011-06-24T08:18:16 it's beta 2011-06-24T08:18:21 we're trying to work out what works best 2011-06-24T08:18:27 aaa i dont care aaaa 2011-06-24T08:18:30 :D 2011-06-24T08:20:28 shat, there are soo many variants of these pathf. algs. 2011-06-24T08:34:19 *** choas has joined #aichallenge 2011-06-24T08:37:43 ever considered stopping food after N turns, so it stops being area control and turns into a fight ? 2011-06-24T08:58:04 Zaphus: i had not 2011-06-24T08:59:05 i kind of like the idea of two cutoff points 2011-06-24T08:59:15 one where food spawning stops then another where the game is actually called off 2011-06-24T08:59:24 yep 2011-06-24T08:59:56 just my observation that games are area control right now 2011-06-24T09:00:27 there's no battle bots :P 2011-06-24T09:00:35 well sir_macelon and flag, but they're clearly winning :P 2011-06-24T09:01:26 or are you battling as well now? 2011-06-24T09:05:13 not yet, except when the stars align 2011-06-24T09:06:29 i'm working on a new map generator 2011-06-24T09:06:37 it's going to do rotational symmetry too 2011-06-24T09:07:04 get an empty map in there ! 2011-06-24T09:07:20 i've made maxLandProportion 0.99 2011-06-24T09:07:24 i can make it 1.0 2011-06-24T09:07:33 it'd still be quite unlikely i expect 2011-06-24T09:07:41 .99 is effectively empty 2011-06-24T09:09:36 zelark has improved 2011-06-24T09:10:41 wish we could put the snake, blobby and other 'interesting' bots into the official contest for people to see - but I'm not wastng my one login on them 2011-06-24T09:10:58 no code, just an entry 2011-06-24T09:19:25 *** gobang has joined #aichallenge 2011-06-24T09:22:26 *** Zaphus has quit IRC (Quit: Page closed) 2011-06-24T09:59:51 symmetric_2 in technicolor http://imgur.com/scUDd 2011-06-24T10:17:25 *** aerique has quit IRC (Quit: ...) 2011-06-24T10:31:51 *** davidjliu has joined #aichallenge 2011-06-24T10:41:51 *** foRei has quit IRC (Quit: Bye) 2011-06-24T10:41:57 *** dr- has quit IRC (Quit: WeeChat 0.3.0) 2011-06-24T10:44:55 *** Kingpin13 has quit IRC (Quit: this used to be the life, but I don't need another one) 2011-06-24T10:56:16 i have ze ultimate map generator 2011-06-24T10:57:51 or zo you zinnk, Herr Cat 2011-06-24T10:58:34 *** foRei has joined #aichallenge 2011-06-24T11:06:55 bah, the only problem i have left is that rotational maps seem to hang on not getting fully connected :S 2011-06-24T11:08:13 antimatroid: can you write a map editor for the web? 2011-06-24T11:09:13 antimatroid is turing complete, so yes, he can do it 2011-06-24T11:09:47 hmm so can css3 then 2011-06-24T11:10:02 yeah, i heard 2011-06-24T11:10:21 i meant this as a joke, turing completeness is overused, and isnt really funny anymore :( 2011-06-24T11:11:07 but i never really programmed in antimatroid, i beleive its a dialect of cpp 2011-06-24T11:11:50 oh is it better than cx00? 2011-06-24T11:12:35 sure, it has the capability of overloading everything, like >> or << 2011-06-24T11:12:38 does antimatroid work with templates? 2011-06-24T11:12:52 it gives an unprecedented flexibitlity to antimatroid 2011-06-24T11:12:57 ah yes and switch operator precedence as well 2011-06-24T11:12:58 yes sure that too 2011-06-24T11:13:02 mleise: i do use templates 2011-06-24T11:13:06 i don't know how to do web sutff 2011-06-24T11:13:32 antimatroid doesnt have those libraries it seems, in time it will evolve 2011-06-24T11:13:43 hehe 2011-06-24T11:16:50 *** stocha has joined #aichallenge 2011-06-24T11:17:57 mcstar: good idea. Everything original is always worth trying. Especially if it doesn't take too much time, OR if it's satisfying :) 2011-06-24T11:18:30 guten morgen dear stocha 2011-06-24T11:18:38 to what exactly are you referring to? 2011-06-24T11:18:39 ? he is french 2011-06-24T11:18:44 so? 2011-06-24T11:18:50 bon apetit then 2011-06-24T11:18:52 mleise: yeah, sorry about htat :) 2011-06-24T11:18:58 haha 2011-06-24T11:19:42 mcstar: mm, i don't know. I think you were saying you don't want to do this (path finding ?) and you want to do that (highway precalculated incrementally ?). And someone would tell you that pathfinding is important or so. 2011-06-24T11:19:47 once queens of the stoneage played in a studio in the netherlands and said "diamonds in scheisse" 2011-06-24T11:19:53 i didn't read it very carfully really :) 2011-06-24T11:20:02 ah the logs 2011-06-24T11:20:07 you read them? nice 2011-06-24T11:20:20 mcstar: alles goed. 2011-06-24T11:20:28 gut 2011-06-24T11:20:47 mcstar: i'm excited because i uploaded my new prototype. 2011-06-24T11:21:01 it's a slow bot if there is one. but still i want to see how things go with it :p 2011-06-24T11:21:28 whats the improvement? 2011-06-24T11:21:29 (more than 30 time slower than my fast ref - running under stoha02 at the moment) 2011-06-24T11:21:31 is it written in jave 2011-06-24T11:21:51 mcstar: it the trying of a brand new stuff i didn't have in my framework before. 2011-06-24T11:22:09 stocha improved his bot: now its 30 times slower, to give chance to the enemies :D 2011-06-24T11:22:14 mleise: yeah. now that java works, i' probably stick to it. unless i really have time on my hands :p 2011-06-24T11:22:25 mcstar: it's slower thinking :) 2011-06-24T11:22:51 remember to wash your hands if you have time onthem 2011-06-24T11:22:55 mcstar: i hope it'll be slightly stronger than my ref greedy. 2011-06-24T11:23:09 i didn't try it at home. i just wanted to see how it does on the real thing. 2011-06-24T11:23:40 then i'll also see how fast it goes on the server, and maps. 2011-06-24T11:23:48 because there an embeded time monitor. 2011-06-24T11:24:44 in about 5.3463 minutes. i'll go on an errand on come back in a few minute then. 2011-06-24T11:25:02 hey it's really exciting when you upload a bot ! 2011-06-24T11:25:12 :) 2011-06-24T11:25:22 so you basically want to test timeouts? 2011-06-24T11:26:49 *** sigh has joined #aichallenge 2011-06-24T11:28:15 mcstar: i have a security built in. If it take more than 300, it will try to do less. 2011-06-24T11:28:18 300ms 2011-06-24T11:29:16 from some test game i ran at home, i realize i should have added some more feature :p lool. I don't care, Yeah !!!! (it's been like a week i had wanted to see this new part of my framework working. And it does seem to work - slowly but works !) 2011-06-24T11:29:30 the bot is pretty raw. 2011-06-24T11:29:49 where are you now regarding sloc? 2011-06-24T11:31:07 mcstar: sloc ? 2011-06-24T11:31:07 common abbreviation: source line of code ( i dont like it but people use it) 2011-06-24T11:31:34 mcstar: i don't understand the question. 2011-06-24T11:31:48 mm, i should add ennemy ants avoidance probably 2011-06-24T11:32:03 how many lines do you have in all of your sorces that relates to the aichallenge bots? 2011-06-24T11:32:12 sources 2011-06-24T11:35:46 everything works except one of the types of symmetry :\ 2011-06-24T11:36:56 stocha: how many? im interested in knowing how big your bot is 2011-06-24T11:37:04 my loc went up since I started putting { on a new line :D 2011-06-24T11:37:05 http://pastebin.com/a0ebz8CE 2011-06-24T11:37:09 there's some rotational maps 2011-06-24T11:37:09 gimme an estimate 2011-06-24T11:37:19 some might not be symmetric as i mentioned above 2011-06-24T11:37:27 mleise: cheap trick 2011-06-24T11:37:33 *** astevenson has joined #aichallenge 2011-06-24T11:37:51 of course in lisp that is totally unacceptable 2011-06-24T11:38:16 to write opening/closing parantheses on new lines 2011-06-24T11:38:25 i can imagine 2011-06-24T11:39:12 why not count bytes. that seems to be as accurate 2011-06-24T11:39:43 our functions and variables tend to have long names :) 2011-06-24T11:42:14 hm, i think stocha started to count the lines by hand 2011-06-24T11:43:03 *** sigh has quit IRC (Quit: This computer has gone to sleep) 2011-06-24T11:44:15 *** demerzel has joined #aichallenge 2011-06-24T11:46:21 *** sigh has joined #aichallenge 2011-06-24T11:48:40 *** choas has quit IRC (Ping timeout: 244 seconds) 2011-06-24T11:48:58 wc -l stocha! 2011-06-24T11:49:23 stocha is on the wc 2011-06-24T11:51:33 contestbot_: later tell McLeopold I'm still rather inclined to do away with scoring altogether and go strictly by inverse order of elimination ;) 2011-06-24T11:51:33 janzert: I come to serve. 2011-06-24T11:51:57 *** _flag <_flag!~flag@69-165-173-172.dsl.teksavvy.com> has joined #aichallenge 2011-06-24T11:55:20 so all you have to do is survive? 2011-06-24T11:55:55 *** nux67 has joined #aichallenge 2011-06-24T11:57:32 *** sigh has quit IRC (Quit: This computer has gone to sleep) 2011-06-24T12:03:10 *** sigh has joined #aichallenge 2011-06-24T12:06:05 yes, although I'm being rather facetious there 2011-06-24T12:07:04 janzert: I have new maps :) 2011-06-24T12:07:26 the last thing i need to do is be able to check that an nxn block can reach every land square 2011-06-24T12:07:33 great, I saw you had rotational symmetry working 2011-06-24T12:07:56 making some 'maze' maps too? 2011-06-24T12:08:05 i thought i'd be able to do 7 types of rotational symmetry with 2 players 2011-06-24T12:08:19 but two of the types don't seem to work with the way everything else does :\ 2011-06-24T12:08:35 <_flag> Will there even be games with two players? 2011-06-24T12:08:49 those being (r,c) -> (rows-c-1, r) and (r,c) -> (c, cols-r-1) 2011-06-24T12:08:58 those two break for some reason 2011-06-24T12:09:04 I'd like to see some maps that feel fundamentally different from the current 'random blob' maps rather than just different symmetries of 'random blob' ;) 2011-06-24T12:10:31 hopefully it's not too hard to adds more types of maps into this generator 2011-06-24T12:10:39 good 2011-06-24T12:10:49 it's all in one big class thing though 2011-06-24T12:10:57 which is a bit rank, but my python fu is lacking 2011-06-24T12:11:30 i'm going to translate the maps too 2011-06-24T12:11:40 i think that should make it even harder to work out the type of symmetry 2011-06-24T12:11:51 *** sigh has quit IRC (Ping timeout: 276 seconds) 2011-06-24T12:12:26 *** sigh has joined #aichallenge 2011-06-24T12:12:36 *** choas has joined #aichallenge 2011-06-24T12:13:07 *someone* should really write a map editor 2011-06-24T12:13:52 a really detailed one would be sweet 2011-06-24T12:14:06 like you say what type of symmetry you want, then it fills in symmetric squares as you edit one 2011-06-24T12:14:09 nonono, don't call for gfx and detail 2011-06-24T12:14:34 mleise: i don't expect you to do more dw :) 2011-06-24T12:14:43 ah yes, that's a good idea antimatroid. something i once started with, but I didn't fell like spending time on it 2011-06-24T12:15:13 *** McLeopold has joined #aichallenge 2011-06-24T12:15:35 McLeopold: I have a rotational map generator :) 2011-06-24T12:15:55 cool, are you including the ant starting orientation? 2011-06-24T12:16:13 not yet, what format do you want? 2011-06-24T12:16:18 that's one of the few things i have left 2011-06-24T12:16:27 s row col [nesw][nesw] 2011-06-24T12:16:30 http://pastebin.com/ayLMrWYa 2011-06-24T12:16:36 some drafts for you :P 2011-06-24T12:16:43 ant paste! 2011-06-24T12:16:50 ants.zeroviz.us 2011-06-24T12:17:44 bah, this is many at once :P 2011-06-24T12:17:47 i'm still working on it 2011-06-24T12:17:52 *** stocha has quit IRC (Ping timeout: 252 seconds) 2011-06-24T12:18:02 McLeopold: btw, are you still interested in the map viewing feature of the visualizer? 2011-06-24T12:18:43 yes, how do I use it? 2011-06-24T12:18:56 Just load the map as the replay file 2011-06-24T12:19:03 McLeopold: "s row col [n][e]" or "s row col n e"? 2011-06-24T12:20:12 http://ants.zeroviz.us/PW4xK/ 2011-06-24T12:20:35 mleise: I'll try that 2011-06-24T12:22:19