| --- Log opened Tue Jun 01 00:00:20 2010 |
| 00:01 | <@Kazriko> | 31. I know I'll regret saying this, but I think that's as good as I'm going to get it. |
| 00:04 | < Namegduf> | You can't be sure without spending a while longer on it, surely. |
| 00:04 | <@Kazriko> | yep. hah. |
| 00:07 | <@Kazriko> | See? I told you I would regret it. 30 parts. |
| 00:09 | <@Kazriko> | the initialization is now a 3x3 block with 7 components, it was initially pretty big. |
| 00:11 | <@Kazriko> | oh, 29 components now that my new init block obviated the need for one vestigial component to fix the empty tape case. |
| 00:12 | < Namegduf> | Is the number of components making a significant difference to use? |
| 00:12 | < Namegduf> | Otherwise this could be... premature optimisation! |
| 00:12 | < Namegduf> | XD |
| 00:13 | | Attilla [Attilla@Nightstar-39d02957.threembb.co.uk] has quit [Client closed the connection] |
| 00:13 | <@Kazriko> | well, it's more that I'm trying to find the smallest number of components that satisfies the tests, yet doesn't cheat like the one that is the best i've seen. :) |
| 00:19 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has quit [[NS] Quit: Blargh] |
| 00:19 | <@Kazriko> | 28. |
| 00:20 | <@Kazriko> | Ohoh. I can dual-purpose that blog. |
| 00:20 | <@Kazriko> | er. block |
| 00:20 | < Namegduf> | Might that not hurt maintainability? |
| 00:20 | < Namegduf> | Hahaha, sorry. |
| 00:20 | <@Kazriko> | Heh. |
| 00:20 | < Namegduf> | I'll stop now. XD |
| 00:20 | <@Kazriko> | 27. |
| 00:21 | <@Kazriko> | the cheating solution has 14, no way I can compete with that. |
| 00:23 | <@Kazriko> | I've halved the number of parts though. I think that's a success in optimizing. :) |
| 00:25 | <@Kazriko> | Only other thing that might help would be rotating the green/red swap 3x3 block around so I could reuse one of the decision blocks. |
| 00:26 | <@Kazriko> | Naa, that wouldn't help. |
| 01:01 | <@Kazriko> | Soldiers is ridiculously simple. heh |
| 01:02 | < celticminstrel> | Which one is that? |
| 01:02 | <@Kazriko> | multiply by 8. |
| 01:02 | < celticminstrel> | I got stuck on "move the last to the front". |
| 01:02 | < celticminstrel> | Multiply by eight is shift left three, right? So, just add three reds? |
| 01:02 | <@Kazriko> | yep. |
| 01:03 | < celticminstrel> | The other one I got stuck on was similar to moving the last to the front... |
| 01:03 | < celticminstrel> | I think... |
| 01:05 | <@Kazriko> | robomecha. |
| 01:07 | < celticminstrel> | I think the other one was androids or something. |
| 01:07 | <@Kazriko> | That one took awhile, but I solved it with 56 pieces, then optimized it down to 27 |
| 01:07 | < Namegduf> | celticminstrel: /82 |
| 01:07 | < Namegduf> | Er |
| 01:08 | <@Kazriko> | robomecha wasn't hard, I don't remember my solution though. |
| 01:08 | < celticminstrel> | Namegduf: What? |
| 01:08 | < Namegduf> | Sorry, changed my mind about replying and tried to change window, forgot what I was going to say. XD |
| 01:08 | <@Kazriko> | Hah. that bridge comes in handy, I hadn't known about it... |
| 01:25 | < Tarinaky> | Kazriko: I'm stuck on that game :/ |
| 01:25 | < Tarinaky> | I don't see how you can do Android - as I understand the problem it can't be solved by a Finite State Machine :x |
| 01:27 | < Tarinaky> | The only thing I can come up with for it requires two read heads :/ |
| 01:27 | <@Kazriko> | I had an init function that put a green on the end, made sure that it was all blues followed by reds... |
| 01:27 | <@Kazriko> | then a yellow dot at the other end. |
| 01:27 | <@Kazriko> | then I had something move each dot inward until they met at the middle. |
| 01:28 | <@Kazriko> | one only moved past blue, one moved past red, if they didn't meet in the middle, it fails. |
| 01:29 | <@Kazriko> | I pasted one of my older solutions above. |
| 01:30 | < Tarinaky> | I didn't understand the notation :/ |
| 01:30 | <@Kazriko> | you can paste it into the gear button on the main page. |
| 01:32 | <@Kazriko> | or at least it's supposed to. I haven't really used that part much. |
| 01:33 | <@Kazriko> | Ahh. You have to go to that level, then hit the save, then paste the code in. |
| 01:34 | < Tarinaky> | 'Meh'. I should be playing it anyway. >.> |
| 01:36 | <@ToxicFrog> | My approach was to verify that there are no (red, blue) pairs, then loop eating the first blue and red each time |
| 01:37 | <@Kazriko> | http://www.kongregate.com/games/PleasingFungus/manufactoria?level=135817 << maybe that link will work. |
| 01:38 | <@Kazriko> | That robo-teachers one is what is going to hurt my head. :) |
| 01:38 | <@ToxicFrog> | What is that one again? |
| 01:38 | <@Kazriko> | X blue followed by X red, followed by X blue. |
| 01:39 | <@ToxicFrog> | Aah |
| 01:39 | <@ToxicFrog> | That can be solved with a simple modification to the android one >.> |
| 01:39 | <@Kazriko> | yeah, doing it your way. |
| 01:39 | <@Kazriko> | the one I did won't handle it as well. |
| 01:39 | <@Kazriko> | how many parts was your android version? |
| 01:39 | <@ToxicFrog> | Let me check |
| 01:40 | <@Kazriko> | wondering if it's lower than mine. might be a good thing to switch to for the next one. |
| 01:41 | <@ToxicFrog> | 42 parts, although that's with no effort to optimize it (and also not knowing that you can mirror switches) |
| 01:42 | <@Kazriko> | ok, that was 56 with mine, no optimization. |
| 01:42 | <@Kazriko> | though, I can use a variant of mine to solve the police problem. :) |
| 01:43 | <@ToxicFrog> | Police I needed 88 for |
| 01:43 | <@Kazriko> | The only stumbling block on that is that I need a new way to denote the end of a string. |
| 01:44 | <@Kazriko> | I suspect I'll have to use a double-green or something. |
| 01:44 | <@ToxicFrog> | I used Y for the start and end markers and G for EOF. |
| 01:45 | <@Kazriko> | Possible. would have to determine which way to move it by location in the chart, but that would work. |
| 01:46 | <@ToxicFrog> | Basically mine worked as: |
| 01:46 | <@ToxicFrog> | - seek to the first yellow |
| 01:46 | | * Kazriko is supposed to be working. heh |
| 01:46 | < Tarinaky> | I think I've got a solution. |
| 01:46 | <@ToxicFrog> | - if it's yellow,yellow, replace it with one yellow, strip the green from the end and accept |
| 01:46 | < Tarinaky> | But it's very slow. |
| 01:46 | <@ToxicFrog> | - if it's yellow,*, replace it with *,yellow and move to the next block |
| 01:46 | <@Kazriko> | Nod. |
| 01:46 | <@ToxicFrog> | - seek to the next yellow and replace *,yellow with yellow,* |
| 01:47 | <@ToxicFrog> | - rewind tape and return to the start |
| 01:47 | <@ToxicFrog> | Basically, it moves each of them in from the ends; when they're adjacent it does some cleanup and accepts. |
| 01:47 | < Tarinaky> | 27 parts, best time 1:16 |
| 01:47 | < Tarinaky> | :x |
| 01:47 | <@ToxicFrog> | Tarinaky: for which one? |
| 01:47 | < Tarinaky> | Androids! |
| 01:47 | <@Kazriko> | was that with the one I pasted there? |
| 01:47 | < Tarinaky> | No. |
| 01:47 | < Tarinaky> | I didn't look at it. |
| 01:47 | <@Kazriko> | Ah, ok. Can it handle BBBBRR? |
| 01:48 | <@Kazriko> | (The unit test doesn't test for that, unfortunately.) |
| 01:48 | < Tarinaky> | Yes. Easily. |
| 01:48 | <@ToxicFrog> | Androids in 27, 1:16? Damn. MINE IS $@< !:19 |
| 01:48 | <@ToxicFrog> | 42, 1:19 |
| 01:48 | <@Kazriko> | 1:26 here with 27 components. |
| 01:48 | < Tarinaky> | If you tell me how to share I'll share :D |
| 01:48 | <@Kazriko> | my solution to androids is similar to your solution for police though. |
| 01:49 | <@Kazriko> | the floppy button, then share. |
| 01:50 | < Tarinaky> | Hmm. Why is Tinypic in polish? |
| 01:50 | < Tarinaky> | http://i45.tinypic.com/2ns76l1.png |
| 01:53 | < Tarinaky> | Thoughts? :D |
| 01:53 | <@Kazriko> | looks like frog's solution more or less. |
| 01:53 | < Tarinaky> | I thought Frog's solution had more components? |
| 01:53 | <@Kazriko> | yeah. but the concept behind it. |
| 01:53 | <@Kazriko> | optimized version of his. |
| 01:53 | < Tarinaky> | Ah. |
| 01:54 | < Tarinaky> | I'm not sure of the behavior of my solution with alternating patterns that begin with Blue. |
| 01:54 | <@Kazriko> | yeah, I think it would have trouble with alternating a bit. |
| 01:55 | <@Kazriko> | ah well. |
| 01:55 | | * Kazriko should probably stop messing with it. heh |
| 01:55 | < Tarinaky> | Oo. :/ |
| 01:56 | < Tarinaky> | I'm not sure how to do Soldiers without a Green or Yellow Eep |
| 01:56 | < Tarinaky> | Oh wait. |
| 01:56 | < Tarinaky> | I'm overthinking the problem. |
| 01:56 | <@Kazriko> | Yeah. :) |
| 01:57 | < Tarinaky> | NM. >.> |
| 01:57 | < Tarinaky> | Time to eat! |
| 01:59 | | Vornotron [vorn@ServerAdministrator.Nightstar.Net] has joined #code |
| 02:00 | | Vornicus-Latens [vorn@ServerAdministrator.Nightstar.Net] has quit [Ping timeout: 121 seconds] |
| 02:11 | <@Derakon> | Hrm. YouTube is lazy programmers. |
| 02:11 | <@Derakon> | "Your video will start in 1 seconds" |
| 02:13 | < celticminstrel> | ...self.__dict__ doesn't contain the methods? :/ |
| 02:14 | < celticminstrel> | Ooh. Let me guess; the class object contains the methods. |
| 02:14 | <@Kazriko> | have you tried dir()? |
| 02:14 | < celticminstrel> | ...dir()? |
| 02:15 | <@Derakon> | Incoming mini-paste. |
| 02:15 | <@Derakon> | >>> class Foo: |
| 02:15 | <@Derakon> | ... def bar(self): |
| 02:15 | <@Derakon> | ... pass |
| 02:15 | <@Derakon> | ... |
| 02:15 | <@Derakon> | >>> Foo.__dict__ |
| 02:15 | <@Derakon> | {'__module__': '__main__', 'bar': <function bar at 0x630630>, '__doc__': None} |
| 02:15 | < celticminstrel> | So yeah, the class object, not the instance. |
| 02:16 | < celticminstrel> | So, self.__class__.__dict__ |
| 02:19 | < Tarinaky> | Robomecha! is hard :/ |
| 02:20 | < Tarinaky> | I can't work out how to detect the last but one element. |
| 02:20 | < Tarinaky> | Or at least I could, but then it leaves me with the problem that I'm at the wrong end of the tape to write anything :/ |
| 02:22 | | * celticminstrel ends up using getattr() |
| 02:22 | <@McMartin> | Just remember not to call hasattr() three times in a row. |
| 02:22 | < celticminstrel> | Why not? |
| 02:23 | | RichardBarrell [mycatverbs@Nightstar-58acb782.cable.virginmedia.com] has quit [Ping timeout: 121 seconds] |
| 02:26 | < Tarinaky> | Kazriko: I'm struggling to come up with ideas on how to consume the last symbol :/ |
| 02:27 | < Tarinaky> | I can copy the last symbol to the front but I don't know how to detect the penultimate symbol such that I can consume the last one :/ |
| 02:30 | < Tarinaky> | I need some sort of read-ahead but I can't figure out how to do it :x |
| 02:31 | < celticminstrel> | That was pretty much exactly my trouble with moving the last symbol to the front. |
| 02:36 | <@ToxicFrog> | Tarinaky: append a G to the end, then look for a (*,G) sequence and swap it. |
| 02:43 | < Tarinaky> | Cheers. |
| 02:43 | < Tarinaky> | That helped a lot. |
| 02:45 | | * Vornotron returns home. |
| 02:46 | < Vornotron> | oh, dangit. |
| 02:46 | < Tarinaky> | 29 parts, best time 0:28 |
| 02:46 | < Vornotron> | I was hoping that I had a better version of Robotanks, but I do not, because i don't get writers. |
| 02:49 | < Tarinaky> | http://i50.tinypic.com/2hhd2lf.png |
| 02:49 | < Vornotron> | Which one is this? Last to first? |
| 02:50 | < Vornotron> | celticminstrel: because you don't want to summon hasattr. |
| 02:50 | < celticminstrel> | ...? |
| 02:51 | < Vornotron> | Say it out loud, and elide the "a" |
| 02:53 | | * Vornotron takes another stab at rocket planes. |
| 02:56 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has joined #code |
| 03:01 | | Reiv[Graduate] [orthianz@Nightstar-a6b72c02.xnet.co.nz] has joined #code |
| 03:13 | < Vornotron> | gnar, now it will start looping if there's an even number of reds involved. |
| 03:27 | < Vornotron> | arg, no, that's wrong too. |
| 03:33 | <@ToxicFrog> | Androids (again): 44 |
| 03:34 | | * Vornotron got 23 on that on his first try. |
| 03:34 | | * Vornotron now notices a minor improvement, gets it to 22. |
| 03:36 | | * Vornotron sees another minor improvement. 20. |
| 03:39 | < celticminstrel> | ...hatter? |
| 03:41 | < Vornotron> | Not the s, the a. Well, the second a. |
| 03:41 | < celticminstrel> | How do you elide an A? |
| 03:41 | < Vornotron> | You remove it |
| 03:41 | < celticminstrel> | Oh. |
| 03:42 | < celticminstrel> | ...hasttr... huh? |
| 03:42 | < Vornotron> | Say It Out Loud |
| 03:45 | <@ToxicFrog> | Rocket Planes in 55 parts, 7'19" |
| 03:45 | < celticminstrel> | It doesn't make any sense out loud. |
| 03:46 | <@ToxicFrog> | I think he's missing the ref :/ |
| 03:46 | < celticminstrel> | ...oh. |
| 03:46 | < celticminstrel> | Yeah, probably. |
| 03:49 | <@ToxicFrog> | Vornotron: Androids in 20 without cheating? What algorithm are you using? |
| 03:50 | < Vornotron> | Pull off a blue then a red each pass. |
| 03:53 | < Vornotron> | ?lvl=17&code=p12:5f3;p11:5f0;b11:4f3;c11:6f0;c10:6f3;y12:4f3;c10:8f2;c11:8f2;i12 :8f7;c12:6f3;c12:7f3;c12:9f3;c12:10f3;q13:4f3;c13:6f1;c13:7f1;c13:8f1;i13:5f3;p1 0:7f3;r11:7f0; |
| 03:54 | < Vornotron> | I'm curious as to what yours is doing if it's taking 40+ parts. |
| 03:54 | < Vornotron> | I still haven't figured out rocket planes at all. |
| 03:58 | <@ToxicFrog> | Mine is also pulling off a red and a blue each pass, but it has seperate check and modify circuits |
| 03:58 | <@ToxicFrog> | 21 parts are logic, 23 routing |
| 03:59 | <@ToxicFrog> | Rocket planes, for me, is the most horrible bubblesort ever |
| 04:00 | < Vornotron> | I was trying to bubblesort but it fails miserably - it can't detect a blue after an even number of red. |
| 04:02 | <@ToxicFrog> | Why does it need to be an even number? |
| 04:03 | < celticminstrel> | Ooh, I've got a robomecha that seems like it works... except for null input. |
| 04:04 | < Vornotron> | Because my thing knows to stop moving more blues to the front of this RB* sequence when it sees a second red. |
| 04:05 | | Reiv[Graduate] [orthianz@Nightstar-a6b72c02.xnet.co.nz] has quit [Connection reset by peer] |
| 04:05 | < Vornotron> | aaaaarg, dammit, duh |
| 04:05 | < Vornotron> | /knowing/ I see a second red I can just feed back into the loader for the red thing. |
| 04:11 | < celticminstrel> | Got it. 74 parts. |
| 04:12 | < celticminstrel> | Now for androids. |
| 04:12 | | Reiv[Graduate] [orthianz@Nightstar-a6b72c02.xnet.co.nz] has joined #code |
| 04:16 | | Reiv[Graduate] [orthianz@Nightstar-a6b72c02.xnet.co.nz] has quit [Client closed the connection] |
| 04:16 | < Vornotron> | GOT IT |
| 04:17 | < Vornotron> | 35/3:24 |
| 04:18 | <@ToxicFrog> | 55, 7'19" ;.; |
| 04:21 | | * Vornotron appears to be better at optimization than TF. |
| 04:21 | < Vornotron> | Okay, next up: add 1. |
| 04:27 | < celticminstrel> | ...I have an infinite loop. |
| 04:29 | < Vornotron> | on Androids? |
| 04:30 | < celticminstrel> | Yep. |
| 04:30 | < celticminstrel> | I have a basic idea of how to do it now. |
| 04:31 | | Reiv[Graduate] [orthianz@Nightstar-a6b72c02.xnet.co.nz] has joined #code |
| 04:31 | < Vornotron> | Your best bet is to eat the robot's program as you go - it doesn't have to get to the end with its stuff intact on "accept" tasks. |
| 04:32 | < celticminstrel> | I'm doing that, yeah; my test broke down when fed an unordered collection of colours, though. |
| 04:33 | < celticminstrel> | Now I'm tacking a green on the end as a marker. |
| 04:34 | | * Vornotron fiddles with it. Tag the end with YG, then do BY -> YR, RY -> B Accept, GY -> GB Accept. That'll do. |
| 04:37 | < celticminstrel> | 22 parts. |
| 04:37 | < celticminstrel> | And now I've unlocked dozens of others! |
| 04:41 | | Reiv [NSwebIRC@Nightstar-1055e8af.waikato.ac.nz] has joined #code |
| 04:42 | < Reiv> | Hey, Vorn |
| 04:42 | < Reiv> | Have you ever fiddled with regular grammar? |
| 04:42 | < Vornotron> | No. |
| 04:43 | <@ToxicFrog> | As in regexes? |
| 04:43 | < Reiv> | Darn. |
| 04:44 | < Reiv> | TF: Yeah; I was hunting to see if anyone had seen the "E -> TE" syntax instead of "expr -> Term Expr" |
| 04:52 | < Vornotron> | done. 49/3:28 |
| 04:53 | | * Reiv ponders. McMartin! Derakon! Have /you/ seen it? |
| 04:58 | <@Derakon> | Um, no. |
| 05:03 | | * Reiv scratches his head. The lecturer insists it's a pretty standard nomenclature. |
| 05:03 | <@Derakon> | Well, okay. We covered grammars briefly in one of my earlier courses in college, some six or seven years ago. |
| 05:04 | < Reiv> | Fair enough. |
| 05:06 | | AnnoDomini [annodomini@Nightstar-a012b5c8.adsl.tpnet.pl] has joined #code |
| 05:06 | | mode/#code [+o AnnoDomini] by Reiver |
| 05:27 | | Serah [Z@3A600C.A966FF.5BF32D.8E7ABA] has quit [Ping timeout: 121 seconds] |
| 05:35 | < Vornotron> | I really need to come up with a better solution for Police. If I can manage to find myself a little more room in it, then Judiciary becomes very easy. |
| 05:36 | < Reiv> | ?? |
| 05:37 | < celticminstrel> | Reiv: He's playing this game: http://www.kongregate.com/games/PleasingFungus/manufactoria |
| 05:37 | < celticminstrel> | It's a Turing machine, or something. |
| 05:38 | <@Kazriko> | It's like writing a finite state machine tied to a mercury delay line. |
| 05:38 | < celticminstrel> | ...mercury delay line? |
| 05:38 | < celticminstrel> | 3 |
| 05:38 | <@Kazriko> | an early type of memory... acoustic waves in mercury. |
| 05:42 | < Vornotron> | YOu get a queue of symbols, and tools like conveyor belts, readers (which pull from the queue), and writers (which push onto the queue). You need to set up your factory so that given a queue of symbols, it will manipulate that queue of symbols to have a particular property. |
| 05:42 | < Vornotron> | Or test to see whether the original queue of symbols had that property. |
| 05:45 | < Vornotron> | In this case: "police" asks you to manipulate your queue so that it now has a yellow symbol added exactly in the middle -- you never get queues that have yellow or green in them, you have to add them yourself -- and "judiciary" asks you to test whether the queue you get repeats itself exactly twice: RBBRBB for instance does; RBRBRB does not. |
| 05:46 | < Vornotron> | As you can probably imagine, being able to cut the thing precisely in half is helpful! |
| 05:48 | <@Kazriko> | yeah... |
| 05:49 | | * Kazriko finishes teacher in 25 components. |
| 05:49 | <@Kazriko> | i should try police soon... eh, maybe I'll finish the rest of teacher's branch first. |
| 05:51 | | celticminstrel [celticminstre@Nightstar-f8b608eb.cable.rogers.com] has quit [[NS] Quit: *whistles* Did you hear something?] |
| 05:57 | < Reiv> | ... acoustic waves was a form of memory? |
| 05:57 | <@Kazriko> | Yeah, really early on. |
| 05:57 | <@Kazriko> | a delay loop sort of memory. |
| 05:57 | <@Kazriko> | had to keep retransmitting it to keep it active as the data bounced back. |
| 05:58 | < Reiv> | That's really fascinating. This was actually used? |
| 05:58 | <@Kazriko> | Yeah. By the government in a research project. |
| 05:58 | <@Kazriko> | it died out pretty quickly though. |
| 05:59 | <@Kazriko> | (s/govt/us govt) |
| 06:05 | | Reiv [NSwebIRC@Nightstar-1055e8af.waikato.ac.nz] has quit [[NS] Quit: hoemtem] |
| 06:10 | <@Kazriko> | academic... hmm. |
| 06:13 | | * Vornotron cleans up his Police, going from 106 pieces to 55(!), and totally annihilating his old time. |
| 06:14 | <@Kazriko> | Yeah, it seems so easy to optimize them once you have them working... :) |
| 06:14 | <@Kazriko> | I always leave myself way too much room... |
| 06:24 | | Derakon is now known as Derakon[AFK] |
| 06:27 | <@Kazriko> | After playing with the harder ones, rocket planes seems like a simple thing now. :) |
| 06:35 | | Orth [orthianz@Nightstar-61f7c6d8.xnet.co.nz] has joined #code |
| 06:36 | | Reiv[Graduate] [orthianz@Nightstar-a6b72c02.xnet.co.nz] has quit [Ping timeout: 121 seconds] |
| 06:39 | | * Vornotron entires romps Judiciary. |
| 06:39 | < Vornotron> | entirely* |
| 06:40 | < Vornotron> | First try, even. |
| 06:43 | | * Vornotron works on Politicians now, which... actually doesn't look that hard. |
| 06:45 | <@Kazriko> | wasn't that hard really. |
| 06:46 | <@Kazriko> | lesse, 39 components with 56 seconds. |
| 06:47 | <@Kazriko> | Haven't really optimized it. |
| 06:47 | <@Kazriko> | working on generals now. I could just cut and paste my code from officers mostly, but I'm trying to rebuild it from scratch a bit cleaner. |
| 06:52 | < Vornotron> | Mine is 60 components and 39 seconds. |
| 06:53 | | * Vornotron gets cracking on Academic, which is... well, it's scary, is what it is. |
| 06:54 | <@Kazriko> | Yeah. I figured I'd save that for last... |
| 06:54 | < Vornotron> | oh I think I see it. |
| 06:57 | < Vornotron> | Yeah, I've figured it out. |
| 06:57 | <@Kazriko> | yep. that solution for generals was much cleaner than the one for officers. |
| 06:58 | <@Kazriko> | only 2 open now are police and academics. |
| 06:59 | <@Kazriko> | on academics, I have an idea, but I need to draw it up on paper a bit before I try to code it. |
| 07:00 | <@Kazriko> | ah, what the heck. I'll go ahead and try it live. heh |
| 07:05 | < Vornotron> | Victory |
| 07:05 | <@Kazriko> | Same. :) |
| 07:06 | <@Kazriko> | I'm sure mine is less efficient. |
| 07:06 | <@Kazriko> | 55/4:30 |
| 07:06 | < Vornotron> | 35/3:36 |
| 07:06 | <@Kazriko> | yep. Time to optimize. |
| 07:08 | | * Vornotron also snickers at the unlock from Academics. |
| 07:10 | < Vornotron> | ...it's times like these I'm glad I remember how two's complement arithmetic works. |
| 07:13 | | gnolam [lenin@Nightstar-38637aa0.priv.bahnhof.se] has joined #code |
| 07:17 | <@Kazriko> | 41/3:41. at least it's close on time. :) |
| 07:19 | <@Kazriko> | matched the time. still 4 parts over. *shrug* |
| 07:24 | < Vornotron> | Man. Stupid mistakes. |
| 07:26 | | * Vornotron draws a conveyor belt in the wrong direction. |
| 07:26 | <@Kazriko> | I do that a lot. |
| 07:27 | < Vornotron> | Engineers! |
| 07:27 | <@Kazriko> | that's about as concise as I can get academic. 31/3:20 |
| 07:27 | < Vornotron> | Well done. |
| 07:28 | <@Kazriko> | Hmm. Police, or engineer... |
| 07:28 | <@Kazriko> | I imagine that police might help me with engineer. |
| 07:34 | | * Vornotron completes engineer, no police work required. |
| 07:34 | < Vornotron> | 35/1:28 |
| 07:34 | | * jerith breezes through the first three levels, gets out of bed. |
| 07:35 | | * Kazriko was thinking something more like his original android setup, comparing as the dots pushed to the middle. |
| 07:35 | < Vornotron> | hey, look, a couple more levels. |
| 07:35 | <@Kazriko> | Ah, if you finish the first screen it gives you more? :) |
| 07:35 | < Vornotron> | Just a few. |
| 07:35 | < Vornotron> | First one is "Seraphim" |
| 07:40 | < Vornotron> | 33/1:02 |
| 07:40 | < Vornotron> | Okay it's not kidding around, now. |
| 07:42 | < Vornotron> | At all. |
| 07:53 | <@Kazriko> | 53/3:40 on police. The topology is a bit odd though, would be hard to fit another thing around it. |
| 07:56 | | * Kazriko scrunches a vertical structure horizontal, then goes to rebuild the big structure from horizontal to vertical. :) |
| 07:57 | <@Kazriko> | trying to leave a big open area in the middle. :) |
| 08:04 | <@Kazriko> | 49/3:37, but half the board is unused. |
| 08:05 | <@Kazriko> | well, just short of half. |
| 08:06 | <@Kazriko> | need to screenshot it and rebuild it for judiciary. |
| 08:11 | | * Vornotron rebuilds - 1. |
| 08:13 | <@Kazriko> | ok, that's done, now to write the new stuff. |
| 08:14 | < Vornotron> | The new stuff is easy, comparatively. |
| 08:23 | <@Kazriko> | Judiciary is huge. 93/4:46. :( |
| 08:24 | < Vornotron> | That's about what I got. |
| 08:25 | < Vornotron> | Someone apparently did it in 50. Yeesh. |
| 08:25 | <@Kazriko> | That would take an entirely different algorithm. heh |
| 08:25 | <@Kazriko> | mine already includes a really optimized 49-block chunk. |
| 08:25 | <@Kazriko> | I might be able to trim it to the 70's or 80's. |
| 08:31 | <@jerith> | Pity it's conveyors and not tubes. |
| 08:31 | <@jerith> | Otherwise you could have an Al Gore Ithm. *flees* |
| 08:31 | | * Vornotron throws jerith off the earth. |
| 08:32 | | * jerith inserts himself into a ballistic orbit toward the office, thereby saving himself the commute. |
| 08:34 | | * Vornotron eyes. |
| 08:35 | <@Kazriko> | 88/4:38. |
| 08:35 | < Vornotron> | Okay, I don't actually know how to do this. |
| 08:35 | <@jerith> | A `jerith` B <=> B `jerith` A |
| 08:36 | <@jerith> | (I stole that joke from Chalain.) |
| 08:36 | < Vornotron> | It's a very Chalain joke. |
| 08:36 | <@McMartin> | You Haskewwy wabbit |
| 08:37 | < Vornotron> | ...if I build two subtraction rigs, that might do it. |
| 08:40 | | Orth [orthianz@Nightstar-61f7c6d8.xnet.co.nz] has quit [Client closed the connection] |
| 08:46 | | Reiv[Graduate] [orthianz@Nightstar-61f7c6d8.xnet.co.nz] has joined #code |
| 08:57 | <@Kazriko> | Denubis says that http://www.zachtronicsindustries.com/?p=710 is similar in concept to that game. I'll have to look at it later. |
| 09:01 | <@Kazriko> | looks like integrated circuit design. heh |
| 09:09 | < Vornotron> | ...but bringing the stuff back around is a pain. |
| 09:11 | < Vornotron> | No. Don't do it that way. Clear the leading 0s, then compare right to left. |
| 09:18 | | * Vornotron tries to figure out even how /that/ should work, is stymied. |
| 09:19 | < Vornotron> | There's just... not quite enough room. |
| 09:22 | | You're now known as TheWatcher |
| 09:29 | < Vornotron> | oh, I see it now. |
| 09:40 | < Vornotron> | no, still not enough room. |
| 09:56 | | * Vornotron gives up. |
| 10:20 | | Rhamphoryncus [rhamph@Nightstar-bbc709c4.abhsia.telus.net] has quit [Ping timeout: 121 seconds] |
| 10:22 | | Rhamphoryncus [rhamph@Nightstar-bbc709c4.abhsia.telus.net] has joined #code |
| 10:52 | < gnolam> | Kazriko: that game just seems like straight-on digital logic design. |
| 10:53 | < gnolam> | Focusing on the boring part (routing), too. |
| 11:05 | <@Kazriko> | yeah. I'm not sure why Denubis said it was similar. But that site did link back to the same game. heh |
| 11:11 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has quit [Connection closed] |
| 11:49 | | Orth [orthianz@Nightstar-dc7deb6d.xnet.co.nz] has joined #code |
| 11:51 | | Reiv[Graduate] [orthianz@Nightstar-61f7c6d8.xnet.co.nz] has quit [Ping timeout: 121 seconds] |
| 12:14 | | Rhamphoryncus [rhamph@Nightstar-bbc709c4.abhsia.telus.net] has quit [Client exited] |
| 12:37 | | Serah [Z@3A600C.A966FF.5BF32D.8E7ABA] has joined #code |
| 13:20 | | Tarinaky [Tarinaky@Nightstar-e48aa38f.adsl.virginmedia.net] has quit [Ping timeout: 121 seconds] |
| 13:33 | | Tarinaky [Tarinaky@Nightstar-5c655275.adsl.virginmedia.net] has joined #code |
| 14:37 | | Orth [orthianz@Nightstar-dc7deb6d.xnet.co.nz] has quit [Connection reset by peer] |
| 14:44 | | Reiv[Graduate] [orthianz@Nightstar-dc7deb6d.xnet.co.nz] has joined #code |
| 14:52 | | EvilDarkLord [jjlehto3@Nightstar-f1ccbb45.hut.fi] has quit [Ping timeout: 121 seconds] |
| 14:57 | | Reiv[Graduate] [orthianz@Nightstar-dc7deb6d.xnet.co.nz] has quit [Connection reset by peer] |
| 14:57 | | EvilDarkLord [jjlehto3@Nightstar-f1ccbb45.hut.fi] has joined #code |
| 15:02 | | Netsplit *.net <-> *.split quits: Namegduf, Tarinaky, @McMartin, PinkFreud |
| 15:08 | | McMartin [mcmartin@Nightstar-dd07698f.pltn13.sbcglobal.net] has joined #code |
| 15:08 | | mode/#code [+o McMartin] by Reiver |
| 15:08 | | Tarinaky [Tarinaky@Nightstar-5c655275.adsl.virginmedia.net] has joined #code |
| 15:12 | | Reiv[Graduate] [orthianz@Nightstar-bb3d782c.xnet.co.nz] has joined #code |
| 15:21 | | Namegduf [namegduf@Nightstar-5c10d129.beshir.org] has joined #code |
| 15:44 | | mode/#code [-o Derakon[AFK]] by ChanServ |
| 15:44 | | PinkFreud [WhyNot@NetworkAdministrator.Nightstar.Net] has joined #code |
| 16:17 | | celticminstrel [celticminstre@Nightstar-f8b608eb.cable.rogers.com] has joined #code |
| 17:36 | | Attilla [Attilla@Nightstar-ba480caf.threembb.co.uk] has joined #code |
| 17:36 | | mode/#code [+o Attilla] by Reiver |
| 18:09 | | AnnoDomini [annodomini@Nightstar-a012b5c8.adsl.tpnet.pl] has quit [Ping timeout: 121 seconds] |
| 18:11 | | AnnoDomini [annodomini@Nightstar-a4817aa4.adsl.tpnet.pl] has joined #code |
| 18:11 | | mode/#code [+o AnnoDomini] by Reiver |
| 18:33 | | Reiv[Graduate] [orthianz@Nightstar-bb3d782c.xnet.co.nz] has quit [Connection reset by peer] |
| 18:39 | | Reiv[Graduate] [orthianz@Nightstar-bb3d782c.xnet.co.nz] has joined #code |
| 18:41 | | Reiv[Graduate] [orthianz@Nightstar-bb3d782c.xnet.co.nz] has quit [Client closed the connection] |
| 19:34 | <@ToxicFrog> | So, I'm finally reading up on Scala |
| 19:34 | <@ToxicFrog> | And so far I really, really like what I see |
| 19:36 | <@McMartin> | "Evaluate Scala for possible utility as an instructional language" is currently middle-ranked on my list of Things To Look Into. |
| 19:36 | | SmithKurosaki [Smith@Nightstar-0a57481d.dsl.teksavvy.com] has quit [Connection closed] |
| 19:54 | <@ToxicFrog> | It's like they took some of my favorite features of Haskell and made them run on the JVM |
| 19:56 | <@McMartin> | Also CIL, which means that it *should* be possible to create bundled EXEs as well. Not sure how cross-compatible JVM Scala and .NET Scala are yet. |
| 19:56 | <@McMartin> | Er, CLI, not CIL. |
| 20:00 | <@ToxicFrog> | A quick rummage on the website indicates that CLI support is slightly wobbly; no support for structural types or cross-language calls and they sound not-entirely-confident about exception correctness. |
| 20:08 | <@McMartin> | Ah well. |
| 20:09 | <@McMartin> | We'll see how it does by the time I actually get around to looking at the language~ |
| 20:13 | <@ToxicFrog> | Heh |
| 20:14 | <@ToxicFrog> | And on further examination I may have been looking at the docs for 1.4 anyways (it's currently up to 2.8 RC3) |
| 21:44 | | * jerith glares at his sorter for Rocket Planes. |
| 21:44 | <@jerith> | 53/8:10 |
| 21:55 | | Rhamphoryncus [rhamph@Nightstar-bbc709c4.abhsia.telus.net] has joined #code |
| 23:10 | <@jerith> | I think I'm missing a couple of algorithm optimisations. A few of my solutions are substantially bigger and slower than Vorn's and Kaz's. |
| 23:10 | <@jerith> | But I need to be asleep now. |
| 23:36 | | Thaqui [Thaqui@27B34E.D54D49.F53FA1.6A113C] has joined #code |
| --- Log closed Wed Jun 02 00:00:21 2010 |