[01:29] MSG: Ping timeout: 240 seconds [01:29] Join: Caelian|w joined #corewars [02:04] Join: Caelian_ joined #corewars [02:07] MSG: Ping timeout: 240 seconds [04:29] MSG: Ping timeout: 240 seconds [04:43] Join: pak21 joined #corewars [06:57] bvowk named me the commander of the obvious.. [06:57] http://www.macguff.fr/goomi/unspeakable/WEBIMAGES/CARTOON/w002-obvious.jpg [07:22] MSG: Read error: Operation timed out [07:26] Join: triple joined #corewars [09:39] fhdasdry [10:33] (hmm, as if "dried cod gas bladder" wasnt bad enough, wikipedia mentions Stir-fried Watermelon skin in a list of Cantonese cuisine) [11:03] Join: fiveop joined #corewars [11:23] "Chaoshan cuisine" [12:12] need a hunger? http://en.wikipedia.org/wiki/Image:Porkchopbun.jpg [18:00] Join: Roy joined #corewars [18:01] hR [18:02] hi [18:02] what is this talk about puzzles I see in the logs sporadicly? [18:03] http://koti.mbnet.fi/mizcu/corewars/puzzles.htm [18:03] A friend of mine created this site, nice puzzles: http://www.puzzlepicnic.com/ [18:05] Heh nice, redcode puzzles! [18:29] Roy: any other questions about the puzzle that comes to your mind? [18:29] I have updated it so many times that i might still have missed something obvious [18:29] Not really, thinking of a more effective solution then the obvious stuff [18:36] How about pspace? [18:38] why use pspace? [18:38] Secret, I don't need it anymore, got a faster algorithm! [18:38] i have not denied the use of the other parts of core, only limited the size of main program [18:39] Then I will use other parts of the core, I thought that would be allowed [18:42] i am not expecting anyone to send a redCOMPRESS:ed program to this challenge anyway [18:42] I'll try to make it fast though [20:02] me goes slp now [20:02] buh-bye [20:03] bey! [20:21] Join: Ant_222 joined #corewars [20:21] H [20:21] Hi everybody. [20:21] Hi [20:21] And who might you be, a new name? [20:21] Or just a new nickname? [20:21] Roy: the rumors report that you gonna write an array splitter two? [20:22] Its already done ;-) and lightning fast! [20:22] Roy: No, I am Ant_222. New guy. [20:23] You also made a splitter? [20:24] Yes. [20:24] How fast will your splitter sort this array: [20:24] s jmp 0, 1 [20:24] for 60 [20:24] dat -(s*3039)%61 [20:24] rof [20:25] Its length is 61 [20:25] I'll try! [20:26] OK. And what about this one: [20:26] It sorts it into 915 / 916 with in 1156 cycles, yours? [20:26] s jmp 0, 13 [20:26] for 60 [20:26] dat -(s*3039)%61 [20:26] rof [20:27] (only a little modification) [20:27] Oh! Mine takes about 1800!!! [20:27] The second one also takes 1156 cycles :-D [20:28] Thats a nice relieve.. I don't think I can make mine faster now.. [20:29] The second takes 1162. [20:29] Hmmm [20:29] Close hehe, but I still win [20:32] What about 6,5,5,5,22 and 22,5,5,6,5? [20:33] Ah, I made it a bit faster, the first two now take 1095 [20:35] 6-5-5-5-22: 127 and 22-5-5-6-5: 126....you? [20:35] First 102 [20:36] Second — 114 [20:36] Heh, mine is very bad when you do stuff like 1240 591 45 63 or something [20:38] Mine does it in 129 steps. [20:39] Mine in 2556 hehe [20:39] !!! [20:39] Your algorithm must be VERY exotic... [20:40] Not very, it just has one big downside [20:40] and that is big numbers [20:40] Oh... [20:41] It must be using some cyclical increments/decrements& [20:42] Not gonna tell ;-) How does your code do this: [20:43] n for 30 [20:43] dat 31-n [20:43] rof [20:43] k for 30 [20:43] dat 61-k [20:43] rof [20:43] (mine in 1071) [20:44] There's no jmp 0 ... How do I keep it from dying? [20:44] OK: Mine takes 1171 [20:45] Sorry: 1121 ;) [20:45] 1171 — 1121 ;) [20:46] =50, 1121 — 1071 = 50 [20:46] Close, but I am still slower [20:47] I place that code in my warrior and fight it against itself hehe [20:47] one big 400 line warrior... [20:48] Oh, I did it the same way before I had converted my prog to comply Mizcu's requirements. [20:56] :'( My program doesn't work... [21:04] * Ant_222 test writing remarks [21:05] Ok, bye everybody! [21:05] MSG: Quit: Ant_222 [22:18] MSG: Quit: Lost terminal [23:05] MSG: