00:00:13 !bfjoust simpletest (>[-][-][-][-][-])*29 00:00:15 Score for nescience_simpletest: 28.5 00:00:16 better profile to make sure you need it 00:00:34 ha, somewhere in that mess playing the odds got knocked off 00:00:43 guess it eventually had enough entries that got new rolls 00:00:43 :P 00:00:49 nescience: the defend6 and up programs beat that by locking them in a [-] loop while grabbing the flags 00:01:12 shouldn't happ... oh, right 00:01:21 i was considering the same thing, but i thought i had time once you "left" 00:01:33 ais523, so it does something like [>----<+] ? 00:01:38 didn't put two and two together 00:01:46 to keep incrementing it 00:01:48 ugh, my main loop is getting ugly 00:02:00 AnMaster: a bit like that 00:02:05 ehird, it is C. What do you expect? 00:02:10 true. 00:02:11 it does +*128 every 256 steos 00:02:11 still, really ugly. 00:02:12 i assume that they don't leave more than ~250 cycles between when they leave their flag, but really it's a timing thing 00:02:13 *steps 00:02:14 eh, I can refactor it later 00:02:19 important thing is that it works, and works fast 00:02:23 to cancel out [-] (directly) or [+] (by shunting it past 0 too fast) 00:02:39 in some cases code duplication DOES speed up however 00:02:47 but profile before you do it 00:02:47 for (current_warrior = WARRIOR_A; current_warrior <= WARRIOR_B; current_warrior++) { 00:02:52 right, but still if it doesn't rest on 0 the first time it should come around to it again i thought 00:02:58 seemed like there would be time for it 00:03:12 in cfunge the code for "is vector cardinal" had to be duplicated from vector.c into funge-space.c 00:03:24 !bfjoust simpletest (>[[++++++++]])*29 00:03:26 Score for nescience_simpletest: 28.5 00:03:27 it was too slow otherwise 00:03:31 AnMaster: why not let the compiler do unrolling? 00:03:45 ais523, um. It didn't handle inlining between files well 00:04:04 ais523, and doing a "combine + whole program optimise" is non-trivial 00:04:09 it can be done of course 00:04:20 but not using cmake 00:04:36 so you end up with a manual batch file 00:07:13 !bfjoust wot (>)*1 00:07:40 nooga: what a pointless program... 00:07:46 dammit 00:07:49 just as i refreshed 00:07:49 !underload (test)S 00:07:50 test 00:07:50 * nescience sighs 00:07:50 it doesn't even kill itself 00:08:04 tried to figure out how it works 00:08:08 how what works? 00:08:11 bf joust? 00:08:15 AnMaster: Pass all of the files to GCC at the same time. 00:08:19 that new toy - bfjoust 00:08:21 pikhq, I know 00:08:28 pikhq, gcc -combine -fwhole-program 00:08:29 why don't you go read about it then? :) 00:08:34 With bfjoust slox'd, it takes for freaking ever :P 00:08:35 Right. 00:08:42 Patashu: like where? 00:08:44 pikhq, doesn't help for the cmake build system 00:08:46 as I said 00:08:56 Damned Cmake. 00:09:04 http://esoteric.voxelperfect.net/wiki/BF_Joust 00:09:13 and http://retrocode.blogspot.com/2009/05/bf-joust-king-of-hill.html 00:09:15 pikhq, not really 00:09:20 pikhq, it is better than autotools 00:09:31 and a nice build system in general 00:09:35 not perfect, I agree 00:13:38 /usr/bin/perl ../bfjoust ais523_defend8.bfjoust nescience_simpletest.bfjoust has been running for EVER 00:14:37 GregorR, did you see what I said about properly slox-limiting it? 00:14:37 a clash of the titans 00:14:42 !bf_txtgen test 00:14:47 !bfjoust wot [>+] 00:14:50 61 ++++++++++[>++++++++++>++++++++++++>+><<<<-]>>----.<+.>-.+.>. [291] 00:14:55 00:14 AnMaster: GregorR, did you see what I said about properly slox-limiting it? 00:14:57 he did that. 00:14:57 !befunge98 'A,a,@ 00:15:01 that is why it is slow. 00:15:01 Hmm. 00:15:01 that's not going to do what you think it does, nooga 00:15:03 hm 00:15:05 son of a 00:15:06 again 00:15:14 i just want to see what happened >:( 00:15:15 i don't get it 00:15:19 Earlier, I viewer the generated assembly for a program compiled with -Os. 00:15:20 ehird, yes. luckily 00:15:22 ehird, but 00:15:26 and now it's off, so i can't 00:15:26 the issue is 00:15:27 * nescience sighs 00:15:28 Please WAIT for the run to finish before adding new warriors :P 00:15:30 nooga 00:15:30 Among other things, it had "xor %eax, %eax". 00:15:32 when it reaches the flag 00:15:36 it will step forward and fall off the edge 00:15:38 GregorR, other interpreters are broken, special commands are not 00:15:39 :( 00:15:40 GregorR, why 00:15:42 :), rather. 00:15:53 $ time ../bfjoust ais523_defend8.bfjoust nescience_simpletest.bfjoust 00:15:54 real 1m8.360s 00:15:55 how about backups of report.txt 00:15:56 ^^^ That's why 00:15:57 like the last 10 00:16:15 let's hope ehird finishes his new, faster, interpreter soon 00:16:21 GregorR, So why do other special commands work still 00:16:22 PLZ CAN HAS 00:16:26 harder better faster interpretier 00:16:31 the current interp I've written works very badly on programs like defend8 00:16:41 AnMaster: BECAUSE I slox'd it. 00:16:44 !echo hi 00:16:52 And yet that still doesn't work :P 00:17:02 00:16 ais523: let's hope ehird finishes his new, faster, interpreter soon ← yes, I'm working on it 00:17:08 it'll probably be done tomorrow 00:17:08 GregorR, so why doesn't THAT work then... 00:17:12 I have no idea. 00:17:22 GregorR, or is bf_txtgen not sloxed? 00:17:28 GregorR-L: can you have it, instead of replacing report.txt, keep the last X versions? 00:17:36 dfhioasfhoidashfupdhafoihaewiospfhdiosahfiud;sfhio 00:17:40 STOP EVERYBODY TALKING AT ME 00:17:40 i hate to keep submitting this when i only want to see the results once 00:18:01 nescience, so wait for your turn 00:18:04 i did 00:18:07 three times(?) now 00:18:10 * GregorR-L breathes. 00:18:19 except i can't sit here f5ing constantly to catch it and people keep submitting 00:18:21 nescience, don't resubmit it 00:18:23 so i've missed the results each time 00:18:35 the problem is, the better BF Joust gets, the more people want GregorR to do to improve it... 00:18:38 nescience, wait for the score in channel 00:18:39 Currently the CPU is barely in use, so I don't know why other things aren't running. 00:18:47 AnMaster: the score-in-channel is broken 00:18:53 GregorR, maybe restart it then 00:18:55 and doesn't tell me how it did against individual programs 00:19:03 nescience, SUBMIT A PATCH! 00:19:20 we are all waiting 00:19:23 AnMaster: at the rate this is going, a backup or three would be a simple, effective, solution 00:19:31 nescience, make a patch that does it 00:19:33 and i'd need the code to submit a patch eh? 00:19:35 we are waiting 00:19:38 !info 00:19:39 EgoBot is a bot for running programs in esoteric programming languages. If you'd like to add support for your language to EgoBot, check out the source via mercurial at https://codu.org/projects/egobot/hg/ 00:19:45 lol 00:19:47 there it is 00:19:59 nescience, now we are waiting for the patch 00:20:31 * GregorR-L is so glad when people defend him for a tick :P 00:20:58 AnMaster: shut the hell up for a change, eh? 00:21:04 GregorR-L, at your service :) 00:21:14 i was attempting to at least be polite to GregorR-L 00:21:46 nescience, to me that looked more like "buggering" 00:21:54 by asking a simple question? 00:22:00 nescience, repeatedly 00:22:02 no, you were the one being obnoxious 00:22:07 and i did not ask it repeatedly 00:22:12 PRIVMSG/tr_21.cmd: fork: Resource temporarily unavailable <-- well here's the problem 00:22:17 00:20 nescience: AnMaster: shut the hell up for a change, eh? ← don't bother 00:22:26 i've tried for over a year. 00:22:30 lol. 00:22:55 !echo 'ello there gents 00:22:56 'ello there gents 00:23:05 * GregorR-L up'd the limit from 32 procs to 1024 :P 00:23:05 how about backups of report.txt GregorR-L: can you have it, instead of replacing report.txt, keep the last X versions? <-- Last two cases. 00:23:14 oo 00:23:19 !c printf("ô_ô\n"); 00:23:20 ô_ô 00:23:31 GregorR, interesting 00:23:35 which were, in fact, related 00:23:37 GregorR, it proably needs to be restarted then 00:23:41 thus the same question 00:23:41 not sure 00:23:47 so is that mega bfjoust match stalled or chugging along? 00:23:47 i simply realized who to address it to 00:23:53 is there a way to test if it's making progress? 00:23:59 so.. yeah, whatever floats your boat i guess 00:24:00 GregorR, that is, if you did it in /etc/security/limits 00:24:01 It's chugging along. 00:24:06 aight 00:24:15 It's still running, but it's taking 4 minutes per run of defend8 X_X 00:24:43 ✞✞ 00:25:05 would defend8 run faster if you forcefully unrolled all the *s? 00:25:11 ›¿¡‽‹———…——— 00:25:12 slower 00:25:20 Score for nooga_wot: 10.8 00:25:20 Score for nooga_wot: 10.8 00:25:25 WOT? 00:25:40 hang on how'd it beat someone 00:25:41 lol 00:25:54 11 minutes? 00:25:58 wow 00:26:00 simpletest is 2nd place 00:26:00 lol 00:26:01 Ha, it beat ehird_defend6_a_parody_or_just_plain_ripoff_question_mark.bfjoust :P 00:26:03 it beat...defend6 a parody 00:26:04 what lol 00:26:15 is it safe to submit now? 00:26:18 but it didn't beat any of the defends 00:26:36 what's nooga_wot's source? 00:26:47 [>+] 00:26:47 oh, [>+] 00:26:48 lol 00:26:49 haha 00:26:58 hehe :> 00:27:03 haha, I just figured out how 00:27:05 !bfjoust wat [->] 00:27:09 AN ARROW TO THE FUTURE 00:27:20 a nice case of perfect timing 00:27:54 NEED FASTER INTERPRETER 00:27:57 defend8 so slow :( 00:28:02 defend eiiiiight 00:28:08 I curse the ground you stand apon 00:28:21 !bfjoust wat [->] <-- won't that just nop very very early on 00:28:28 second cell 00:28:31 hm 00:28:32 correct. 00:28:33 wait no 00:28:34 lol 00:28:35 GregorR-L: yeah, yeah, I'm on it 00:28:39 just remove defend8 00:28:41 so we can get on with things 00:28:48 lol 00:28:50 ehird, just finish that interpreter :P 00:28:59 or 00:29:02 removing defend8: 3 seconds 00:29:06 pre-expand defend8 00:29:12 finishing interpreter, writing new hill infrastructure, ...: 95893458345 years 00:29:13 AnMaster: no 00:29:15 that slowsi t down 00:29:18 abbreviations speed up the interpreter 00:29:22 if you see (+)*1024 00:29:26 you can optimize it 00:29:29 where is score chart? 00:29:34 ehird: If the new interpreter just exits with 1 or 2, the new hill infrastructure is one line of change. 00:29:39 nooga: http://codu.org/eso/bfjoust/report.txt 00:29:41 empty while calculating 00:29:52 uh 00:29:54 GregorR-L: it's much much more nuanced than that, and I want to make a new scoring mechanism 00:29:55 and shit 00:29:57 (Yes, that's on my list, I'm fixing backslashes now) 00:30:29 -!- Halph has joined. 00:30:39 -!- coppro has quit (Read error: 54 (Connection reset by peer)). 00:30:48 -!- Halph has changed nick to coppro. 00:31:11 !bf_txtgen \ 00:31:17 37 ++++++++++[>+++++++++>+>><<<<-]>++.>. [37] 00:31:19 !befunge 'A,@ 00:31:20 wonder if there's something like java golf 00:31:20 Unsupported instruction ''' (0x27) (maybe not Befunge-93?) 00:31:21 :D 00:31:26 !befunge98 'A,@ 00:31:26 A 00:31:44 I've codegolfed in java 00:31:47 if that's what you mean 00:31:47 !befunge98 'A,,'B,@ 00:31:48 A 00:31:50 hm 00:31:59 !befunge98 'A,,a,'B,@ 00:31:59 A 00:33:01 Patashu: codegolfing in java is like trying to hide a truck in a matchbox, probably 00:33:13 nah 00:33:16 it's possible 00:33:17 you have to consider it relatively 00:33:18 for example 00:33:22 you're not going to be smaller than most languages 00:33:26 but you can be small relative to java programs 00:33:36 I beat primo's java program with my own once :) 00:33:38 enum H{{System.out.println("Hello, world!");System.exit(0);}} 00:33:50 enum is shorter than class, and using a static declaration + exit to avoid the no main error 00:33:57 is shorter than declaring a main method 00:33:59 !echo Hello\ AnMaster 00:34:00 Hello\ AnMaster 00:34:08 ehird: that is so wrong 00:34:10 hm 00:34:13 ais523: it so works :) 00:34:16 !slashes \a 00:34:17 a 00:34:17 it works 00:34:17 lol 00:34:19 !slashes \\a 00:34:19 \a 00:34:26 ehird: would that run at compile-time? 00:34:28 or at runtime? 00:34:30 ais523: runtime 00:34:30 ehird: i'd put System.do.me.a.favor.and.die() instead od System.exit(0); 00:34:30 ehird: That's impressive, actually. 00:34:33 !slashes /foo/b\\ar/foo 00:34:33 bar 00:34:35 of* 00:34:37 !slashes /foo/b\\\\ar/foo 00:34:37 b\ar 00:34:38 enum H{{System.out.println("Hello, world!");System.exit(0);}} ← 62 chars 00:34:41 class H{public static void main(String[] args){System.out.println("Hello, world!");}} ← 86 chars 00:34:41 right 00:34:41 Score for ehird_wat: 7.0 00:34:43 no contest 00:34:53 don't forget you can rename String[] args to String[]_ or similar 00:34:59 that saves four characters 00:35:02 class H{public static void main(String[]_){System.out.println("Hello, world!");}} 00:35:02 82 00:35:03 hey 00:35:03 no contest 00:35:07 where is nooga_wot ? 00:35:12 nooga: it was too bad 00:35:14 so it got killed 00:35:18 keeel 00:35:22 10.80 > 7.0 00:35:23 okay so is defend8 being removed? 00:35:29 I want to submit stuff on a good conscience 00:35:30 nooga: it died before that 00:35:34 unfair! 00:35:35 ehird, is this C# !? 00:35:37 I don't mind defend8 being removed 00:35:38 :C 00:35:39 java 00:35:41 AnMaster: Java. 00:35:43 ah 00:35:45 especially as it seems not to work the way I wanted it to 00:35:45 it looks verbose enough huh ;) 00:35:50 it seems very similar to C# 00:36:01 what 00:36:10 c# is basically java w/ less crap and som nice stuff 00:36:11 some 00:36:22 and some bad stuff 00:36:28 ehm 00:36:28 And less portability. 00:36:29 well 00:36:33 yay! 00:36:33 that isn't C# itself 00:36:33 i can't think of any bad stuff it adds to java 00:36:35 rather .NET 00:36:37 pikhq: Er, Mono. 00:36:44 true, .NET has some bad points 00:36:47 !slashes http://oerjan.nvg.org/esoteric/slashes/quine.sss 00:36:56 but C# as a language is OK, and .NET isn't unportable 00:36:58 "It runs on Windows XP *and* Vista! ... Oh, and Mono, if you want it to." 00:37:00 erm 00:37:00 oh god 00:37:06 pikhq: Mono runs on everything. 00:37:07 ehird: it doesn't port to Mac 00:37:11 IIRC 00:37:13 GregorR-L: ^ that's still not working 00:37:14 I thought Mono was Linux only 00:37:15 ais523: Mono runs on OS X 00:37:17 ehird, it is unportable. Unless you keep being developing on mono 00:37:17 And windows 00:37:18 And linux 00:37:19 and BSD 00:37:23 then it will run on .NET too 00:37:26 AnMaster: Mono is mostly compatible with .NET's base library. 00:37:29 ehird: .NET isn't unportable. However, a lot of .NET code makes Win32 API calls. 00:37:34 A *lot*. 00:37:37 GUI stuff, not as much. But base library, ... 00:37:41 ehird, with .NET 1.1 + some of 2.0 yes 00:37:43 oerjan: In what way is it failing? I don't see any output. 00:37:50 AnMaster: .NET 3.0 = .NET 2.0 00:37:59 ehird, what about 3.5 00:38:02 ehird, and wrong 00:38:09 AnMaster: It is not wrong. The framework itself is identical. 00:38:17 ehird, that "in language expression" thing 00:38:18 for example 00:38:24 AnMaster: It is not a major release. 00:38:26 Mono will run on everything, but that doesn't make .NEt a good idea 00:38:27 forgot the name for it 00:38:29 It is a minor new release 00:38:37 coppro: it's just as good as an idea as the JVM... 00:38:38 GregorR-L: it's a 1496 character quine 00:38:50 one line, but i assume it should be cut off... 00:38:53 JavaOS FTW 00:39:11 !slashes http://oerjan.nvg.org/esoteric/slashes/counter3.sss 00:39:12 /\/\/\/\\\\/\\\\\\\/\\\\\\\/\\\\\\\/\\\\\\\\\\\\\\\\\\\\\\//\/\/\/\\\/\/\\////\\////\\\///\\////\\\///\\////\\\///\\////\\\///\\\///\\\///\\\///\\////\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\////\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\////\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\////\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\\///\\////\\////\\\///\\////\\\// 00:39:15 at least JVM is open source 00:39:25 !slashes this is a quine. 00:39:25 this is a quine. 00:39:28 oerjan, ^ 00:39:29 ;P 00:39:32 huh now it arrived just with the second character 00:39:35 JavaOS! 00:39:41 AnMaster: i know, without /\ it's trivial 00:39:46 00:39 coppro: at least JVM is open source 00:39:48 Ding! Wrong. 00:39:49 oerjan, yeah 00:39:52 OpenJDK 7, yes. 00:39:53 _with_ /\ it's as hard as any other language 00:39:55 But not 1.5 or 1.6. 00:39:56 ehird: Yes it is. 00:40:01 Yes, there is an OpenJDK backport for 1.6. 00:40:03 oerjan, yep 00:40:03 OpenJDK 6, too. 00:40:04 harder 00:40:07 But it isn't totally 1.6 compatible. 00:40:12 That is, it's hard to use it as a 1.6. 00:40:13 with _just_ /\, a bit worse :D 00:40:15 ehird: yeah, but at least they're tryping 00:40:17 Yes it is. 00:40:21 It passes 1.6 compliance tests. 00:40:29 pikhq: which means jack shit in the real world. 00:40:42 coppro: .NET isn't a canonical implementation, anyway 00:40:46 .NET is a CLI implementation 00:40:47 so's Mono 00:40:49 Java's compliance tests are thorough. 00:40:50 if you're sane pick the latter 00:40:55 GregorR-L: seems it was just slow, unless it somehow waited for the second command 00:41:02 http://en.wikipedia.org/wiki/JavaOS << beautiful, but sloooooooooooooooooooooooooooooooooooo 00:41:06 oerjan, proved it TC yet? 00:41:07 oooooooooooooooooooooooooooooooooooooooooooooooo 00:41:13 oooooooooooooooooooooooooooooooooooooooooooooooooooow 00:41:13 nooga: stop being a retard 00:41:14 AnMaster: yes, oerjan has 00:41:14 java is fast 00:41:17 by implementing BCT 00:41:19 ehird: no 00:41:20 it just has a long startup time 00:41:28 ais523, I missed where he proved it 00:41:30 nooga: java _is_ fast. 00:41:32 Not so much barebones feature tests as they are comprehensive unit tests, covering the entire JDK. 00:41:34 only saw him working on it 00:41:42 ehird: few people are sane enough to know, mainly because they go "but... WPF" 00:41:42 ehird: but not JavaOS 00:41:44 http://codu.org/eso/bfjoust/in_egobot/reports/ 00:41:58 Gee, that didn't quite work :P 00:42:01 nooga: have you tried it? I haven't so I don't konw. 00:42:02 * GregorR-L fixy 00:42:04 GregorR-L: not very impressive atm 00:42:06 *know 00:42:20 AnMaster: http://oerjan.nvg.org/esoteric/slashes/bct.sss 00:42:28 but that's far too slow for EgoBot 00:42:57 ehird: repeating a comment I made earlier while I wasn't here: have you seen the Enigma trailer? 00:42:58 ehird: prove it 00:43:02 AnMaster: also, http://oerjan.nvg.org/esoteric/slashes/BCT.hs for the generator of the monstrosity 00:43:06 it's so bad it's hilarious 00:43:07 oerjan, how do you do a non-trivial infinite loop in it then 00:43:08 nooga: i asked a question, dick 00:43:11 ais523: nope 00:43:26 ais523, for the engima *game*? 00:43:29 ehird: http://download.berlios.de/enigma-game/EnigmaTrailer1.flv 00:43:30 AnMaster: yes 00:43:35 ehird: of course not, it would boot for 9000 years 00:43:39 ais523: .flv? Can I have the flash player version? 00:43:43 ehird: there isn't one 00:43:47 ais523: ... 00:43:49 they just gave a link to the flv 00:43:51 An .flv without a flash player? 00:43:52 ehird: Mplayer. 00:43:53 LOL VAT 00:43:53 yes 00:43:54 i don't have so much time to wait 00:43:57 I played it with ffmpeg 00:44:00 ais523, trailer? Is this Lara Croft on Bio with s/Lara Croft/The black ball/ 00:44:04 pikhq: yeah sure, requires opening a terminal etc 00:44:05 OK, NOW http://codu.org/eso/bfjoust/in_egobot/reports/ :P 00:44:09 AnMaster: just look at it, it defies explanation 00:44:12 Or VLC or ffmpeg or Xine. 00:44:13 well, I could explain it 00:44:17 but it's funnier to see it yourself 00:44:32 AnMaster: you self-replicate the program with a quoting scheme. See http://oerjan.nvg.org/esoteric/slashes/counter3.sss for the sanest version 00:45:00 ais523: Cannot find codec matching selected -vo and video format 0x6. 00:45:03 can't watch it 00:45:10 Works in VLC. 00:45:10 AnMaster: what are you trying to watch it with? 00:45:12 -!- olsner has quit ("Leaving"). 00:45:15 Any further requests while I'm poking at EgoBot? Going once, going twice? 00:45:16 ais523, mplayer 00:45:20 ais523: enigma is a puzzle game! 00:45:23 try ffmpeg 00:45:24 with fuzzy graphics. 00:45:29 GregorR-L: Write EgoBot in Plof. 00:45:32 :p 00:45:33 ehird: there's encoding fail near the start 00:45:34 ehird, not fuzzy graphics? 00:45:36 although it improves later 00:45:45 OR MEDITATE IN THE HOLES 00:46:01 meditation levels are the opposite of meditation 00:46:07 File 'EnigmaTrailer1.flv' already exists. Overwrite ? [y/N] 00:46:08 err 00:46:11 more like aggravation 00:46:13 how does one use ffmpeg 00:46:14 :/ 00:46:21 AnMaster: by converting it to another format 00:46:26 that you can play 00:46:26 right 00:46:35 AnMaster: or just use ffplay 00:46:36 ehird: java.is.slow.and.verbose() 00:46:42 which comes with it 00:46:44 ffmpeg -i output.myfavoriteformat 00:46:46 nooga: you're an idiot. java sucks as a language, but it is fast 00:46:46 ah! 00:46:53 AnMaster: ffplay? 00:46:55 ehird: C is fast 00:47:07 nooga: why do I even bother talking to you? you're more of an idiot than AnMaster 00:47:10 afk 00:47:18 ais523: this is the most boring tailer evar 00:47:20 *trailer 00:47:22 ehird: yes 00:47:24 ehird: you're asking me? 00:47:35 nooga: you have experience in the matter 00:47:37 I told you it was bad 00:47:38 !bfjoust lazy >+>->++>-->--->+++>>>((-.)*512>)*21 00:47:39 Score for Patashu_lazy: 11.8 00:47:40 USE THE ITEMS 00:47:42 :D 00:47:48 DON'T EAT THEM OR HAVE INTERCOURSE WITH THEM 00:47:49 USE THEM! 00:47:53 Keep breathing! 00:47:58 Eat and drink food and water! 00:48:00 -!- GregorR-L has set topic: #esoteric: Where the crowd is always friendly, so long as you don't talk to them. | http://tunes.org/~nef/logs/esoteric/?C=N;O=D. 00:48:19 -!- ehird has set topic: #esoteric: Where ehird is always friendly, so long as you don't talk to him. | http://tunes.org/~nef/logs/esoteric/?C=N;O=D. 00:48:35 * ais523 thinks "enigma includes different floors" is one of the better captions 00:48:44 !bfjoust rushpolarity >(+)*10>(-)*10>-->++(>)*5((+)*8[+[-]]+.--.++>(-)*8[-[+]]+.--.++>)*11 00:48:45 Score for Patashu_rushpolarity: 23.6 00:48:49 !bfjoust matador >-[]<(++-)*1000.(--+)*1000(>)*9(>[+][-])*21 00:48:51 Score for Patashu_matador: 27.0 00:49:19 ais523: Watch me play chess for ages! 00:49:41 yes, and it isn't even chess 00:49:45 yep 00:50:06 OK, fixed a bug: Now it won't show an old score for an old program :P 00:50:14 ais523: have I watched this for 4 minutes already? 00:50:21 probably 00:50:24 addictive, isn't it? 00:50:32 my brain is leaking out from my ears 00:50:38 and underneath my eyes 00:50:53 I don't know how anyone could have thought it was a good idea 00:50:58 I wonder if it would persuade people to download the game? 00:51:05 i'll have to watch it tomorrow when i'm more awake so I find it even funnier 00:51:26 " have you seen the death stones ... " 00:51:35 yeah that was awful 00:53:08 "enigma includes laser games ... " 00:53:27 wo 00:53:34 enigma ftw 00:53:41 nooga: it's a good game 00:53:45 sure 00:53:52 and 6 of my levels are in the next version 00:53:53 what page do I go to to view the report now? 00:53:54 terrible advertising, though 00:53:57 ais523: oh, you got them in? 00:53:59 i remember oxyd magnum under dos 00:53:59 http://codu.org/eso/bfjoust/report.txt no longer updates 00:54:02 ehird: yes 00:54:05 not all, but some 00:55:22 " this is a temple full of gold ! " 00:55:26 yeah 00:55:31 enigma runs on OS X 00:55:37 enigma runs on lots of things 00:55:38 ultimate win 00:55:46 they were discussing my sudoku level with me 00:56:02 we need to make it more efficient, in order to work on low-end processors like ARM 00:56:11 haha 00:56:29 sudoku on a microprocessor? 00:56:30 ais523: ARM can run full Ubuntu, you know 00:56:35 I know 00:56:38 not minimal embedded ARM, though 00:56:49 ais523, that trailer... 00:56:51 but I was trying to do something inefficient every 100ms 00:56:52 how strange 00:57:03 we're talking about how to optimise that bit of the code 00:57:06 *10ms 00:57:43 I love the way they add a teaser for the next version ("Rhythm of Space" isn't in Enigma 1.01) 00:58:08 ais523: 1.01? is that old or new 00:58:09 I forget 00:58:10 ais523, I assume it is in svn then 00:58:12 1.01's current 00:58:16 1.10 is the svn version 00:58:21 AnMaster: yep, it is 01:01:02 -!- Patashu has quit ("Patashu/SteampunkX - MSN = Patashu@hotmail.com , AIM = Patashu0 , YIM = Patashu2 , Googletalk = Patashu0@gmail.com ."). 01:03:03 -!- inurinternet has quit (No route to host). 01:08:42 -!- lament has joined. 01:09:04 HAR 01:10:28 what's this "Enigma"? 01:10:57 awesome game 01:11:08 coppro: the second-best open-source game for Linux 01:11:11 after Battle for Wesnoth 01:11:15 it runs on everything else too 01:11:18 http://enigma-game.org 01:11:19 noooo 01:11:27 BfW is boring 01:11:30 ais523, third best 01:11:36 AnMaster: oh? 01:11:41 1) nethack 2) BfW 3) Engima 01:11:45 hmm... let's see if it gives DROD a run for it's money 01:11:53 ah, I didn't count nethack for some reason 01:12:02 ais523, oh? 01:12:08 probably because it's console-based 01:12:15 add GUI to my statement above 01:12:26 ais523, I also think simutrans is better. Which has a GUI 01:12:34 but it was originally for windows iirc 01:12:41 only later was ported to linux 01:12:46 so was DROD 01:12:48 well, NetHack was originally for UNIX 01:12:48 so it doesn't qualify 01:12:52 ais523, true 01:12:56 coppro: download Enigma, anyway, it's a great game 01:13:03 yeah, downloading it 01:13:27 it easily gets boring though 01:13:32 what, Enigma? 01:13:34 drod = www.caravelgames.com btw 01:13:36 yeah 01:13:43 oh I remember, you hate all the levels except the boring ones 01:13:47 which you find interesting 01:13:58 AnMaster: You neglected to mention anything by iD. 01:14:06 i want to make some eso coding based puzzle game 01:14:13 pikhq, Um, isn't the graphics still closed source there iirc 01:14:24 you know: arrange some weird runes to make something work 01:14:27 or maybe I mixed something up 01:14:34 The .wads aren't free. 01:14:43 nooga: there's a Brainfuck-based programs in Enigma 01:14:43 ON IPHONE! 01:14:49 pikhq, and I have great respect for the fast inverse square root 01:14:51 *puzzle 01:14:52 ais523: show? :D 01:14:55 Well, Doom has shareware .wads. 01:14:58 pikhq, is that the name then? 01:14:58 nooga: "print 23", search for it 01:15:03 ok 01:15:06 well that explains it 01:15:07 but it's the exception, not the rule 01:15:17 How does Enigma work? 01:15:18 pikhq, I don't consider it free and open without free and open data 01:15:27 I've got the basics down 01:15:28 coppro: basically, it's a generic puzzle game 01:15:30 you control a marble 01:15:33 ais523: erm 01:15:35 Fine. You're a bit more hardcore than Stallman, but anyways. 01:15:37 yeah, try to match the boxes 01:15:39 quite common phrase 01:15:42 but what are the scrolls for, etc. 01:15:42 and what you have to accomplish in a level varies a lot 01:15:43 Total conversions of those games, then? 01:15:44 pikhq, sure source may be, but it isn't very useful to the end user 01:15:47 coppro: left-click 01:15:49 they're document 01:15:51 *documents 01:15:51 pikhq, who doesn't own said data 01:15:53 that explain what to do 01:16:02 pikhq, and I never had doom or quake 01:16:17 they go into your inventory when you run over them; left-click to use the item you most recently picked up, mousewheel or right-click to change which item you use 01:16:31 AnMaster: Emerge it; I'm sure it's in Portage. 01:16:37 pikhq, the data files too? 01:16:52 Those are gratis, not libre, but yeah. 01:17:01 No-go 01:17:07 OpenTTD is also awesome 01:17:12 Congrats. 01:17:21 nooga, it sucks compared to simutrans 01:17:30 pikhq: you know how with libre files you can theoretically read the source, before running it? Well, AnMaster actually does 01:17:30 You are more 'free and open'-ish than Stallman. 01:17:35 nooga, like no stations underground. Or tunnels with bends in 01:17:45 ais523, I often do yes 01:17:47 ais523: That... Is very scary. 01:18:05 AnMaster: BTW, have you ever checked out Second Life? 01:18:06 >:D 01:18:06 ais523, I don't read the full source of every new glibc or kernel 01:18:12 pikhq, no I haven't 01:18:21 pikhq, doesn't work in offline mode 01:18:24 Its source is a very... Interesting read. 01:18:24 AnMaster: but ottd has quite clean signaling rules 01:18:26 and I never play multiplayer 01:18:27 ever 01:18:42 I just hate multiplayer 01:18:55 AnMaster: what do you never play multiplayer? 01:18:57 AnMaster: is it that because you always loose? :D 01:18:58 nooga, um? 01:19:04 Oh, fine. By "interesting", I mean that it is Pandora's Box in code form. 01:19:07 nooga, doesn't simutrans too? 01:19:18 AnMaster: i'll give it a try 01:19:25 ais523, I'm both a bad winner and a bad looser 01:19:29 I think it has half of the STL reimplemented poorly. 01:19:43 pikhq, which game? 01:19:51 Second Life. 01:19:53 ah 01:19:55 ais523: Is (a{}b{}c)%5 allowed? And is (a)*5 the same as (a)%5 ? 01:20:24 And its developers are enamoured with XML. 01:20:41 pikhq, I'm so not ever going to look at that 01:20:42 I think if someone invented a low-level XML language, they would use it. 01:20:46 *shudder* 01:21:03 step 1: grab the C++ standard 01:21:13 AnMaster: Consider that a goatse-esque thing. 01:21:14 step 2: make every token an XML element 01:21:17 step 3: enjoy 01:21:17 pikhq, 01:21:18 and 01:21:24 that solves Intel vs AT&T 01:21:26 THEY WOULD DO IT 01:21:30 since you can put them in either order 01:21:36 GregorR-L: for the first question, no, you can only have one {} in a (); for the second question, no, you need {} in a ()% block, so you'd have to write (a{})%5 to do the same as (a)*5 01:21:40 or 01:21:44 THE CHOICE IS YOURS! 01:21:49 ais523: Ah, got it. 01:22:19 or even: 01:22:29 01:22:31 :D 01:22:43 01:22:58 pikhq, invalid. Those attributes are required 01:23:13 however... all labels must have an end 01:23:15 like: 01:23:38 Inline comments for the lulz? 01:23:38 01:24:05 AnMaster: Not valid XML. 01:24:11 pikhq, no? 01:24:12 The label tag was already closed. 01:24:22 pikhq, typo 01:24:29 I didn't mean to close it 01:24:33 Also dumb. 01:24:38 Labels don't nest in assembly. 01:24:41 pikhq, that was part of the point 01:24:53 Ah. 01:25:08 pikhq, and no they aren't allowed to nest 01:25:20 with one exception 01:25:30 one level of local can nest in non-local 01:25:48 -!- inurinternet has joined. 01:25:55 I... And... I HATE YOU 01:26:14 BAD XML SCHEMA WRITER, BAD! 01:26:26
01:26:38 lmao 01:26:54 what do the mini black balls do? 01:27:01 coppro: extra lives 01:27:07 01:27:11 does that become relevant later? 01:27:13 I KEEL YOU 01:27:17 not sure that cdata is correct 01:27:22
01:27:24 if you have one in your inventory and die, and the level allows resurrection, you end up being resurrected at the start of the level rather than having to restart 01:27:29 and yes, I imagine you'll mess up later 01:27:37 and fall into water or hit a death stone or something 01:27:42 some levels are very lethal 01:28:03 pikhq, did I get the CDATA signature right? 01:28:35 I DUNNO, I KEEL YOU 01:28:45 http://www.youtube.com/watch?v=eB2nkRG2kMI here 01:28:48 pikhq, you kneel before me? 01:28:49 huh 01:28:52 that's nice! 01:28:58 this is what i am after 20 hours of work 01:29:19 YES. SURE. I DON'T CARE, BURN WITH THE HEAT OF A THOUSAND SUNS! 01:29:38 * pikhq kneels with a nuke strapped to his back. Hits the Big Red Button™. 01:29:42 pikhq, also I think this would of course be much better in S-Expressions 01:30:05 now night 01:31:43 wait 01:31:49 I just have to ask first 01:32:00 pikhq, why did you have a duke strapped on your back 01:32:06 and what did the duke think about it 01:33:18 night 01:33:59 It was the Duke of Nukem, actually. 01:47:46 -!- psygnisfive has joined. 01:54:42 If both programs + at the same time in the same cell, does 2 get added? It's confusing because they both look at the "in" value... 01:55:13 it should add 2 01:55:15 i assume 2 should be added 01:55:17 if it doesn't, that's a bug 01:55:26 OK, that makes sense, but the "spec" didn't make it clear :P 01:57:00 ais523: what do the silver/gold medals and feathers on the level selection screen mean? 01:57:30 coppro: feather = unsolved easy level, silver = solved easy level, gold = hard level 01:57:38 you can click on the feather button to switch between easy and hard mode 01:58:32 ah 01:58:48 enjoying it, btw? 01:58:53 And what happens when a program terminates? Just loops? 01:59:08 yes, though for pure puzzleness DROD still triumphs 02:01:17 is it just me or are the blocks not randomized in hard mode? 02:01:31 GregorR-L: infinite nops 02:01:34 coppro: on which level? 02:01:41 on most levels, the oxyds are random 02:01:42 ais523: OK, thanks. 02:01:43 on some, they aren't 02:01:46 oh 02:01:47 ok 02:04:17 also is it just me, or is par not par? 02:04:36 coppro: it's an average score for good players 02:04:46 I must really suck then 02:04:48 although, if you only just got it, you may not have up-to-date records 02:04:57 and most pars are rather hard to get 02:05:00 because lots of these I can only hit par if I get real lucky on the draw 02:05:03 because many of the good players are realy good 02:05:18 also, people going for par keep repeating levels until they get a good time 02:05:19 so guys 02:05:27 i now own a NeXTstation Turbo 02:08:07 omg 02:08:12 someone mentioned enigma? 02:08:14 i love you 02:08:28 nescience: I've written levels for Enigma 02:08:34 oxyd is probably my favorite puzzle series of all time 02:08:34 although they're in the next version, not the current one 02:08:54 though it's a close tie between oxyd, chip's challenge, and crystalex 02:09:03 i haven't tried the user-generated levels in enigma actually 02:09:10 i had mixed results the first time i did 02:09:24 good level design can be an iffy skill :P 02:09:28 Bleh, even with a C impl defend8 is sloooooooow 02:12:55 I guess that's because the expanded version is many megs long >_> 02:13:22 really? I thought it was slightly less than 1MB 02:13:49 My counter trying to sub-parse is at 3M 02:14:26 D: 02:14:29 it wont boot from disk :( 02:14:33 i would assume expanding is a bad idea if you don't really have to... 02:14:53 and the abbreviations are designed so you don't need it, arent't they 02:15:07 I suppose, but it's a huge PITA in C >_> 02:15:25 esp. since they can contain ['s 02:15:25 *-t 02:15:32 -!- nooga has quit (Read error: 110 (Connection timed out)). 02:15:34 but only matched ones 02:15:47 question, i still don't understand ({})... does (a{b}c)* expand to aabcc? 02:16:01 nescience: (a{b}c)%2 expands to aabcc 02:16:15 the difference to (a)*2b(c)*2 is that a and c can contain the matching halves of brackets 02:16:23 yeah, i did forget the % and 2, whoops 02:16:44 matching halves of [] brackets you mean 02:16:50 yes 02:16:57 i don't see why that's not possible with () 02:16:58 generally speaking, [] = bracket, () = paren 02:17:02 unless you do syntax checking 02:17:04 nescience: and because you aren't allowed to do it with () 02:17:12 because trying to partially expand would then be a pain 02:17:16 yeah, but i don't always know that the person i'm talking to is also a stickler for syntax names :) 02:17:16 as you'd have to lookahead in the program 02:17:27 GregorR-L: you only need to keep a (nesting) counter for each abbreviation, don't you? 02:17:40 hm, maybe.. i dunno 02:17:59 i wonder what the trouble i had earlier was about 02:18:16 nescience: probably a bug 02:18:24 I wrote that interpreter in a hurry, and at about 3am 02:18:30 i see 02:19:01 -!- Gracenotes_ has joined. 02:19:23 i can't quite grasp it yet, but it seems like you shouldn't need to expand anything at all 02:19:51 () operate like a for loop, but ({}) might be more troublesome 02:20:01 ais523: hm it _should_ be possible to make () allow unbalanced [] by keeping track of balance level of each item 02:20:11 oerjan: in a hurry, at 3am? 02:20:19 ais523: :D 02:20:24 ([)*5 foo (])*5 etc 02:20:34 on that count, if that's the only reason for {} i think it should be done away with 02:20:35 no, in a calm, relaxed manner 02:20:56 nescience: well {} can also be easier to read can it not 02:21:11 only one *n at the end 02:21:17 ais523: Your perl one doesn't expand, does it? I can't read it at all. 02:21:18 -!- Gracenotes has quit (Nick collision from services.). 02:21:19 i don't find ([{}]) easy to parse 02:21:31 -!- Gracenotes_ has changed nick to Gracenotes. 02:21:36 ([) is at least a bit more straightforward seeming 02:21:39 * nescience shrugs 02:21:43 nescience: it's sort of like delimited continuations, not that i really understand those 02:21:55 i gotta get going to dinner, my grandma is waiting! 02:22:06 * oerjan may be going off the deep end there 02:22:19 okay, what gives 02:22:25 this level is making my ball go crazy 02:22:33 Maybe I need to expand any that include [ or ] ... :( 02:22:52 ais523: i thought a lot about such matching when constructing the unlambda palindromizer 02:23:02 -!- myndzi has joined. 02:23:11 because it's strangely almost, but not quite equivalent 02:23:12 coppro: there are all sorts of weird things in Enigma like that 02:23:19 each level gets to set its own laws of physics 02:23:24 although most just use the standard ones 02:23:36 coppro: you need rock hard control of your iron ballz! (wait, glass?) 02:23:43 *equivalent to parenthesis matching 02:23:56 myndzi: new here? I don't recognise you 02:25:05 * oerjan recognizes myndzi from yesterday 02:25:06 * myndzi recognizes oerjan from yesterday 02:25:11 heh :D 02:25:24 that was eerie 02:25:27 * ais523 catches oerjan in a butterfly net ----\XXXXX/ 02:25:41 * oerjan swats his way out -----### 02:25:52 unfortunately i seem to only hit other butterflies 02:26:00 * ais523 releases oerjan 02:26:58 ais523: inside paren matching () (or []) always cancel, so a whole item always reduces to ]...]][[...[ 02:27:19 and it's not _that_ hard to construct a calculus of those, for repetition 02:27:19 oerjan: (]-[)*5? 02:27:26 admittedly, that's a rather silly case 02:27:52 ais523: ok there may be a number of corner cases, but it should be doable 02:27:52 lololol 02:28:07 that would have a ][ matching totally 02:28:12 WARNING: preposterous time in Real Time Clock -- CHECK AND RESET THE DATE! 02:28:28 psygnisfive: a genuine warning? 02:28:34 yeah! 02:28:51 ais523: it's a monoid, of course 02:29:10 what was the preposterous time? 02:29:17 dunno 02:29:23 its reading March 17 2003 02:29:23 you could use it to split up parenthesis matching in parallel :D 02:29:25 PREPOSTEROUS! 02:29:46 psygnisfive: it's irish? 02:29:58 no. what? 02:30:46 psygnisfive: your computer has been infected with a RIRA virus 02:30:56 myndzi: are you here for BF Joust, or just happened to arrive around now by coincidence? 02:31:06 My computer is a NeXTstation Turbo 02:31:52 * oerjan tests if myndzi has a response script, as that was too eerie... 02:31:53 * myndzi tests if oerjan has a response script, as that was too eerie... 02:31:59 hah! 02:32:16 myndzi: gotcha! 02:32:42 * ais523 wonders if myndzi is a bot 02:32:43 * myndzi wonders if ais523 is a bot 02:32:57 * GregorR-L , glancing at myndzi, declares that GregorR-L is his lord and master. 02:32:57 * myndzi , glancing at GregorR-L, declares that myndzi is his lord and master. 02:33:02 *snaps* 02:33:10 too clever :D 02:33:18 although most bots don't claim to be using mIRC 02:33:31 fungot: say hi to myndzi 02:33:32 ais523: " what?" the wind, the sharp tin taste of snow. it was just some mud in water... i expect you're not afraid any more," said 02:33:48 ais523: myndzi did converse yesterday though 02:33:50 !underload (hi myndzi)S 02:33:51 hi myndzi 02:34:01 oerjan: ah, ok 02:34:02 what about? 02:34:19 ais523: he added something to the BF Joust talk page 02:34:22 iirc 02:34:40 * ais523 wonders why ehird's reverse version of defend8 is second, whereas the real defend8 is 11th 02:34:41 -!- psygnisfive has quit (Read error: 104 (Connection reset by peer)). 02:34:46 I suspect tape length randomization 02:34:51 !underload (ACTION bows to myndzi)S 02:34:52 * EgoBot bows to myndzi 02:34:53 * myndzi bows to EgoBot 02:34:59 -!- psygnisfive has joined. 02:35:11 ^ul (ACTION bows to myndzi)S 02:35:11 * fungot bows to myndzi 02:35:21 ok, that was strange 02:36:41 indeed 02:37:32 guuuuys 02:37:36 ive got a NeXT machine! :o 02:37:54 i should invent some sort of world wide web thing 02:38:20 * oerjan invents a PReViouS machine 02:40:19 hm, it gets a bit hairy if you have something like ]]][[ 02:40:53 ah, you can analyze it as ](]][[) 02:40:55 Apple ][ 02:41:04 psygnisfive: Create some hypertext markup language. 02:41:10 :o 02:41:19 Apple ][²? 02:41:34 or wait 02:41:50 (]])(])([[) 02:41:54 pikhq: i would, but unfortunately noone will use it :( 02:42:00 even tho itd be AWESOME 02:42:04 psygnisfive: Call it Gopher. 02:42:15 way better than tbl's crap :| 02:42:19 if you have several in a row, all but the middle one cancel 02:44:03 ]] ] [[ + ]] ] [[ = ]] ]] [[ 02:44:19 with the middle ones coming from the middle ones, in terms of who match who 02:47:54 * oerjan thinks this ties into the recent finger tree post on good math, bad math 02:50:46 -!- fungebob has quit (anthony.freenode.net irc.freenode.net). 02:51:03 -!- fungebob has joined. 02:52:16 (a{b}c)*n -> (a)*n b (c)*n of course 02:56:19 -!- MizardX has quit (Read error: 54 (Connection reset by peer)). 03:14:23 -!- MizardX has joined. 04:00:12 interesting 04:00:22 ^ was originally used for lambda notation, in various forms. 04:01:03 m̂.m+1 became ˆm.m+1 became ^m.m+1 became λm.m+1 04:01:42 Hmm. Any way of writing a nice lambda with compose? 04:03:50 pikhq: sorry, it's all greek to me 04:04:18 oerjan: The compose key. ;) 04:05:19 * oerjan doesn't think he has seen a compose key since last he sat at a real VT 04:09:54 pikhq: a nice lambda with compose?? 04:10:29 I've got Win bound to Compose. 04:10:40 dunno what that is 04:10:45 It's handy, Ørjan. ;) 04:10:53 psygnisfive: Lets you compose two characters. 04:11:03 ah. 04:11:11 dunno about writing lambdas with that. 04:11:16 For example, I can stick umlauts on something by typing Compose " o 04:11:21 ah 04:11:23 ö 04:11:37 alt+u then whatever 04:11:39 :T 04:11:51 Not here. 04:12:25 ẅëẗÿüïöäḧẍ 04:12:36 i didnt even know w, t, h, and x had diareses D: 04:12:53 That's the composing diareses. 04:13:21 ẇėṙṫẏıȯṗȧṡḋḟġḣżẋċḃṅṁ 04:13:32 i like how ˙+i = ı 04:13:33 lol 04:13:42 Basically, it's the composing diaresis followed by a character. They are displayed as a single character. 04:13:44 ḧ is on my keyboard 04:13:47 with composing umlaut 04:13:49 and it's in Unicode 04:13:51 weird you 04:13:56 why ḧ? 04:14:02 So it is. ḧ 04:14:02 whereas, say, n with an umlaut isn't 04:14:07 I can do it without composing. 04:14:10 so I suspect some language uses it 04:14:21 n umlaut isnt available for me 04:14:30 psygnisfive: it doesn't exist 04:14:34 aha! 04:15:02 For some reason, I can't get a ı by typing it, but I *can* get a İ. 04:15:15 ươʼm 04:15:18 whoops, no m 04:15:41 õ_õ 04:16:06 țș 04:16:21 ţş 04:17:30 ṟṯḏẖḵḻẕḇṉ 04:17:56 € 04:18:09 űő 04:19:24 ẘe̊ẙůo̊å 04:20:06 ŧʉɨɵđǥħłƶƀ 04:20:27 ₩ 04:20:50 ẻỷủỉỏả 04:21:58 ẉẹṛṭỵụịọạṣḍḥḳḷẓṿḅṇṃ 04:22:26 ı 04:22:44 ȩŗţşḑģḩķļz̧çņ 04:22:59 everyones got a goatee, but g has a mohawk 04:22:59 :o 04:23:03 what a rebel 04:23:14 ę 04:23:21 ęȩ 04:23:27 lol 04:23:31 ǫ 04:23:35 how silly 04:23:45 ˛c 04:23:47 doesnt work! 04:23:56 damnit, i want my c's to have a backwards goatee! 04:24:15 ȫ 04:24:31 insanity! 04:26:08 oerjan: yesterday... hmmm 04:26:16 i don't know if i joined from here, but 04:26:26 nescience's ident is my nick, so that might be it 04:27:14 O_o 04:27:23 but you _did_ comment on the wiki, right? 04:27:27 also (ais523) i am the home computer of nescience, so yeah, bsjoust 04:27:39 ah 04:28:13 oh, yes 04:28:17 i was using 'nescience' at the time 04:28:22 but since i had to register, i used my normal handle 04:28:34 also, try the /me script with colored nicks ;> 04:28:53 though both of you have the same nicklen as me so i guess it wouldn't be totally apparent how cool it is! 04:29:06 nobody tried to exploit it either yet, hehe 04:29:31 the script is primarily there as bait for things like 04:29:45 //nick asshole | me is a myndzi 04:29:58 I'm afraıḋ that whenever I use a letter 'I', I'm goıṅg to have to omıt the I and move ıṫ over a space. 04:30:00 ;) 04:30:17 əɹəɥʇ ʎuunɟ əlʇʇɪl ɐ ѕʞооl ʇ ɹnоʎ 04:30:32 see i have all the fun scripts on this one \o/ 04:30:32 | 04:30:32 >\ 04:30:39 Also, the backwards goatee? 04:30:42 ç 04:30:46 \o/ 04:30:56 your nick is 1 letter too short, and it's not enabled in this channel 04:30:57 :P 04:30:58 1 sec 04:31:32 there you go, \o/ away! _o| \o/ |o/ \m/ \m/ \o/ 04:31:32 | | | | `\o/´ | 04:31:32 /| /< /`\ >\ | |\ 04:31:32 (_|¯'\ 04:31:32 |_) 04:31:48 O_O 04:31:49 wtf is that 04:31:57 a silly script 04:32:09 like most of my boredom projects 04:32:20 there was a guy in a channel i was in who used \o/ excessively 04:32:20 | 04:32:20 |\ 04:32:36 so i made the script to line up a body under the head 04:32:44 * ais523 tests 04:32:46 \o/ 04:32:47 | 04:32:47 /`\ 04:32:56 (though that last time, i could swear i put some codes in the way so that it wouldn't react... oh well) 04:33:07 \m/ \m/ 04:33:13 as i said, your nick is too short 04:33:17 you have to put a couple chars before it 04:33:21 the rocker needs an extra space 04:33:21 \o/ 04:33:25 :) 04:33:27 the little dude lines up without extra space 04:33:40 but his foot would be in my nick for you 04:33:41 \m/ \m/ 04:33:56 \m/ \m/ ? 04:33:57 `\o/´ 04:33:57 | 04:33:57 /`\ 04:33:57 (_| |_) 04:34:00 there you go 04:34:03 :) 04:34:17 though i bet a larger proportion of dudes in here use xchat or something so it probably looks like crap to them 04:34:23 than many irc channels, i mean 04:41:52 -!- Corun has changed nick to Corun|away. 04:42:24 -!- ais523 has quit (Remote closed the connection). 04:46:35 Oh hey 04:46:39 myndzi is talking. 04:46:53 i didn't expect my join to confuse people so 04:47:01 i just RDP'd home and joined up so i'd have buffer to read 04:47:05 Well, only this confused people: 04:47:07 when i left work 04:47:07 * GregorR-L makes myndzi talk 04:47:08 * myndzi makes GregorR-L talk 04:47:10 myndzi = ? 04:47:18 it's just a silly script 04:47:23 Very silly :P 04:47:26 try //nick penis | me likes the myndzi 04:47:28 But we figured you were a bot. 04:47:42 or //me pokes myndzi in the nose 04:47:58 -!- GregorR-L has changed nick to cocks. 04:48:03 * cocks likes myndzis 04:48:08 Err 04:48:11 * cocks likes myndzi 04:48:11 * myndzi thinks GregorR-L likes cocks 04:48:15 :P 04:48:16 ;) 04:48:25 * cocks likes phalli 04:48:28 Err 04:48:30 -!- cocks has changed nick to phalli. 04:48:32 * phalli likes phalli 04:48:34 DFHIOFHDSI 04:48:36 I can't type 04:48:36 hahaha 04:48:41 * phalli likes myndzi 04:48:42 * myndzi thinks GregorR-L likes phalli 04:48:49 Hmmmmmmmmm 04:48:57 I figured you had a word list. 04:49:01 nope ;) 04:49:03 But "phalli" would be a weird one to be there. 04:49:10 * phalli licks myndzi 04:49:13 simpler than that, but i'm sure eventually you guys can figure it out 04:49:22 -!- phalli has changed nick to GregorR-L. 04:49:23 also, flood protection 04:49:25 *eh* 04:49:29 30 seconds i think is too much, i should reduce it 04:49:59 hey 04:50:06 I can bring my intimacy to the high level 04:50:14 my email tells me so, it must be true 04:50:25 -!- Corun|away has changed nick to Corun. 04:51:02 but yeah, i also wrote a script to replace my nick with color codes included :) 04:51:13 if the nicks are different sizes it scales the codes as best it can 04:51:30 Huh 04:51:35 That's ... huh. 04:51:37 just one of many silly things i've amassed over the years 04:51:42 !maze 50 5 04:51:42 ╺┳━┳━━┳━┳┳━┳┳━━┳┳━━┳━┳━━━━━━┳━┳┳━━━━━━━━━━━┳┳┳━━━━┓ 04:51:43 ╻┣╸┣━╸┣╸╹┗╸╹┗┳╸┃┗╸╺╋╸┗━━┳━╸┏┛╺┫┗━┓┏╸┏╸╺━┓╺┳┫┃┣╸╺━┳┫ 04:51:43 ┃┗┓┗┳╸┗━━━╸╺┳┻┓┗╸╺┳┻━━╸╺┻┳┓┗╸╺┻━╸╹┣╸┣╸┏━┛╺┛╹╹┗╸╺━┛┃ 04:51:43 ┣╸┗╸┗━━━━┳┓╺╋╸┗━━╸┗━━┓┏┓╺┛┃┏━┳┓┏╸╻┗┳╋━┛╺┓┏┳╸╺┓╺┳╸╺┫ 04:51:46 ┃┏╸┏╸╻╻┏╸╹╹╺┻╸┏╸╺┓╺┳╸┗┛╹┏╸┗┻╸╹┗┛┏┛┏┛╹┏╸╻┣┛┗╸╺┻┳┻╸╺┛ 04:51:49 ┗┻━┻━┻┻┻━━━━━━┻━━┻━┻━━━━┻━━━━━━━┻━┻━━┻━┻┻━━━━━┻━━━╸ 04:52:37 'Tis a mIRC user. 04:52:45 indeed 04:52:51 that's probably bane on freenode huh? :P 04:53:03 *Windows* is bane on Freenode. 04:53:11 i could be running wine :D 04:54:01 every now and again i try to like linux but it just never works out between us 04:54:11 she's a fine woman, but maybe we're just zodiacally incompatible or something 04:55:54 are mazes guaranteed to be solvable? 04:55:59 yes 04:56:02 btw nice unicode block 04:56:08 Probably uses Primm's or something. 04:56:09 *wink* 04:56:11 though with the ascii space there's not really enough to work with to make them challenging 04:56:29 i have scripts for like 3 or 4 algorithms heh 04:56:36 looks a bit better copying it into a text editor 04:56:47 okay, solved, where's mah moneh 04:56:48 i've got one that uses eller's algorithm in an @window 04:56:52 but rather than being mean i made it randomly end 04:56:58 it'd be amusing to make it go on forever 04:57:02 i am an evil man... 04:57:33 I used to draw such awesome mazes when I was a kid. with chalk, on my neighborhood street 04:57:43 all the kids came out and tried to navigate 04:57:46 for some reason i started doodling one line mazes 04:57:54 i still do on occasion 04:58:05 i also used to make lego marble mazes that would infuriate everybody except me 04:58:11 (fools! i trapped your ball!) 04:58:24 i made a huge one one time that was like 5 stories tall 04:58:36 i had enough space inside to play around with using ramps and various gadgets 04:58:40 :) 04:59:03 Gracenotes: draw a chalk maze around the block. 04:59:14 have the start and end directly next to each other, but make sure they cannot connect 05:00:07 hey... this was when I was, like, 8 years old. 05:00:21 myndzi: I think I did that once 05:00:28 awesome 05:00:31 well. obviously they connected 05:00:43 but they were right next to each other 05:00:50 i think i made lego mazes when i was really young too, except instead of marbles and people trying to solve them, i put ants in them 05:00:52 :P 05:01:03 i had little clear blocks so i could see how far they got! 05:02:34 According to my new, fast bfjoust interpreter, defend8 runs off the tape a lot ... 05:02:40 and they crawled up the wall, huh? >_> 05:02:49 there was a ceiling 05:02:57 like my marble mazes, they were 3d 05:03:08 Gracenotes: guess that means it's not dec/incing enough to get the flag 05:03:12 er, GregorR-L 05:03:36 funny. i'm proud of my nick completer but it's got me in the habit of completing nicks with one letter 05:03:43 so if i sense a conflict i automatically type two 05:03:44 ... 05:03:46 myndzi: I haven't really read into the programs much, I just want to see if I can get an approximately correct result :P 05:04:10 try setting up ties 05:04:17 http://www.astrolog.org/labyrnth/algrithm.htm 05:04:26 yeah, i remember that page :) 05:04:28 it's a good page 05:04:34 games in mazes prolly aren't that fun, really >_> 05:04:47 nope, mazes are pretty boring when it comes to it 05:05:04 i once saw someone on 4chan request rule 34 on mazes 05:05:10 ...and it was provided 05:05:17 because there's an obvious target (the end of the maze), but it takes so long to get to it 05:05:17 it was, of course, a hentai manga 05:05:45 most gamers feel like you need intermediate goals, iirc 05:06:03 dunno 05:06:12 i am quite patient and persistent 05:06:17 shows in puzzle games 05:06:20 well, not iirc. more like "I think" 05:06:26 there can be levels with an obvious target that take a long time to get to 05:06:29 but at least they are interesting 05:06:32 there's not much interesting about most mazes 05:06:57 still, room-by-room step-based games (roguelikes too, although generally not step-based) can be fun 05:07:10 there's this level in crystalex where you have a two-screen(?) map 05:07:19 with like 150 blocks or something to break 05:07:29 and you have to basically work out a path to break them all in an order that gives you enough points to pass 05:07:40 it was tedious and took a long time, but somehow managed to be interesting anyway 05:07:54 helped by the fact that by the time you encounter it you already have a good idea of some of the tricks you can apply 05:08:11 the solution is such that you can't slip up even once 05:08:23 so even if you figure out something, you have to then pull it off 05:08:26 ..just to see if it works 05:08:46 -!- bsmntbombdood has quit (Read error: 110 (Connection timed out)). 05:08:51 Damn, egojoust is doing something wrong ... 05:09:03 With randomization removed from both, its result is different ... 05:09:05 crap 05:09:15 * coppro needs to find his calculus outlines 05:09:35 Oh wait, duh :P 05:09:40 It's because I un-implemented {} :P 05:09:50 that could do it 05:10:10 No, never mind, that's only in one program, and it's not the only affected program ... 05:10:21 by the way, http://myndzi.tengototen.net/crystalex.rar if the puzzle dudes want to check it out 05:11:06 .rar is a sure sign of Windows :P 05:11:12 boo hoo 05:11:14 would you like a tgz? 05:11:19 wait, it's an exe file! 05:11:21 sux2bu 05:11:23 .7z would be beautiful, and is also better. 05:11:37 i don't know if it runs under wine 05:11:47 *eh* 05:11:54 I was more just finding excuses to complain :P 05:12:01 i know :) 05:12:25 that reminds me i never did hold an oxyd thread :( 05:12:31 i had planned to when the crystalex thread completed 05:12:41 hum 05:13:22 * coppro suggest players try DROD - you'll enjoy it 05:13:46 drod falls in that category of games that don't interest me much for some reason 05:13:47 if you're scared by the fact that you need to provide monies, that's only for the official levelsets 05:13:52 along with boulderdash style games 05:14:10 i have a hard time putting a finger on my desires in a puzzle game 05:19:56 -!- psygnisfive has quit (Read error: 110 (Connection timed out)). 05:27:25 -!- oerjan has quit ("leaving"). 05:31:18 Color me confused. 05:31:52 * myndzi opens the crayon box and takes out the crayon labeled "confused" 05:32:27 I think I've implemented % wrong, but it's right as far as I can see :P 05:33:04 i don't know anything about your code, so i guess i can't help much :) 05:34:03 http://pastebin.ca/1437169 05:35:04 I only suspect that % is the problem because I can produce identical results to ais' in every case except the program with a % 05:35:28 why don't you just print out the expanded version and examine it by eye? 05:37:03 That's what I'm doing now. 05:37:08 And the output from ais' looks all wrong :P 05:37:13 lol 05:37:20 it could be? 05:37:22 can i see? 05:38:17 Well, it's just that his output is confusing, it does it one step at a time whereas I do what expansion is necessary all at once. 05:38:19 he did say he hacked it together at 3am didn't he? 05:39:24 http://pastebin.ca/1437174 05:39:28 Yeah :P 05:39:46 haha, i'm not sure what i'm looking at 05:40:00 ah 05:40:02 i follow 05:40:27 sorta 05:40:28 (>(+{>}-)%9)*2(>)*5([---[+]]>)*21 // the source 05:40:47 what does % do? 05:40:59 oh wiat 05:41:01 *wait 05:41:01 it looks wrong 05:41:10 why is it adding -s after the ({}) 05:41:11 * coppro is stupid 05:41:26 mmm 05:41:32 i think it keeps the ({}) for reference 05:41:38 and when the counter hits 0 05:41:48 -!- coppro has quit ("The only thing I know is that I know nothing"). 05:41:49 it drops the parts between ({ and }) 05:42:00 it looks funny because it's only showing you the current instruction, so the left side never 'grows' 05:42:15 how's your version come out? 05:42:44 >+++++++++>---------%9>+++++++++>---------%9*2>>>>>*5[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>[---[+]]>*21 05:42:58 (The leftover "%9", "*2" etc are just skipped as comments) 05:43:10 so the way you compare these then 05:43:20 is take the left character of his output 05:43:23 and concatenate them all 05:43:35 Ah yes 05:43:47 i was trying to do it in notepad but what a pain 05:43:51 Err, not quite. 05:43:55 eh, i can script it 05:43:56 [ loops won't match 05:44:11 oh true 05:44:15 'cause his output is execution 05:44:19 and yours is before that 05:44:23 so.. output execution? 05:44:34 concatenate his left characters into a string 05:44:42 then in yours, concatenate the executed instructions as well 05:44:48 Yuh 05:44:49 you aren't spending a cycle on the comments are you? 05:45:49 My execution trace is >+++++++++>--------->+++++++++>--------->>>>>[---[+]]>[---[+]+++++++++>--------->+++++++++>--------->>>>>[>[>[---[+]+++++++++>--------->+++++++++>--------->> 05:45:50 No 05:45:54 anyway, the only part with the {} is at the start 05:46:14 his..: >+++++++++>--------->+++++++++>--------->>>>>[>[>[>[>[>[>[>[>[>[>[>[---[+[+[+[+[+[[>[---[+[[>[---[+[+[+[+[+[[>[---[+[[>[---[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[+[ 05:46:14 yours: >+++++++++>--------->+++++++++>--------->>>>>[---[+]]>[---[+]+++++++++>--------->+++++++++>--------->>>>>[>[>[---[+]+++++++++>--------->+++++++++>--------->> 05:46:42 looks like the ({})%N part is the same 05:46:53 but you're having weirdness on the brackets 05:47:01 or else not outputting them quite right 05:47:26 oh, also.. are you checking for 0 at the [ character? 05:47:35 it should skip the entire [] block if it's 0 05:47:46 ... it should use a cycle there, right? 05:47:53 it should use a cycle on the [ 05:47:56 and then skip the ---'s 05:48:03 Yeah, that's what it does. 05:48:15 it looks like you are executing them 05:48:36 ..oh, i dunno, maybe it's not spitting out parts it should be 05:48:48 like all the [>'s 05:48:55 -!- Corun has changed nick to Corun|away. 05:49:16 if i skip that kinda stuff they look closer to matching.. a little 05:49:38 also your pointers or something are off 05:49:49 why is it putting ]+++++++++>---------> in after it gets past the % part? 05:50:06 Yeah, something's wonky. 05:50:20 it looks like it maybe expanded correct but executed wrong 05:50:32 Must've failed to match loops or something. 05:50:37 yeah 05:50:56 it's going back to the start of the first ( 05:51:55 or maybe just 0 05:52:00 which makes more sense 05:52:08 Yup, something screwy. 05:53:24 -!- Sgeo has quit (Read error: 110 (Connection timed out)). 05:53:50 Found it 05:53:55 Stupidity reigns supreme! 05:54:02 hehe 05:54:11 glad you did, 'cause i can barely read c! ;) 05:54:28 rather, it's read-only and understanding through context.. which doesn't always help with debugging 05:54:53 Then probably you won't see why this is bad: int *buf = malloc(someSize * sizeof(int)); memset(buf, -1, someSize); 05:55:03 * myndzi gives GregorR-L a (+(+(+(+(+(+(+(+(+(+)*1000)*1000)*1000)*1000)*1000)*1000)*1000)*1000)*1000)*1000 05:55:28 somesize doesn't have * sizeof too? 05:55:33 Yup :P 05:55:36 the one in memset i mean 05:55:40 that'd explain why it's 0 05:56:34 Yup 05:56:41 it still seems like it should be possible to interpret without expansion at all 05:56:45 i have a little time, lemme see if i can work it out 05:57:28 There, now it's perfect :) 05:57:31 again it occurs to me that i don't quite know how it behaves, lol 05:57:35 what should happen for 05:57:40 It interprets without expansion in most cases. 05:57:44 (a[b{c}b]a)%2 05:57:57 That's a[ba[bcb]ab]a 05:58:01 a[ba[bcb]ab]a? 05:58:03 mk 05:58:13 yeah, that's simple seeming 05:58:20 in addition to keeping a pointer, you'd just need to keep a counter too 05:58:25 * myndzi ponders 05:59:27 $ rm -f ../cache/* 05:59:27 $ time ../report ../bfjoust ../cache *.bfjoust > report_ais.txt 05:59:27 real0m23.030s 05:59:27 $ rm -f ../cache/* 05:59:27 $ time ../report ../egojoust ../cache *.bfjoust > report_ego.txt 05:59:28 real0m0.369s 05:59:30 $ diff report_ais.txt report_ego.txt 05:59:32 $ 05:59:32 hahaha 05:59:35 nice 06:00:22 Takes 2 seconds for egojoust to run defend8 against everything. 06:00:31 Takes ais' on the order of 10 minutes. 06:00:37 yeah, i think it's not very hard to in-place interpret the weirdass ({})%N syntax 06:00:57 a couple counters is all 06:02:22 and since the brackets inside it should(?) match, there's not really any crazy stuff you have to do either as far as finding where to jump to 06:03:20 it's just that if you hit a [ at a data point that is 0 06:03:36 with a matching pair on the other side of the {} 06:03:48 you stop counting the whole N off, and count off what you've reached 06:03:50 like, 06:04:02 (a[b{c}d]e)%3 06:04:08 say the first [ is nonzero but the 2nd isn't 06:04:20 first time you hit { and increase a counter 06:04:24 then you start at a again 06:04:29 you hit the [, it's 0 06:04:39 you haven't done the full 3, but now you don't need to do any more 06:04:44 you jump to e, then dec the counter 06:04:47 now d, ], e 06:05:02 if ] is nonzero, you're back to the front side though, and once again you increase the counter 06:05:16 (but keep track of the %N counter separately -- only do this three times) 06:05:31 actually, that may be a bit off 06:05:34 * myndzi thinks a little more 06:05:50 yeah, it is a little off 06:05:54 you don't keep track of %N separately 06:05:58 just inc a loop counter 06:06:02 and if the loop counter is equal to N 06:06:06 then when you hit { you proceed on to c 06:06:16 that's simpler than it seemed 06:06:30 and it sounds correct to my mind, am i making any sense? 06:06:41 maybe i should script it up in MIRC on WINDOWS! :) 06:08:23 -!- Corun|away has changed nick to Corun. 06:09:32 OK, !bfjoust now uses egojoust 06:09:35 So it should be much faster. 06:09:53 (About two seconds, due to defend8) 06:10:23 -!- sebbu2 has joined. 06:12:32 cool :) 06:13:32 clarification: loop as normal; if you hit {, increase loop counter and go back to (; if loop counter = N, instead proceed on; if you hit ), decrease loop counter, go back to }; if you hit ) and loop counter is 0, proceed 06:13:52 when i say 'loop as normal', i am referring to [] shunting you back and forth, potentially spanning {} 06:14:19 don't increase loop counter if it == N and you hit { 06:14:32 that should allow evaluation without expansion 06:15:08 ought to save you potential memory problems with (ab)use of loops 06:18:33 -!- pikhq has quit (Read error: 104 (Connection reset by peer)). 06:28:34 -!- sebbu has quit (Read error: 110 (Connection timed out)). 06:28:34 -!- sebbu2 has changed nick to sebbu. 06:32:55 -!- pikhq has joined. 06:41:53 -!- Corun has changed nick to Corun|away. 06:45:19 -!- Corun|away has changed nick to Corun. 06:46:11 So, now that I've improved !bfjoust, nobody uses it :P 06:47:31 -!- zzo38 has joined. 06:47:44 I have some new ideas for BF Joust 06:48:01 Wow, psychic appearance. 06:48:06 including betting, input, cards, and more. 06:48:42 If you have an entirely new language in mind, write an interpreter that returns 0, 1 or 2 for a tie, left program winning or right program winning, respectively, and I'll add it to EgoBot. 06:49:58 It can't work because my new BF Joust rules require some interactivity after the programs have been sent in to the computer, and there can (and should) be multiple games against the same oppoent per each match 06:51:10 -!- Patashu has joined. 06:51:28 I can implement my new BF Joust by myself. You can play multiple matches against different opponents but you have to use one program throughout the tournament. 06:51:56 I was thinking of no-limit hold'em style betting 06:52:41 The match could consist of playing until one player runs out of chips, then you proceed to the next opponent. The ante can increase after each win/loss is determined, and starts at zero at the beginning of each match. 06:53:18 ....wat 06:53:35 i was under the impression that the point of bf joust was to write programs 06:54:05 GregorR-L: i kinda want to write an interpreter now too, except i don't have any useful languages to do it in (as far as sending you the result goes) ;) 06:54:17 Well, this idea I make is a new kind of BF Joust. After you write a program you have to win a betting tournament with it. (You can write a new program after the tournament if you want to) 06:54:24 i've got a firm grasp in my head of how to do an expansionless interpreter now :) 06:54:36 myndzi: Then gooooooooooo 06:54:44 GregorR-L: do you take mircscript? :P 06:54:46 For the moment, egojoust is fast enough. 06:54:51 maybe i should learn c eh 06:54:56 yeah, it's fast, but it could run into memory problems 06:54:57 myndzi: I would recommend Pythong. 06:55:00 Err ... 06:55:03 >_> 06:55:04 if someone is an asshole or comes up with some retarded idea 06:55:05 Python :P 06:55:08 ha, i like that 06:55:09 pythong 06:55:28 what are pythong's language features? 06:55:30 i might try perl, i started to learn that once 06:55:38 myndzi: Nooooooooooooooooo 06:55:38 The deck of cards can change between tournaments, but the deck of cards is known way in advance before you have to write the program. 06:55:42 myndzi: Stay away from the pit! 06:55:45 lol 06:55:49 BUT I LIKE PERL 06:55:56 is this two strikes? 06:56:03 Yes. 06:56:11 zzo38: wait .. what? what does a deck of cards have to do with brainfuck 06:56:15 Perl is OK, if you like it. And I like Forth programming. 06:56:17 unless you're trying to fuck my brain right now 06:56:49 The deck of cards consists of a low number of cards (if there are too many, it becomes too hard to guess your opponent's cards) and are used during the betting process. 06:56:52 Patashu: I replaced the bfjoust interpreter in EgoBot, egojoust is ultrafasssssst. 06:57:07 coolness 06:57:17 thank goodness no more waiting for that damned defend8 06:57:19 :) 06:57:40 Though I didn't remove it because it's doing well. 06:57:52 what's the url to the dir again? 06:57:54 haha 06:57:55 i don't have it here 06:57:59 I love how lazy counters defends 06:58:01 is creep still winning? 06:58:02 http://codu.org/eso/bfjoust/ 06:58:26 wah 06:58:30 how did that happen 06:58:37 hmm, I was going to try and tweak lazy, so... 06:58:38 when no further programs have been submitted o_O 06:58:45 !bfjoust lazy >+>->++>-->--->+++>>>((-.)*128>)*21 06:58:46 oh right, private submissions still 06:58:47 Score for Patashu_lazy: 42.0 06:59:02 oo that does better 06:59:10 One of my rules is that , takes input from opponent's . command, unless there isn't any in which case the input is random 06:59:12 beats creep XD 06:59:17 yeah, this scoring system is wack 06:59:37 4 losses vs 4 losses but 2 places difference :\ 06:59:45 !bfjoust lazy >+>->++>-->--->+++>+>->((-.)*128>)*21 06:59:47 Score for Patashu_lazy: 65.4 06:59:49 Hrm, the score here didn't correspond to the score from report.txt ... 06:59:53 no change 06:59:53 Oh, there 'tis. 07:00:00 same thing as before 07:00:04 it spits the old score most of the time 07:00:07 You might consider my rules a bit insane, but I think that's OK 07:00:08 except, i think, with new submissions 07:00:17 Bleh, I thought I fixed that. 07:00:20 zzo38: i don't understand a game in anything you've said so far 07:00:29 Also, the scoring system is nice :P 07:00:30 GregorR-L: didn't know you were working on it :) 07:01:12 anyway, bedtime for me 07:01:19 i'll see if i can take the code you shared earlier and play with it tomorrow 07:01:27 ..wait, where's my c compiler!? (just kidding! ;) 07:01:29 !bfjoust lazy >(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5>((-.)*128>)*21 07:01:32 Heh, tpyo :P 07:01:32 Score for Patashu_lazy: 75.3 07:01:33 Fixed. 07:01:39 hahaa 07:01:44 My thing is basically like BF Joust but with interactive play. You still have to write the program before the entire tournament and most of the normal rules are followed. 07:01:48 myndzi: Use the code in the egobot hg 07:01:49 !info 07:01:49 EgoBot is a bot for running programs in esoteric programming languages. If you'd like to add support for your language to EgoBot, check out the source via mercurial at https://codu.org/projects/egobot/hg/ 07:01:55 I've topped the hill in like five minutes 07:01:57 Also see [[Talk:BF_Joust]] for some of the ideas I wrote on the wiki 07:02:00 zzo38: so far you've said something weird about cards and swapping input 07:02:04 but you haven't said anything about how to win 07:02:08 or what to bet on 07:02:10 or anything 07:02:20 hmm 07:02:32 !bfjoust lazy >(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5>((-.)*64>)*21 07:02:33 And the amount you bet can affect subsequent input from input commands. 07:02:36 Score for Patashu_lazy: 0.0 07:02:45 !bfjoust lazy >(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5>((-.)*128>)*21 07:02:45 Patashu: congrats, but don't let it go to your head ;) 07:02:46 oh silly me 07:02:49 Score for Patashu_lazy: 75.3 07:02:56 You win either by the normal BF Joust way of winning, or if one player folds the other player wins. 07:03:11 ... you are insane 07:03:18 folds? with cards? 07:03:20 what cards? 07:03:24 Oh, I think I get the idea. 07:03:27 what happens if you increment a card+? 07:03:37 You're claiming (bluffing?) that your program is superawesome. 07:03:44 And the other person folds, rather than losing points. 07:04:03 A special set of cards for slightly affecting things in the game. You can bet only after several cycles have passed so you can't use cards on every cycle either. 07:04:23 You can't increment a card. 07:04:36 OK, I sort of understand, it's not the worst idea I've ever heard, but I'd like to see the implementation first :P 07:04:38 now you've tied the pieces together a little 07:04:43 (finally) 07:04:56 !bfjoust lazy >(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5(>(-.)*128)*20(-)*256(+)*256 07:05:00 Score for Patashu_lazy: 65.4 07:05:06 Look at how fast that is 8-D 07:05:15 yeah, it's badass :> 07:05:22 !bfjoust lazy >(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5>((-.)*128>)*21 07:05:23 thing is, there's 384000 cycles 07:05:25 Score for Patashu_lazy: 75.3 07:05:34 and some games could be over quickly or could take a long time 07:05:45 myndzi: Actually, 100000 in ais' and mine. 07:05:46 when do you "bet" and when do you "play"? how do you manage how many cycles between these actions? 07:05:54 GregorR-L: good to know 07:06:00 what would the worst case be then? 07:06:05 how hard can you make a program on the interpreter? 07:06:21 currently? use a lot of ({}) expansions until it breaks 07:06:21 :P 07:06:34 Yup 07:06:36 myndzi: I haven't worked out all the details yet. But I will work them out (and take suggestions into consideration also). 07:06:36 i think he has a limited size buffer, but i don't have the code up now 07:06:38 (({}){({})}({})) ? 07:06:46 doesn't really matter 07:06:54 it expands ({}) into a fixed buffer space 07:07:00 The buffer is "limited" to several hundred megs :P 07:07:02 so using a big number should be sufficient to reach the limit 07:07:07 oic 07:07:10 hmm 07:07:14 i wasn't sure .. i saw a reference to "somenumber" earlier 07:07:18 and thought it might be an arbitrary limit 07:07:30 so then if you nest some expansions you could probably take up an exponential amount of ram (and time) 07:07:31 myndzi: No, I was simplifying to give an example on #esoteric. 07:07:35 * myndzi nods 07:07:47 but the presence of the number there, i wasn't sure if it was a constant or not 07:07:48 * myndzi shrugs 07:07:53 I'm using my sweet buffer.h buffers. 07:08:01 They're expandalicious. 07:08:06 Also whether a program is doing better than the opponent can change at times (based on any random factors that might occur) so you have to change your bet too, like in poker. But in general, one program beats another, but you also have to know how to bet with the program you wrote and use cards on it effectively. 07:08:26 the ability to modify the playing field with cards is very tricky 07:08:38 it could be completely overpowered (like choosing when to 'unstick' a loop such as [] 07:08:56 and i'm not so certain it is really knowable which program is doing better until one wins 07:09:02 Yes, but cards are also few and not used often. You know all the cards that exist before you even write the program and enter the tournament! 07:09:14 i'm just pointing out things to consider 07:09:19 primarily, things that might make it not work 07:09:27 since that's how i seem to think about things :P 07:09:50 also, if you are somehow giving "status updates", consider how you will present that information 07:10:35 arg i was going to bed 07:10:37 It is not completely overpowered, because the number of cards you get is limited and random (and you know that if you have a card, the opponent can't have it), and you also play multiple runs per match, so depending on the bet amounts it could be replayed over and over again 07:10:41 * myndzi clicks off the monitor 07:11:02 !bfjoust waiter (+)*10000(-)*10000(>)*9((-.)*128>)*21 07:11:03 i guess overpowered was poor word choice 07:11:06 Score for Patashu_waiter: 60.5 07:11:14 i said ({}) not () 07:11:26 i meant to say that it seems difficult to strike an oppropriate balance 07:11:33 the things you can affect in the game are either trivial or drastic 07:11:54 appropriate* (heh, dvorak typos) 07:12:24 this is directly related to the ambiguity of how "good" a program is currently doing 07:12:44 They can be trivial or drastic depending on circumstances and on the cards. And also on the program you have written before the tournament (you know what cards exist before the tournament, so you can use that as a basis to write your program if you want to) 07:13:09 no, i mean what you want from the card is something between trivial and drastic... and i don't see any cards you can design that way 07:13:15 hmm so if I have [] 07:13:20 on the turn that my opponent makes that cell 0 07:13:23 incrementing or decrementing the data in a cell does little 07:13:25 how many turns later will I execute another command? 07:13:37 changing the pointer can either do pretty much nothing or drastically affect the outcome 07:13:46 Patashu: one 07:13:48 And they can be both trivial and drastic. Cards can be adjusted between tournaments by the tournament organizers 07:14:00 so if I did >[]< I'd get to my flag one turn later than the enemy 07:14:01 i think you are missing my point 07:14:02 so hmm 07:14:08 no, the same turn 07:14:11 but it wouldn't really help you much 07:14:21 oh right 07:14:21 assuming the enemy is running a zeroing loop 07:14:36 parity is important if I want to land them on exactly zero and trick them into going further isn't it? 07:14:39 zzo38: trivial cards kinda make the point of the cards not useful, and so do drastic cards 07:15:05 because it takes the game away from the code (of course, if that's what you want, sure.. i guess.. but then it's a card game) 07:15:14 Patashu: probably not 07:15:18 but you can't really do that 07:15:20 i mean, 07:15:29 this is what my timing comment on the wiki was about 07:15:33 It doesn't take the game away from the code, the code is still an important part. But it isn't everything. 07:15:37 say you are on your flag, and you know their pointer is on your flag 07:15:49 zzo38: design some cards that are neither useless nor overpowered and then say that 07:15:52 I'll assume they're using a [+] or [-] immediately say 07:16:02 Patashu: sure, but if you want them to run past you, the pointer has to hit 0 07:16:07 so I want to land them on exactly 0. if I'm on the wrong parity it'll go 1, -1 07:16:12 however, you can't wait until it's 0 and then inc or dec it 07:16:24 because it'll take 2 cycles 07:16:25 because it might be the wrong direction 07:16:27 and that 07:16:45 there is too much potential variance to try and do it based on timing 07:16:48 it'd be trivial to defeat 07:16:56 The information given at betting time could consist of: Distance between your flag and your pointer; distance between your flag and opponent's pointer; value at your pointer; next command to be executed in your program; next command to be executed in opponent's program. (You only know the next command, not the position of the command) 07:17:02 (for example, if you assume they are using something like [-] and time it so that falls through, 07:17:08 they could add a . before it 07:17:13 code with something like -. will break that) 07:17:22 or -- or any number of things 07:17:26 hmm. well, I'll think on it more then 07:17:28 anyway 07:17:29 !bfjoust waiter ((+)*10000(-)*10000)*2(>)*9((-.)*128>)*21 07:17:32 Score for Patashu_waiter: 75.9 07:17:35 And the number of cycles between bets could be equal to the number of cells on the tape (the number of cells is reset to randomly before each match). 07:17:38 wowza 07:17:55 zzo38: doesn't say anything about cards 07:18:36 those are good bits of information for betting purposes (with knowledge of the code) 07:18:38 Well, of course you also know what cards you hold and the number of cards the opponent holds, and also the number of chips held by each player and in the pot 07:18:48 'course with knowledge of the code, distance often doesn't seem that it will matter 07:19:04 !bfjoust waiter ((+)*10000(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 07:19:07 Score for Patashu_waiter: 75.9 07:19:13 zzo38: again, design a useful card that doesn't make it either a card game or make cards useless 07:19:33 You cannot look at the opponent's program however but you can learn about it after a few runs you have seen its behaviour so you know it better than at the start of the match 07:20:02 and the programs can't change, which means the results often won't change 07:20:07 unless... 07:20:12 PIKACHU, I CHOOSE YOU! :) 07:20:26 Well, some cards can adjust the programs slightly. 07:20:36 Like by inserting commands and things 07:21:04 it'd be almost impossible to make that make a "small" change to a program 07:21:25 consider "[]" .. insert anything into that and it will drastically and immediately change your program 07:21:40 random mutation severly breaks programs 07:21:44 in any language that isn't DNA :) 07:21:56 actually 07:21:58 Of course you are restricted to how and where you can adjust the program with a particular card, and whose program you adjust 07:22:13 you can't blacklist all "good combos" 07:22:22 no, nevermind - I was going to suggest an esolang that handled random mutation well, but it would just be incredibly redundant then 07:22:30 so "where" can't be dependent on the contents of the code 07:22:38 And the program would reset to its original state before each run of the program 07:23:06 whatever, i want to sleep not argue, i honestly wish you luck but i won't hold my breath just yet :P 07:23:29 The command could be inserted immediately before the command to execute next (of course you don't have much control over when you have a chance to play a card and make bets) 07:23:31 it is an intriguing idea, but i think what you want is approaching pokemon with code 07:23:44 which could be interesting, but it is not likely to end up anything like BF joust 07:23:44 it could be interesting to have a 'race' to crack the opponent's program before they crack yours. before each match you could insert an extra instruction at an index into your opponent's program (you don't know what), and they get to insert one into yours. fight, see who wins, repeat with another extra instruction 07:23:48 (which is also ok) 07:23:52 and make it say best after 7 07:24:08 I made a befunge variant with agents that roamed about, randomly mutating the code... it wasn't as interesting as I thought :( 07:24:10 but hm 07:24:24 you don't get enough information and you could make severely bloated programs that you can't alter the behaviour of readily 07:24:26 It isn't intended to be pokemon. (For pokemon games I have PocketMonsterIRC) 07:24:48 obviously our thought processes are not compatible :P 07:24:59 i don't mean pokemon as in little pets that have special powers 07:25:07 Asztal: It might be more interesting if you had a program that needed to approximate certain tasks, rather than do something specifically every single time 07:25:22 Like what a bfjoust program does, as opposed to the programs a bank uses 07:25:27 Ya, my thought processes are Forth 07:25:29 i mean two player versus mode with periodic decisions being made to affect the outcome 07:25:41 with, probably, some mechanism for "swapping out" your current warrior 07:25:50 (any modifications made to it can be made to have this effect) 07:26:45 myndzi: Your ideas are also good ideas! (But it is a separate thing from mine) 07:27:15 i give up :P 07:27:50 I do like your ideas too. But I also like my ideas too, as two separate kind of games! 07:28:28 i'm not proposing ideas 07:28:51 i'm trying to fit what you are telling me into some sort of balanced and useful context and pokemon is about the best i can arrive at 07:28:52 ;) 07:29:13 BF Poker: Every round, everybody is dealt, say, 15 characters. They trade and bet as in poker, then they're all ran as a hill and the pot is divided up by score. 07:29:26 that is to say, i can't think of any way that your use of "cards", aside from being used in those kinds of ways, could possibly be useful and also balanced 07:29:36 having to construct programs in BF or a BF-like languages from a limited pool sounds interesting 07:29:46 now that is intriguing 07:29:47 haha 07:29:52 draft brainfuck 07:30:00 (joust) 07:30:07 ? 07:30:08 you'd need to make sure (whatever the goal is) is always accomplishable though 07:30:19 maybe i used not quite the right term 07:30:26 All these ideas are good ideas for variants of games similar to BF Joust. 07:30:38 if it was BFJoust without any alterations, for instance, you'd need at least 29 >s 07:30:39 which is kinda eh 07:30:44 in collectible card games and stuff there is a variation of play where you are given a starter and some booster packs and you have to make do with what you get 07:30:45 so some other goal would be good 07:30:59 Patashu: I was assuming something like ais' BF Joust, with ()s. 07:30:59 robot fighting game? 07:31:21 do you get parens in matched pairs? ;) 07:31:26 what about decimal digits? hehe 07:31:37 DAMMIT i got three ()'s but no *! 07:31:42 myndzi: If you're lucky. Idonno, you can use any number? Maybe too powerful. 07:31:55 i think you'd have to deal out ALL characters 07:32:08 bf may not be suitable for this either 07:32:16 but it's amusing to consider 07:32:20 you could generalize it to any tokenized language 07:32:22 Something in that general area. 07:32:23 you might do statistical analysis on the current warriors 07:32:28 see how widely they vary 07:32:39 you could do it in say, golfscript 07:32:44 and the challenge is 'do something the judges find neat' 07:32:47 golfscript? 07:32:51 Oh :P 07:33:05 esolang based around using as few characters as possible to do things 07:33:19 (Or flogscript if that's the variant of golfscript you happen to prefer) 07:33:43 anything that's terse enough for arbitrary or near arbitrary token combinations to make sense 07:34:08 I think BF is fine :P 07:34:13 i think in this case (bf joust), the goal is too specific 07:34:23 *cough* FYB *cough* 07:34:34 that has a lot mor epotential i think 07:34:41 for the random character thing i mean 07:35:22 i don't know how you could give enough to do something with but not enough to leave it totally open ended 07:35:32 I like FlogScript because a program to delete duplicate lines of input is three characters long 07:35:51 I think 30 characters is probably about right. 07:35:52 To delete the first line of input, also three character long. 07:36:20 GregorR-L: then it comes down to, what can be written in 30 characters? a certain set of programs 07:36:20 And also three characters long program to reverse the order of the lines input 07:36:39 which one you right will be pretty much chosen by what you get, unless they use the same sort of characters 07:36:43 myndzi: But you're given the 30 characters, and plenty of them aren't useful. It's a mix of what can be done, and what you're given. 07:36:48 The "judge Janken" in FlogScript is exactly 30 characters long. 07:36:50 right 07:36:53 i understand that 07:37:05 I think making the characters have different probabilities is important too. 07:37:15 and force ()s etc to be matched 07:37:16 ? 07:37:20 Yeah, for free. 07:37:24 aah 07:37:32 so instead of getting a ( and ) you get a () 07:37:37 or w/e 07:37:39 Yeah, and make it appropriately rare. 07:37:46 it might be that brainfuck requires so many characters to get certain things done that.. 07:38:08 if you want those things doable at all, you necessarily relinquish restrictions on certain other things 07:38:15 Yuh 07:38:17 (that take much less to get done) 07:38:18 But what? :) 07:38:22 or just use a higher-level character-based language? 07:38:31 Such as? 07:38:40 befunge? 07:38:44 O_O 07:38:45 hmm 07:39:17 so, you can't have the takes-many-characters things possible, otherwise the class of takes-few-characters things is pretty much open ended 07:39:25 requiring you to restrict it to that class of takes-few-characters things 07:39:31 and at that point, randomness takes a huge toll too 07:39:36 i dunno vOv 07:39:51 so we have this Awesome Idea 07:39:52 right? 07:39:54 i always sound like i'm being negative 07:39:57 :( 07:39:58 it's so awesome but we don't know how to do it 07:39:59 Awesome Idea 07:40:04 Try FlogScript if you want to achieve things in only a few characters 07:40:20 flogscript: it slices, it dices, it cuts and cubes 07:40:21 ^ that may be a suitable answer, but i don't know anything about what he's talking about 07:40:21 order yours today 07:40:22 don't delay 07:41:32 O. See the wiki page about [[FlogScript]] for some examples. I have done the anarchy golf challenges by myself and posted the codes on the wiki (because anarchy golf doesn't have FlogScript) 07:41:34 i suspect that perhaps, given the right goal, brainfuck and a small set of random characters might be surprisingly flexible 07:41:50 but i'm thinking like ~10 characters or something, otherwise you start to get lots of duplicates that can be used for something useful 07:41:54 what would the goal be? :\ 07:42:05 myndzi: Probably with the right goal that might be correct. But it tells to wait see what it is. 07:42:26 quine 07:42:26 :D 07:42:31 haha you read my mind 07:42:47 but i got bogged down wondering if a brainfuck quine is even possible 07:42:52 I think I saw one once 07:42:53 oh 07:42:56 hmm 07:43:06 A brainfuck quine is possible. Not in only ten characters though! 07:43:09 http://esoteric.sange.fi/brainfuck/bf-source/quine/ ? 07:43:30 i'm sure it is, after all it's turing-complete rite? 07:43:40 i was just trying to think "how?!" 07:43:41 Yes 07:44:12 anything you can do in a higher level language you can do in brainfuck as well 07:44:18 just in a muuuch lengthier way 07:44:39 And there are compilers into brainfuck, such as [[BrainClub]] 07:44:41 Delete files. 07:44:48 ah! here's the idea i was thinking of 07:44:57 i'm a little slow 'cause i'm tired now 07:45:03 but you ever see those math puzzles that are like 07:45:21 "using the numbers 2 3 4 5 and 6, with any combination of operators, give an expression that evaluates to 23"? 07:45:23 or whatever 07:45:29 one possibility is 07:45:29 Yes 07:45:40 supply a random collection of +s, -s, s 07:45:53 allow the user to place [] (or () etc maybe even) wherever they want 07:45:59 but require them to use all the +s and -s etc 07:46:12 (of course, there's always the trivial case of putting trash at the end, so what can be done about that?) 07:46:44 ok not () 07:46:46 require the last command to be a . ? 07:47:04 but there's no guarantee the program ever reaches that point 07:47:09 perhaps require the program to terminate 07:47:21 for example, bf joust could be modified thusly: 07:47:27 no "lose if you run off the tape" rule 07:47:37 you must set their flag to 0 and terminate 07:47:48 I think you can provide a lot of characters if you make the probabilities right. 07:48:03 30, but in all likelihood 20 of them will be +'s and -'s. 07:48:03 so the task then becomes 07:48:14 to arrange the +-<> set to accomplish your task 07:48:20 by placement of those and [] 07:48:43 i don't think it'd work to force them to use a pre-supplied string of +-<> :P 07:48:48 Another idea: You have a brainfuck program without brackets, the puzzle is that you must then add the brackets to make a certain output. 07:48:48 but maybe you supply a random string of +- 07:48:57 and the person has to use them to accomplish the goal 07:49:13 zzo38: Now THAT'S interesting 07:49:38 so like +-++++-------++----++-+---++++, but you add <> [] wherever you want 07:49:40 Of course this puzzle I made is only a one player game, you aren't competing against anyone 07:49:43 but possibly longer 07:49:50 (probably longer) 07:49:58 and maybe use a restricted value set, instead of 256 values, 16 07:50:24 i don't know if that's even solvable quite yet but i think with enough <>s it probably is 07:51:12 the placing-brackets problem reminds me of some puzzle but i can't put my finger on it 07:51:17 -!- zzo38 has quit ("bed (will read logs)"). 07:51:27 he's got the right idea, lol 07:51:42 i don't think i've /quit properly in years 07:52:18 So have we approached an actual game here? :P 07:52:24 i have no idea 07:52:42 we've got a lot of ideas going 07:52:45 which is productive 07:57:43 -!- myndzi\ has joined. 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:15:44 -!- myndzi has quit (Read error: 110 (Connection timed out)). 08:20:29 Hmmmm 08:20:48 do tell 08:20:56 The more I think about it, the less specific I get. 08:26:50 Now I'm thinking something like FYB without the loops, you insert the loops. 08:26:56 But I'd like to have a poker-esque trade phase. 08:26:59 -!- Gracenotes has quit (Read error: 54 (Connection reset by peer)). 08:27:56 (And I can't think of how to do that with the given-program add-brackets idea) 08:28:05 -!- Gracenotes has joined. 08:29:46 Also, FYB requires you do some fairly specific things to place a bomb, and that's counterproductive. 08:30:40 yeah 08:36:57 The goal really buggers up everything :P 08:37:38 GolfScript may be a good start. 08:39:59 -!- myndzi\ has quit (Read error: 113 (No route to host)). 08:45:41 Here's a thought: You're given some numbers and operators, and you have to form them into a RPN "program". The goal is to have the most prime factors. 08:46:22 or some other arbitrary criteria? 08:46:36 Sure, that's an example crieteria. 08:46:42 *criteria 08:46:51 biggest prime number 08:47:05 That would be fekking difficult :) 08:47:10 -!- lereah_ has joined. 08:48:19 just have mathematica open while you work 08:48:49 I can't, it's on a timer! 08:48:52 Anyway, good basic idea? Maybe add functions for giggles? 08:49:01 hehe 08:49:09 maybe one operator is always a randomly generated functino 08:49:09 * lereah_ looks at logs 08:51:56 -!- oerjan has joined. 08:54:55 How do I put on a little hat on a character in LaTeX? 08:54:58 ^, that is* 08:55:22 \hat{} iirc 08:56:02 also there was \widehat{} for putting it on something huge :) 08:56:21 (i'm more sure of the latter than the former) 08:58:16 My execution trace is >+++++++++>--------->+++++++++>--------->>>>>[---[+]]>[---[+]+++++++++>--------->+++++++++>--------->>>>>[>[>[---[+]+++++++++>--------->+++++++++>--------->> 08:58:25 Thx 08:58:31 oerjan: That's long fixed :P 08:58:35 that looks wrong for (>(+{>}-)%9)*2(>)*5([---[+]]>)*21 08:58:37 But I just need a regular sized hat 08:58:37 ok 08:58:57 lereah_: yeah \widehat expands as needed i think 08:59:55 GregorR-L: btw i was thinking you could do ()* and ({})* without expansion by keeping a counter for each () pair (which may be allocated globally or in a stack manner) 09:00:29 RPokerN idea: Every player has chips, they start with 15. They can deal themselves into a round, and are given 15 numbers or operators. The chances are: 1/2 number, 1/2 operator. Of numbers, the probability is 15% 1, (1-15%)*15% 2, etc etc up to maybe 16. The operators are *, +, - and /. The probabilities are 36% /, 27% +, 27% -, 10% *. 09:00:31 basically ( sets the counter initially, { decrements and jumps back unless zero, etc. 09:01:03 It costs 1 chip to be dealt in. At this point players are given an opportunity to ante up or fold, as in poker. 09:01:26 } does nothing, ) increments and jumps back to } unless equal to target value 09:01:45 Once everybody has seen the bet and not raised, the programs are won and the pot is divided by who did the "best". 09:01:58 and with this, [] works automatically 09:02:28 (for pure (), ) decrements instead of incrementing) 09:02:30 what if you have [] spread across different kinds of (){}s? 09:03:03 and it should still be fast in C 09:03:34 btw gregorR-L, why not determine the distribution of number tokens using Benford's law? http://en.wikipedia.org/wiki/Benford%27s_law 09:03:46 I guess it doesn't particularly matter though 09:03:59 I was thinking e.g. '*' is too useful for highest-primes. 09:04:02 Erm 09:04:06 For most-prime-factors rather. 09:04:21 what about ^? ;) 09:04:25 duplicate all your prime factors 09:04:33 lawl :P 09:06:09 an alternate similar game 09:06:21 would be to be given a set of numbers and usable operators 09:06:28 and to make it equal a number given upfront 09:06:31 first person to answer wins 09:06:43 Well that's not similar at all :P 09:06:51 yeah I guess 09:08:07 GregorR-L: of course i now find myndzi already said that, as well 09:08:24 oerjan: Not exactly, but similar. 09:10:28 GregorR-L: well, we have increments and decrements reversed :D 09:10:59 but that's not important, you don't get to check only for 0 in either option 09:11:14 *with 09:12:06 haha I just noticed 09:12:17 every single program on the hill that isn't mine is on exactly -1 overall 09:12:27 I think it's because the hill is evenly split between two types of program 09:12:34 defends and...non-defends :P 09:12:40 lawl 09:13:29 defend6 and defend6aparody even get exactly the same matchups 09:15:59 Patashu: well ais523 claims it's paper/rock/scissors so someone should add some of whatever is the third type 09:16:46 "fool" 09:16:50 unless this has happened because someone found something to break the p/r/s balance 09:16:59 I was thinking yeah 09:17:01 that it's only metastable 09:17:16 !bfjoust fooled_again [>[-(.)*64]-] 09:17:16 how well a program does on the hill is determined by how many programs that counter it are present 09:17:20 Score for GregorR-L_fooled_again: 9.0 09:17:21 or rather how powerful the programs it kills are 09:17:22 :P 09:17:47 it beats defend8 though 09:17:47 o.O 09:17:51 what's up with that y 09:17:56 Who knows 09:18:06 i suppose if someone flooded it with ... attackers, is that it, then the fools could have been wiped out 09:18:15 and then the defenders remain at the top 09:18:33 (well, one defender, by what you said) 09:18:51 anything that can beat both lazy and waiter will soar right to the top 09:18:57 oh you said even split 09:19:50 -!- myndzi has joined. 09:19:58 so, your program breaks the balance by beating two types? 09:20:02 the point system values programs that counter the most valued programs which is determined by countering the most valued programs... 09:20:23 value isn't constant, it's determined by the hill's makeup at that point in time 09:20:28 Yeah 09:20:32 since programs aren't just better and worse, they also have matchups 09:20:33 which is interesting 09:20:49 if the hill never kicked members off, it would give a much better representation 09:20:53 with roughly equal programs of all kinds at all times 09:20:58 i had a crazy idea that maybe the hill could be divided into separate ecosystems... 09:21:01 haha 09:21:02 yeah? 09:21:09 I could up the limit if people'd like. 09:21:15 20? 30? 50? 09:21:30 with only rare interaction, so that they could evolve into different balances 09:21:42 GregorR, 20^30^50 09:21:47 AnMaster: Yeaaaaaaaaaaaah no. 09:21:53 well 09:21:58 are there any disadvantages to having large hills 09:21:58 (and I haven't yet checked what this discussion was about, bbl too) 09:22:04 besides the cost of running bigger matchups? 09:22:07 Patashu: Takes longer to run a new program. 09:22:11 only twice as long 09:22:14 and it's p. fast right now 09:22:25 Exactly why that's OK now :P 09:22:52 So gimme a number. 09:22:58 or, you could have divisions 09:23:02 divisions? 09:23:09 like with sports teams 09:23:31 well, try 20 gregor 09:23:41 a number of lower hills whose members compete to get on the top hill 09:24:06 hmmm 09:24:09 if you have a program on top of the hill 09:24:19 you can weaken it by introducing something that counters it but nothing else 09:24:28 and it'll only be on the top as long as the first program remains 09:24:41 could you drag down a winner like that? 09:25:00 OK, it's at 20 now. 09:25:39 'k 09:25:39 !bfjoust rushpolarity >(+)*10>(-)*10>-->++(>)*5((+)*8[+[-]]+.--.++>(-)*8[-[+]]+.--.++>)*11 09:25:43 Score for Patashu_rushpolarity: 64.0 09:25:44 !bfjoust matador >-[]<(++-)*1000.(--+)*1000(>)*9(>[+][-])*21 09:25:48 Score for Patashu_matador: 14.5 09:26:33 -!- myndzi has quit (Read error: 60 (Operation timed out)). 09:27:38 !bfjoust nop < 09:27:42 Score for Patashu_nop: 6.6 09:27:45 :o 09:28:18 oh, it didn't tie anything 09:28:19 thank goodness 09:28:44 I'm ... not sure why its score is non-zero ... 09:28:47 !bfjoust really_nop . 09:28:51 Score for GregorR-L_really_nop: 8.3 09:28:55 XD 09:30:05 it has ties and...a win? 09:30:06 my god 09:30:22 two wins 09:30:29 oh one of them's again < 09:30:31 but it beats shade? 09:31:01 lawl 09:31:57 -!- oerjan has quit ("leaving"). 09:32:00 !bfjoust simple (>)*9([-]>)*20[[-][+]] 09:32:04 Score for Patashu_simple: 32.1 09:32:25 the formatting breaks for x.y scores 09:32:29 as opposed to xx.y 09:35:04 Sometimes, not always. 09:35:07 Tabs suck. 09:35:50 tabssss 09:37:58 Heh, I added a bunch of impomatic's back, and now ehird_defend8 is at the top :P 09:38:15 haha 09:38:17 lazy and waiter are still doing pretty well though. 09:38:30 I've been trying to think of a fixed point algo for score, but nothing comes to mind. 09:40:05 the bigger the hill is the more accurate it ought to be 09:40:14 there isn't really an objective metric of how good a program is 09:41:59 Yeah, and I like my score, it would just be tastier if it was a fixed point algo :P 09:42:57 (wins-losses)/number of characters in source 09:42:57 :P 09:43:30 Intriguing :P 09:43:42 down with defend#s once and for all 09:45:31 but yeah if you want to prune your hill a different way you could give more points to fast wins/slow wins/short programs/number of loops executed? 09:45:54 just to be interesting 09:45:59 There's all sorts of score possibilities. 09:58:02 !bfjoust train (>-)*8>>+[[-][-]>+] 09:58:06 Score for Deewiant_train: 32.7 10:01:56 -!- GreaseMonkey has joined. 10:03:22 yo 10:04:11 -!- myndzi has joined. 10:06:02 wb 10:08:41 !bfjoust boring (++--+-++--)*100000 10:08:45 Score for Asztal_boring: 44.0 10:10:11 * GregorR-L wurves the +/-/0 landscape. 10:10:48 how is it that you can win without attacking your opponent's flag? 10:11:16 The other program runs off the tape 10:11:28 yes, your train seems to do that 10:11:34 what is the win condition exactly? 10:11:40 http://esolangs.org/wiki/BF_Joust 10:12:29 Win conditions: 1) Your program parses and the other doesn't. 2) Your program doesn't run off the tape and the other does. 3) The other program's flag remains 0 for two turns. 10:12:39 oh I see 10:12:56 killing yourself isn't noping forever, it's losing 10:13:02 so . is a stronger program than < 10:13:13 !bfjoust simpleton [[[-]-]-] 10:13:17 Score for GregorR-L_simpleton: 9.0 10:13:28 !bfjoust boring-loop [++--+-++--] 10:13:31 Score for Deewiant_boring-loop: 31.0 10:13:42 O_O 10:13:42 ACK 10:13:49 what 10:13:50 ACK? 10:13:52 SYN 10:13:54 lol 10:13:56 was about to say 10:13:56 damn you 10:14:04 :-P 10:14:35 oh no 10:14:39 I have no permission to access report.txt 10:14:59 also it's not storing all the programs 10:15:09 That'd be the ACK, I guess 10:15:10 I see only 10 10:15:10 yeah 10:15:11 XD 10:15:19 It was supposed to be the best 10 10:15:23 Plus the latest 10:15:27 he uped it to 20 10:15:30 But he was... yeah 10:15:31 but not properly it seems 10:15:34 Yeah :-P 10:15:43 Hence ACK 10:15:53 I accidentally wonked out that report.c X_X 10:16:03 This is what I get for making changes on the server instead of my local hg repo. 10:17:25 Fixdlawl 10:17:38 Sorry, you'll have to readd those. 10:17:42 !bfjoust simpleton [[[-]-]-] 10:17:46 Score for GregorR-L_simpleton: 11.5 10:17:54 readd everything? 10:18:06 !bfjoust train (>-)*8>>+[[-][-]>+] 10:18:07 No, just the last two. 10:18:10 Score for Deewiant_train: 34.6 10:18:11 !bfjoust boring-loop [++--+-++--] 10:18:13 Just since simpleton. 10:18:15 Score for Deewiant_boring-loop: 23.3 10:19:52 -!- EgoBot has quit (Remote closed the connection). 10:20:03 The server's repo is in a bad state, gimme a minute to fix. 10:20:15 boring-loop has quite a defeatist attitude :) 10:21:09 !bfjoust boring-loop2 >+[<++--+-++-->--] 10:21:20 Oh, right 10:21:27 Well, that's a bit less defeatist 10:21:35 Although not necessarily as effective :-P 10:21:46 -!- EgoBot has joined. 10:21:56 say when 10:22:03 actually, I was thinking that it would just stop once someone got the flag to 0, but it should only do that 1 in 10 times 10:22:03 When EgoBot rejoins is when :P 10:22:11 !bfjoust boring-loop2 >+[<++--+-++-->--] 10:22:16 Score for Deewiant_boring-loop2: 19.8 10:22:17 !bfjoust juggernaut +(>(-)*128)*29 10:22:21 Score for Patashu_juggernaut: 8.9 10:22:27 hmm 10:22:44 !bfjoust juggernaut +(>(-)*128.-.-.+++)*29 10:22:48 Score for Patashu_juggernaut: 44.2 10:22:50 You'll be running off the end often 10:22:51 oh ho :) 10:22:53 I will 10:22:54 that's okay 10:22:55 O_o 10:23:25 !bfjoust juggernaut +(>(-)*128.-.-.+++.+.-)*29 10:23:29 Score for Patashu_juggernaut: 38.2 10:23:35 !bfjoust juggernaut +(>(-)*128.-.-.++)*29 10:23:39 Score for Patashu_juggernaut: 42.4 10:23:49 !bfjoust juggernaut +(>(-)*128.-.+.-.-.+.+)*29 10:23:52 Score for Patashu_juggernaut: 42.4 10:24:02 !bfjoust juggernaut +(>(-)*128.-.-.+++)*29 10:24:06 Score for Patashu_juggernaut: 42.4 10:24:09 hmm :) 10:24:14 Expecting something different? :P 10:24:20 can't hurt to try 10:24:32 I mean can you really write off -anything-? 10:25:09 I think 20 is a good number for the hill btw 10:25:17 any larger and it gets harder to look at the grid and make sense of it 10:25:19 maybe 10:25:53 !bfjoust jug_or_not >+[>(-)*128] 10:25:57 Score for GregorR-L_jug_or_not: 25.2 10:26:40 !bfjoust juggernaut +(>)*8(>(-)*128.-.-.+++)*29 10:26:44 Score for Patashu_juggernaut: 47.6 10:27:18 !bfjoust juggernaut +(>->+)*4(>(-)*128.-.-.+++)*29 10:27:21 Score for Patashu_juggernaut: 45.3 10:27:32 !bfjoust jug_or_not [[-]+] 10:27:34 how can that do worse? weird 10:27:36 Score for GregorR-L_jug_or_not: 15.4 10:27:45 * GregorR-L keeps looking for a magic degenerate strategy :P 10:28:02 !bfjoust juggernaut +(>-->++)*4(>(-)*128.-.-.+++)*29 10:28:06 Score for Patashu_juggernaut: 52.8 10:28:08 !bfjoust jug_or_not [[(-)*10](+)*10] 10:28:11 Score for GregorR-L_jug_or_not: 22.9 10:28:29 Patashu: The scores are a bit random due to the variation in tape length 10:28:37 yeah 10:28:37 *nods* 10:28:50 does it do best of 5 or anything like that? 10:28:56 nope, one match 10:29:00 Actuall, egojoust is configured such that a run of any two programs will always produce the same result, as it "randomizes" based on their concatenated source code. 10:29:09 Two matches, actually. 10:29:10 really? hah 10:29:19 -!- Corun has changed nick to Corun|away. 10:29:26 I wanted the scores to be a bit more stable :P 10:29:29 system time not good enough for ya? 10:29:30 oh I see 10:29:43 means that a trivial variation can make a match different though 10:29:55 and you'll be all like 'hah now I got it' when in reality it has nothing to do with bfjoust as written 10:29:58 A trivial variation, as opposed to running it three seconds later. 10:30:16 best of 21? 10:30:16 :) 10:30:21 Plus, it's extremely unlikely to help you in ALL matches, it'll likely only help in one. 10:30:24 I considered that. 10:31:58 Plus, as ais said, the tape length really does rarely affect the outcome, it's more about weeding out degenerate strategies. 10:32:32 -!- myndzi has quit (Read error: 110 (Connection timed out)). 10:33:17 I wish all this interest in BF Joust would give FYB a bit of attention :P 10:33:23 :) 10:33:30 I might try FYB 10:33:34 harder? 10:34:11 More complex, written four years earlier. 10:34:16 Your "tape" is the other program. 10:34:34 http://codu.org/eso/fyb/README 10:35:24 The last FYB program I wrote, logicex-2, remains undefeated. 10:35:32 For four years X-P 10:36:21 !help 10:36:21 Supported commands: addinterp bf_txtgen bfjoust daemon daemons delinterp fyb help info kill mush userinterps 1l 2l adjust asm axo bch bct befunge befunge98 bf bf16 bf32 bf8 bfbignum boolfuck c chiqrsx9p choo cintercal clcintercal cxx dimensifuck echo echo_sh forth glass glypho google hello kipple lambda lazyk linguine malbolge notecho ook pbrain perl qbf rail rhotor rot13 sadol sceql sh show slashes test trigger udage01 underload unlambda whirl yodawg 10:36:30 aha, there's fyb 10:36:44 All this reporting infrastructure was made for FYB, and ported to BF Joust. 10:36:57 yeah I recognized it 10:38:29 what's 'yodawg'? 10:38:55 Yo dawg we heard you like strings, so we put a string "Hello world!" in your program 10:39:01 I don't even know 10:39:35 They should all be on the esolangs wiki *shrugs* 10:40:21 'yo dawg' no matches, 'yodawg' no matches 10:40:26 (as a search on esolangs) 10:41:05 !userinterps 10:41:06 Installed user interpreters: bct bfbignum chiqrsx9p choo echo echo_sh google hello ook rot13 slashes yodawg 10:41:13 Aha, it's a userinterp 10:41:16 Type !show yodawg 10:41:21 !show yodawg 10:41:22 unlambda (sending via DCC) 10:41:38 !delinterp echo_sh 10:41:38 Interpreter echo_sh deleted. 10:41:40 oh 10:41:43 unlambda? 10:41:57 unlambda is the language that the userinterp is written in. 10:42:12 aah 10:42:12 The interpreter itself should have been sent over DCC 10:42:27 !show google 10:42:27 bf +++++++++++++++[>+++++++>+++++++>++++>+<<<<-]>-.++++++++++++..----.>>--.-----------..<--.++++++++..--------.<----.>--.>-.<--.<+++.--.>>+.<<++++++.>++.----.<-.>++.+++++.>++++++++++++++++.<<-.>>--.,[>[-]>[-]<<[>+>+<<-]>>>[-]++++++++[<---->-]<[[-]>+<]>-[<<[-]>+++++++[<++++++>-]<+>>[-]]<<.[-]<,] 10:42:37 !google 2 10:42:38 http://google.com/search?q=2 10:42:41 neat 10:42:58 !show bfbignum 10:42:59 bf (sending via DCC) 10:43:03 !google was just a joke, mostly, since that's how I often respond to questions :P 10:43:04 http://google.com/search?q=was+just+a+joke,+mostly,+since+that's+how+I+often+respond+to+questions+:P 10:43:11 Ah, but does it URL-encode properly? 10:43:14 !google %20 10:43:14 http://google.com/search?q=%20 10:43:19 Nope ;-P 10:43:20 No, only spaces to + 10:44:06 -!- myndzi has joined. 10:44:11 -!- Corun|away has changed nick to Corun. 10:45:24 hmm, maybe an interesting FYB program would, instead of placing bombs in the opponent's code, place lots of :s, *then* place a bomb 10:45:42 welly 10:45:47 you have !fyb to test what you like 10:47:08 I do... I suspect my attempts will fail until I have a little more experience anyway 10:47:23 Doesn't hurt to try ^^ 10:47:43 You can always /msg, go to #egobot or go to #fyb for more privacy. 10:48:54 hm 10:49:19 GregorR-L, why not rewrite that bf program to properly url encode :D 10:49:31 no u 10:50:13 wouldn't that be 10:50:15 extremely complicated? 10:50:31 since they're on an arbitrary bijunction 10:50:33 I think 10:50:37 Patashu, I would use a "to-bf" compiler 10:50:42 if I had to do it 10:50:49 such as pebble or so I guess 10:50:59 that's not really writing bf is it :) 10:51:11 Patashu, as a base only :P 10:51:13 I used bf_txtgen to get the http://google.com/search?q= part :P 10:51:38 GregorR-L, esotope-bfc optimises it quite well btw 10:52:52 GregorR, http://pastebin.com/de087ecd 10:53:50 -!- Corun has quit ("Leaving..."). 10:53:59 # 10:53:59 p[5] += 7; 10:53:59 # 10:53:59 p[4] += ((6*p[5])+1); 10:54:01 p[5] += 7; p[4] += ((6*p[5])+1); p[5] = 0; <-- seems bad. Wouldn't p[4] += ((6*(p[5]+7))+1); p[5] = 0; be better hm 10:54:02 Can't optimize that? 10:54:03 Heh 10:54:09 GregorR, not yet I guess. 10:54:24 GregorR, it still does a fairly good job IMO 10:54:33 Absolutely, I'm just being an ass :P 10:56:12 GregorR, ideally it should of course turn it into a "while(!feof(stdin)) { char c = getchar(); if (c == ' ') putchar('+'); else putchar(c); } 10:56:13 ;P 10:56:35 but that would be as close to impossible as makes no difference 10:58:58 -!- GreaseMonkey has quit ("YES -> thor-ainor.it <- THIS IS *DELICIOUS*!"). 11:00:35 -!- jix has joined. 11:01:15 GregorR, current state of in-between: http://pastebin.com/m311cd601 (and yes I haven 11:01:22 haven't had time to work on it for some days) 11:33:40 -!- nooga has joined. 11:36:50 * AnMaster wonders if it would be possible to write a bf compiler or interpreter in make 11:38:36 make? 11:39:11 also, does anyone here also hang out in golf.shinh.org? 11:43:44 -!- KingOfKarlsruhe has joined. 11:46:43 -!- myndzi\ has joined. 11:50:46 -!- myndzi has quit (Read error: 113 (No route to host)). 12:13:34 I wonder, since the O's are considered for worst case scenarios 12:13:56 Are programs using random things considered O(infinity)? 12:14:30 anything that sometimes enters an infinite loop is O(infinity) yes 12:15:02 no one would seriously suggest an algorithm that sometimes loops forever though XD so you never see it written out like that 12:15:15 I... I sort of did :( 12:15:23 go on? 12:15:55 It's a program that generates a random energy, but the result is only accepted if it's under the max energy 12:16:00 Otherwise, it loops back on 12:16:21 For some reason, if I do more than 47 iterations of the experience, it starts taking forever 12:16:29 esolang or regular lang? 12:16:35 Regular lang 12:16:37 usually there's a function to generate a random number within a range 12:16:38 I be at work 12:16:43 I know python, java, visual basic has one 12:16:56 They're not just random numbers 12:17:03 They're random numbers on a particular distribution 12:17:20 I can't use regular random functions 12:17:25 aah 12:17:47 is it a self-similar distribution? 12:17:57 wat 12:18:01 no wait 12:18:02 Self similar? 12:18:02 that wouldn't work sorry 12:18:07 Looking like itself? 12:18:14 Most things look like themselves 12:18:25 it's when you can find copies of the whole within the whole 12:18:26 like fractals 12:18:39 if you can zoom in on part of the distribution curve and it looks like the whole distribution curve that would be self similar 12:18:41 but I'm not sure if that's helpful 12:19:43 It's a gaussian distribution 12:20:14 Code is : http://pastebin.com/m5c424cd8 12:20:16 (it uses root) 12:20:55 So far, it takes forever, but if you change exp=48 to something less than that, it takes under a minute 12:21:00 I don't know why* 12:21:32 I can't even find out where it's stuck, though I can guess, because root is shitty with i/o 12:21:49 Pretty sure it's stuck on : 12:21:50 hmm 12:21:51 # 12:21:51 do 12:21:51 # 12:21:51 {Ep = f1->Gaus(0.5*TMath::Log(E/0.2),1); 12:21:51 # 12:21:52 Ep = (E0)*TMath::Exp(-Ep);} 12:21:54 # 12:21:56 while(Ep>E || Ep<0); 12:22:00 why would you need a capped gaussian distribution 12:22:02 specifically? 12:22:07 Science reasons. 12:22:18 (Conservation of energy) 12:23:33 It's weird, though 12:23:50 Wait, maybe my condition of 0 energy is too low 12:23:54 -!- myndzi\ has quit (Read error: 113 (No route to host)). 12:23:56 -!- myndzi has joined. 12:24:04 And it found an energy really too low for him to generate easily 12:24:38 Yeah, it was that 12:24:41 -!- impomatic has joined. 12:24:46 Hi :-) 12:25:02 Hai 12:25:10 yo 12:25:19 -!- lereah_ has left (?). 12:25:22 -!- lereah_ has joined. 12:25:25 Has the size of the BF Joust hill been increased? It looks like it now records previous reports too 12:25:36 size 20 and fast 12:25:43 and keeps a log of reports 12:25:54 :-) 12:28:06 I'm having surprising success with my attempts 12:28:34 rushpolarity, lazy and waiter have all topped the hill 12:29:47 gonna try this one again 12:29:48 !bfjoust matador >-[]<(++-)*1000.(--+)*1000(>)*9(>[+][-])*21 12:29:52 Score for Patashu_matador: 18.5 12:30:04 nope it's not good as it is :) 12:30:05 hehe 12:37:56 !bfjoust spyglass (>(-)*9>(+)*9)*4(>(+)*10[-]++--[(---.)*9999])*21 12:38:00 Score for impomatic_spyglass: 66.0 12:38:21 now what does that do... 12:38:22 hmm 12:38:43 sets up decoys. -9+9-9+9-9+9-9+9 12:38:44 then... 12:38:57 one forward, +1, - until zero, plus plus minus minus 12:39:03 loop until it's zero: ---. 12:39:06 and do that for 21 cells 12:39:29 :-) 12:39:58 it's the attack itself that's important, let's see 12:40:28 what does once zero, ++-- then ---. repeat until zero do that's special 12:40:48 -!- myndzi has quit (Read error: 113 (No route to host)). 12:41:01 oh 12:41:08 if it's continually incerasing or decreasing it 12:41:11 ++ will beat -- and -- will beat ++ 12:42:17 then the ---. aah 12:42:21 will only trigger if the pointer is there as well 12:42:58 I don't think the ++-- really helps, but the [(---.)*9999] is supposed to help against programs which modify their own flag. 12:43:10 Unfortunately it doesn't seem to help much. 12:43:46 !bfjoust spyglass (>(-)*9>(+)*9)*4(>(+)*10[-])*21 12:43:49 Score for impomatic_spyglass: 60.9 12:44:01 what about doing -+--++---+++ 12:44:21 hmm 12:44:27 maybe something with nops 12:44:48 if you detect the cell to be 0 in the loop, when you end it a modifier will make it 1 or -1 12:45:02 so you can't push it back onto 0 unless they change direction 12:45:05 which you can't predict 12:45:15 so you'd have to trick them into hitting 0 on a wraparound? 12:45:40 !bfjoust spyglass (>(-)*9>(+)*9)*4(>(+)*10[-]+.[((-)*6.)*9999])*21 12:45:44 Score for impomatic_spyglass: 5.8 12:45:56 !bfjoust spyglass (>(-)*9>(+)*9)*4(>(+)*10[-]+.-[((-)*6.)*9999])*21 12:46:00 Score for impomatic_spyglass: 55.7 12:46:37 !bfjoust spyglass (>(-)*9>(+)*9)*4(>(+)*10[-]++--[(--.)*9999])*21 12:46:40 Score for impomatic_spyglass: 55.4 12:46:50 !bfjoust spyglass (>(-)*9>(+)*9)*4(>(+)*10[-]++--[(---.)*9999])*21 12:46:53 Score for impomatic_spyglass: 64.5 12:47:07 Hmmm... 12:47:48 with defenders as only 1/5th of the hill now 12:47:56 the defender-smashers are dropping 12:48:05 i.e. creep :) 12:49:02 -!- myndzi has joined. 12:49:17 btw 12:49:23 does the size of the decoys matter? 12:49:39 what kind of attack would smash decoys that are +1 OR -1 for instance 12:49:46 Depends on the opponent :-) 12:50:39 -!- KingOfKarlsruhe has quit (Remote closed the connection). 12:50:45 +[-] gets through +1 -1 decoys. ++[-] for -1, -2, 1, 2 decoys. Etc 12:51:16 -!- oerjan has joined. 12:51:22 ooh 12:51:24 I get why that works 12:53:53 !bfjoust juggernaut +(>(-)*128.-.+.)*29 12:53:57 Score for Patashu_juggernaut: 42.4 12:54:12 !bfjoust juggernaut +(>(-)*128.--++)*29 12:54:15 Score for Patashu_juggernaut: 48.6 12:54:55 !bfjoust juggernaut +(>(-)*128.--.++)*29 12:54:58 Score for Patashu_juggernaut: 38.8 12:55:08 !bfjoust juggernaut +(>(-)*128.--++.-+\)*29 12:55:11 oops haha 12:55:12 Score for Patashu_juggernaut: 46.3 12:55:26 !bfjoust juggernaut +(>(-)*128.--++.-.+)*29 12:55:29 Score for Patashu_juggernaut: 42.4 12:55:50 !bfjoust juggernaut +(>(-)*126.--++)*29 12:55:54 Score for Patashu_juggernaut: 20.6 12:55:58 !bfjoust juggernaut +(>(-)*128.--++)*29 12:56:02 Score for Patashu_juggernaut: 48.6 12:56:03 back to this version I guess :) 12:58:35 !bfjoust ignite (>(-)*11)*4(>(+)*5)*5(>(+)*9[-][(+)*128(+.)*9999])*21 12:58:39 Score for impomatic_ignite: 54.8 13:00:26 !bfjoust lazy (>(+)*10>(-)*10)*2>(-)*10(>(+)*10)*2>(-)*10>((-.)*128>)*21 13:00:29 Score for Patashu_lazy: 39.1 13:01:03 !bfjoust lazy +>((-.)*128>)*29 13:01:07 Score for Patashu_lazy: 41.3 13:01:20 !bfjoust lazy >(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5>((-.)*128>)*21 13:01:23 Score for Patashu_lazy: 48.2 13:01:26 hmm 13:02:53 !bfjoust ignite (>(-)*10)*3(>(+)*4)*6(>[(+)*9[-][(+)*384(.-)*9999(.+)*9999(..+)*9999(.++)*9999(.+++)*9999]])*21 13:02:57 Score for impomatic_ignite: 41.6 13:03:28 !bfjoust ignite (>(-)*10)*3(>(+)*4)*6(>[(+)*9[-][(+)*384(.-)*9999(.+)*9999(..+)*9999]])*21 13:03:32 Score for impomatic_ignite: 53.7 13:06:28 !bfjoust waiter ((+++++++++.)*1024(---------.)*1024)*2(++.)*512(--.)*512(+-)*1024(>)*9((-.)*128>)*21 13:06:32 Score for Patashu_waiter: 17.2 13:06:40 hmm 13:06:41 !bfjoust waiter ((+)*10000(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:06:45 Score for Patashu_waiter: 42.9 13:06:56 !bfjoust waiter ((+.)*10000(-.)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:07:00 Score for Patashu_waiter: 9.4 13:07:04 no haha 13:07:15 !bfjoust waiter ((+)*10000(-)*10000)*2(+.)*5000(-.)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:07:19 Score for Patashu_waiter: 14.1 13:07:38 !bfjoust waiter ((+)*10000(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:07:42 Score for Patashu_waiter: 42.9 13:07:48 !bfjoust waiter ((+-)*10000(-+)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:07:51 Score for Patashu_waiter: 25.2 13:08:02 !bfjoust waiter ((+)*10000(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:08:05 Score for Patashu_waiter: 42.9 13:08:15 sorry if this is spammy, no one's talking about anything anyways 13:08:51 YOU ARE RUINING OUR MEDITATION 13:09:03 -!- MizardX has quit ("Dead pixels in the sky."). 13:10:12 oh yeah duh 13:10:21 I know why +.ing or -.ing your own flag is a bad idea now XD 13:10:51 !bfjoust waiter ((+)*10000(-)*10000.)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:10:55 Score for Patashu_waiter: 38.0 13:10:57 nope :( 13:10:59 hmm 13:11:06 !bfjoust waiter ((+)*10000.(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:11:10 Score for Patashu_waiter: 39.3 13:11:20 !bfjoust waiter ((+)*10000(-)*10000)*2.(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:11:24 Score for Patashu_waiter: 39.3 13:11:33 !bfjoust waiter .((+)*10000(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:11:38 Score for Patashu_waiter: 42.9 13:12:39 I don't seem to be coming up with anything particularly insightful 13:12:48 -!- Gracenotes has quit ("Leaving"). 13:16:07 Maybe you could work out what length decoys are best against the majority of programs on the hill. Should be easy by taking a quick look at their source. 13:16:19 Or alternatively which size decoy buster works best. 13:17:03 looking at programs huh? sneeaaakky 13:17:04 :P 13:23:29 -!- MizardX has joined. 13:27:39 !bfjoust lazy >(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5(>(-.)*128)*21[-]((-)*2048(+)*2048.)*2 13:27:42 Score for Patashu_lazy: 48.8 13:28:56 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*8[+[-]]+.--.++>(-)*8[-[+]]+.--.++>)*11 13:28:59 Score for Patashu_rushpolarity: 57.1 13:30:12 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*8[+[-]]+.--.++>(-)*8[-[+]]+.--.++>)*10[+[-]]+.--.++.-.+++.---[-][+[-][-[+][+] 13:30:15 Score for Patashu_rushpolarity: 52.1 13:30:24 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*8[+[-]]+.--.++>(-)*8[-[+]]+.--.++>)*11 13:30:27 Score for Patashu_rushpolarity: 57.1 13:30:43 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*8[+[-]]+.--.++>(-)*8[-[+]]+.--.++>)*10(+)*8[+[-]]+.--.++ 13:30:47 Score for Patashu_rushpolarity: 58.4 13:30:50 there we go 13:31:14 !bfjoust waiter ((+)*10000(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*9((-.)*128>)*21 13:31:16 oops 13:31:18 Score for Patashu_waiter: 44.0 13:32:02 !bfjoust waiter ((+)*10000(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*8(>(-.)*128)*20--.++.[-][+] 13:32:06 Score for Patashu_waiter: 37.7 13:32:11 D: 13:32:22 !bfjoust waiter ((+)*10000(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*8(>(-.)*128)*20 13:32:26 Score for Patashu_waiter: 44.0 13:32:44 !bfjoust waiter ((+)*10000(-)*10000)*2(+-)*5000(-+)*5000(+--)*2000(-++)*2000(>)*8(>(-.)*128)*20..-..+..-.+.-+--++ 13:32:47 Score for Patashu_waiter: 34.1 13:32:54 why does that make it do worse rofl 13:34:09 !bfjoust juggernaut +(>(-)*128.--++)*29(+)*128.[-][+][-[+][+[-](-)*128.(+)*128.(-+)*256 13:34:13 Score for Patashu_juggernaut: 38.2 13:34:21 !bfjoust juggernaut +(>(-)*128.--++)*29 13:34:25 Score for Patashu_juggernaut: 51.0 13:34:31 !bfjoust juggernaut +(>(-)*128.--++)*29.(+)*128.[-][+][-[+][+[-](-)*128.(+)*128.(-+)*256 13:34:35 Score for Patashu_juggernaut: 38.2 13:34:37 that's weird 13:34:39 !bfjoust juggernaut +(>(-)*128.--++)*29 13:34:43 Score for Patashu_juggernaut: 51.0 13:34:52 hmm okay 13:34:53 gonna stop 13:35:02 and see which program adding stuff on at the end makes it lose against *rubs brow* 13:35:59 beats: rushpolarity all defends shadow viper shade 13:36:02 !bfjoust juggernaut +(>(-)*128.--++)*29.(+)*128.[-][+][-[+][+[-](-)*128.(+)*128.(-+)*256 13:36:06 Score for Patashu_juggernaut: 38.2 13:36:23 now it loses to shadow and spyglass 13:36:24 hmm... 13:36:28 !bfjoust juggernaut +(>(-)*128.--++)*29 13:36:32 Score for Patashu_juggernaut: 51.0 13:36:37 I will meditate on this 13:36:39 and then destroy you 13:36:41 or w/e 13:38:03 nope I have no clue why 13:41:09 what on earth is shade doing. it is incredibly long 13:41:47 -!- myndzi has quit (Read error: 113 (No route to host)). 13:44:05 !bfjoust electrictrain (>-)*8>>+[[-][-]>+] 13:44:08 Score for Patashu_electrictrain: 27.5 13:44:10 oops sigh 13:44:54 !bfjoust train2 (>--)*8>>+[[-][-]>+] 13:44:58 Score for Deewiant_train2: 31.8 13:45:11 !bfjoust electrictrain (>(-)*10)*9([-][-]>+)*20 13:45:15 Score for Patashu_electrictrain: 22.4 13:45:17 nope heh 13:45:35 !bfjoust electrictrain (>(-)*10)*9([-][-]>)*20 13:45:39 Score for Patashu_electrictrain: 35.7 13:45:40 !bfjoust train2 (>--)*4(>++)*4>>+[[-][-]>+] 13:45:43 Score for Deewiant_train2: 34.6 13:45:49 !bfjoust electrictrain (>(-)*2)*9([-][-]>)*20 13:45:52 Score for Patashu_electrictrain: 26.0 13:45:54 !bfjoust electrictrain (>(-)*3)*9([-][-]>)*20 13:45:57 Score for Patashu_electrictrain: 28.8 13:46:01 !bfjoust electrictrain (>(-)*12)*9([-][-]>)*20 13:46:03 hmm :o 13:46:05 Score for Patashu_electrictrain: 28.8 13:46:13 !bfjoust electrictrain (>(-)*10)*9([-][-][+]>)*20 13:46:17 Score for Patashu_electrictrain: 35.7 13:46:42 !bfjoust train2 (>--)*4(>++)*4>>+([-][-][+]>)*8[[-][-]>+] 13:46:45 Score for Deewiant_train2: 16.3 13:46:50 O_o 13:46:57 !bfjoust electrictrain (>(-)*10)*9([-][+][-]>)*20 13:47:00 Score for Patashu_electrictrain: 29.1 13:47:04 choo choo bah 13:47:09 Hmm, right 13:47:10 !bfjoust electrictrain (>(-)*10)*9([-][-][+]>)*20 13:47:14 Score for Patashu_electrictrain: 38.8 13:47:14 !bfjoust train2 (>--)*4(>++)*4>>+([-][-]>)*8[[-][-]>+] 13:47:18 Score for Deewiant_train2: 24.4 13:47:25 Oh well 13:47:32 !bfjoust electrictrain (>(-)*10)*9([[-]]>)*20 13:47:37 Score for Patashu_electrictrain: 27.7 13:47:40 !bfjoust electrictrain (>(-)*10)*9([+[-]]>)*20 13:47:40 !bfjoust train2 (>--)*4(>++)*4>>([-][-]>)*8[[-][-]>+] 13:47:46 Score for Deewiant_train2: 17.5 13:47:46 Score for Patashu_electrictrain: 17.7 13:47:51 !bfjoust train2 (>--)*4(>++)*4>>+[[-][-]>+] 13:47:55 Score for Deewiant_train2: 31.0 13:47:56 Tch 13:47:57 !bfjoust electrictrain (>(-)*10)*9([-][-][+][+]>)*20 13:48:00 Score for Patashu_electrictrain: 37.1 13:48:39 electric trains are awesome 13:49:16 :-P 13:49:23 !bfjoust electrictrain (>(-)*10)*9([[-][-][+][+]]>)*20 13:49:26 Score for Patashu_electrictrain: 28.0 13:49:31 !bfjoust electrictrain (>(-)*10)*9([-][-][+][+]>)*20 13:49:34 Score for Patashu_electrictrain: 37.1 13:49:45 having to revert your entry is a pain 13:49:48 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+[[-][-]>+] 13:49:51 Score for Deewiant_train2: 46.8 13:49:54 Woot 13:50:09 This is so random :-P 13:50:10 oh 13:50:11 the decoys? 13:50:15 nah it makes underlying sense 13:50:17 on some level i'm sure 13:50:39 !bfjoust electrictrain (>(+)*10)*4(>(-)*10)*5([-][-][+][+]>)*20 13:50:43 Score for Patashu_electrictrain: 38.2 13:51:31 !bfjoust matador >-[]<(++-)*1000.(--+)*1000(>)*9(>[+][-])*21 13:51:35 Score for Patashu_matador: 19.0 13:51:40 !bfjoust matador >-[]<(+-)*1000.(-+)*1000(>)*9(>[+][-])*21 13:51:44 Score for Patashu_matador: 8.2 13:51:49 !bfjoust matador >-[]<(+)*1000.(-)*1000(>)*9(>[+][-])*21 13:51:53 Score for Patashu_matador: 10.8 13:51:57 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*30 13:52:01 Score for Deewiant_train2: 52.6 13:52:02 !bfjoust matador >-[]<(+++-)*1000.(---+)*1000(>)*9(>[+][-])*21 13:52:07 Score for Patashu_matador: 16.8 13:52:09 There we go 13:52:16 !bfjoust matador >-[]<(++-)*1000.(--+)*1000(>)*9(>[+][-])*21 13:52:20 Score for Patashu_matador: 19.5 13:52:21 Hmm 13:52:22 hmm why is this the optimum 13:52:23 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>])*30 13:52:27 btw 13:52:27 Score for Deewiant_train2: 10.0 13:52:29 O_o 13:52:32 don't make it do 40 >s in total ;) 13:52:34 Oh, right 13:52:38 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*30 13:52:42 Score for Deewiant_train2: 52.6 13:52:44 it should end before doing a 30th > 13:52:48 because that's an instant win for your enemy 13:53:02 right now it does 41 13:53:07 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*19 13:53:10 Score for Deewiant_train2: 24.4 13:53:16 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*20 13:53:20 Score for Deewiant_train2: 27.4 13:53:20 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*21 13:53:23 lol 13:53:24 Score for Deewiant_train2: 34.6 13:53:26 wth 13:53:26 :-) 13:53:28 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*40 13:53:32 Score for Deewiant_train2: 36.3 13:53:35 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*30 13:53:36 do 30 again?? 13:53:38 30 is a sweet spot 13:53:39 Score for Deewiant_train2: 52.6 13:53:46 oh 13:53:49 it might be skipping []s 13:53:53 Yep, it is 13:53:58 interesting 13:54:01 But still, more should be better :-P 13:54:10 keep in mind that > off the edge is instant loss 13:54:10 It just hits nice numbers on the randomizer now 13:54:16 but noping for all eternity might be a draw 13:54:21 Yeah, but there's no way of detecting that 13:54:28 not the way you set it up no 13:54:32 It's a train, it doesn't stop ;-) 13:54:39 It just keeps choo-chooing onward 13:54:40 haha 13:54:43 !bfjoust matador >-[]<(++-)*1000(--+)*1000(>)*9(>[+][-])*21 13:54:47 Score for Patashu_matador: 25.3 13:54:47 Unless the engine breaks down 13:54:51 oho 13:54:59 !bfjoust matador >-[]<(++-)*1000+(--+)*1000(>)*9(>[+][-])*21 13:55:02 Score for Patashu_matador: 19.5 13:55:03 !bfjoust matador >-[]<(++-)*1000-(--+)*1000(>)*9(>[+][-])*21 13:55:07 Score for Patashu_matador: 29.5 13:55:09 aha 13:55:10 -!- Taejo has joined. 13:55:18 why does it work? who knows 13:55:18 just accept it 13:55:27 !bfjoust taejo_simplexity (>->+)*5[[-]>-] 13:55:31 Score for Taejo_taejo_simplexity: 21.5 13:56:18 Err, did you even change anything between those last two 13:56:44 Oh, + -> - 13:56:47 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*10000(-)*10000(+-)*10000(-+)*10000(>)*8(>(-.)*128)*20 13:56:48 :-P 13:56:51 Score for Patashu_waiter: 42.9 13:57:07 !bfjoust boring (++--+->-<)*100000 13:57:12 Deewiant: when I last submitted the bot was broken 13:57:12 Score for Asztal_boring: 29.1 13:57:24 !bfjoust waiter ((++-)*50000-(--+)*50000)*2(+)*10000(-)*10000(+-)*10000(-+)*10000(>)*8(>(-.)*128)*20 13:57:28 Score for Patashu_waiter: 42.4 13:57:32 !bfjoust taejo_simplexity (>)*10[[-]>-] 13:57:36 Taejo: Sorry, that was directed at Patashu 13:57:36 Score for Taejo_taejo_simplexity: 15.2 13:57:40 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*10000(-+)*10000(>)*8(>(-.)*128)*20 13:57:40 Didn't notice you in between there :-P 13:57:44 Score for Patashu_waiter: 47.1 13:58:00 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*50000(-+)*50000(>)*8(>(-.)*128)*20 13:58:02 !bfjoust boring (++--+-)*100000 13:58:03 Patashu: Stop lowering train2's score 13:58:05 Score for Asztal_boring: 28.0 13:58:05 Score for Patashu_waiter: 42.4 13:58:07 sorry :o 13:58:11 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*20000(-+)*20000(>)*8(>(-.)*128)*20 13:58:11 :-P 13:58:14 Score for Patashu_waiter: 43.5 13:58:19 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*10000(-+)*10000(>)*8(>(-.)*128)*20 13:58:22 Score for Patashu_waiter: 48.2 13:58:27 okay that's good 13:58:28 !bfjoust taejo_simplexity (>)*18[[-]>-] 13:58:32 Score for Taejo_taejo_simplexity: 16.5 13:58:48 !bfjoust boring (-)*100000 13:58:53 Score for Asztal_boring: 36.0 13:59:13 I guess a lot of them use [-][-] 13:59:24 !bfjoust taejo_simplexity (>)*10[[-][-]>-] 13:59:28 Score for Taejo_taejo_simplexity: 19.8 13:59:33 !bfjoust waiter (-)*100000((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*20000(-+)*20000(>)*8(>(-.)*128)*20 13:59:37 Score for Patashu_waiter: 27.1 13:59:40 nope :o 13:59:43 !bfjoust waiter (-)*10000((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*20000(-+)*20000(>)*8(>(-.)*128)*20 13:59:47 Score for Patashu_waiter: 37.7 13:59:48 !bfjoust taejo_simplexity >(+)*128(>)*9[[-][-]>-] 13:59:52 Score for Taejo_taejo_simplexity: 14.0 13:59:52 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*20000(-+)*20000(>)*8(>(-.)*128)*20 13:59:57 Score for Patashu_waiter: 41.8 14:00:30 !bfjoust sloth >(+)*128((++-)*1024(--+)*1024)*100([>[-]+])*100 14:00:35 Score for Deewiant_sloth: 0.0 14:00:39 Heh 14:01:02 !bfjoust sloth >(+)*128((++-)*1024(--+)*1024)*100>([>[-]+])*100 14:01:06 Score for Deewiant_sloth: 4.8 14:01:07 (+)*128 doesn't provide a particularly big advantage 14:01:14 it just needs to be bigger than the current largest decoy buster in play 14:01:26 (that is, some amount of +ing or -ing before a loop like [+]) 14:01:36 !bfjoust sloth >(+)*12((++-)*1024(--+)*1024)*100>([>[-]+])*100 14:01:41 Score for Deewiant_sloth: 0.0 14:01:44 haha 14:01:44 :-P 14:01:51 hang on 14:01:53 !bfjoust sloth >(+)*12((++-)*1024(--+)*1024)*100(>)*8([>[-]+])*100 14:01:58 Score for Deewiant_sloth: 0.0 14:02:01 what is that meant to do 14:02:01 !bfjoust sloth >(+)*12((++-)*1024(--+)*1024)*100(>)*8+([>[-]+])*100 14:02:05 Score for Deewiant_sloth: 0.0 14:02:08 take out the first > :) 14:02:10 try that 14:02:14 Sit around and then attack simply 14:02:17 !bfjoust sloth (+)*12((++-)*1024(--+)*1024)*100(>)*8+([>[-]+])*100 14:02:20 Score for Deewiant_sloth: 42.5 14:02:23 much better 14:02:23 :) 14:02:23 Meh 14:02:26 lol 14:02:29 Why would that matter so much 14:02:32 because 14:02:40 if the program uses a [] like structure to attack cells 14:02:50 if it sees 0 for one cell then it assumes 'oh, I'm done here' and moves to the next 14:03:06 but if you're altering it your flag can hit 0 and then bounce back off 0 from your efforts 14:03:10 Hmm, right, and if it sees 0 for the one next to the flag it kills the flag 14:03:11 while the unsuspecting program wanders off the tape's edge 14:03:17 And if you alter the flag... yeah 14:03:25 Still, I wouldn't expect it to be that much better :-P 14:03:42 it's one of the main strategies :) 14:03:53 of course it does much better than letting the enemy move onto your flag and attack it uncontested 14:03:53 haha 14:03:55 -!- lereah_ has left (?). 14:03:56 -!- lereah_ has joined. 14:03:59 :-D 14:04:17 !bfjoust sloth (+)*12((++-)*1024(--+)*1024)*100(>)*8([>[-]]+)*100 14:04:21 Score for Deewiant_sloth: 36.0 14:04:23 !bfjoust retreat (>-)*9([.]-[.]<)*9(++--+-++--)*100000 14:04:28 Score for Asztal_retreat: 9.8 14:04:30 !bfjoust sloth (+)*12((++-)*1024(--+)*1024)*100(>)*8([>[-]+]+)*100 14:04:33 Score for Deewiant_sloth: 36.0 14:04:35 !bfjoust matador >-[]<(++-)*1000-(--+)*1000(>)*9(>[+][-])*21 14:04:39 !bfjoust sloth (+)*12((++-)*1024(--+)*1024)*100(>)*8([>[-]+]>)*100 14:04:39 Score for Patashu_matador: 22.8 14:04:43 Score for Deewiant_sloth: 40.7 14:04:45 !bfjoust matador >+[]<(++-)*1000-(--+)*1000(>)*9(>[+][-])*21 14:04:49 Score for Patashu_matador: 30.5 14:05:00 !bfjoust matador >+[]<(++-)*1000+(--+)*1000(>)*9(>[+][-])*21 14:05:00 !bfjoust sloth (+)*12((++-)*1024(--+)*1024)*100(>)*8([>[-]+])*100 14:05:06 Score for Patashu_matador: 32.7 14:05:06 -!- myndzi has joined. 14:05:06 Score for Deewiant_sloth: 26.9 14:05:12 !bfjoust sloth (+)*12((++-)*1024(--+)*1024)*100(>)*8([>[-]+]>)*100 14:05:15 Score for Deewiant_sloth: 40.7 14:05:21 oh no :ohmy: 14:05:23 creep died 14:05:34 !bfjoust sloth (+)*12((++-)*1024(--+)*1024)*100(>)*8+([>[-]+])*100 14:05:38 Score for Deewiant_sloth: 40.7 14:07:05 !bfjoust sloth ((++-)*1024(--+)*1024)*100(>)*8+([>[-]+])*100 14:07:09 Score for Deewiant_sloth: 36.0 14:07:14 !bfjoust sloth (+)*128((++-)*1024(--+)*1024)*100(>)*8+([>[-]+])*100 14:07:18 Score for Deewiant_sloth: 31.9 14:07:19 !bfjoust sloth (+)*127((++-)*1024(--+)*1024)*100(>)*8+([>[-]+])*100 14:07:24 Score for Deewiant_sloth: 32.7 14:07:32 !bfjoust sloth (+)*12((++-)*1024-(--+)*1024)*100(>)*8+([>[-]+])*100 14:07:36 Score for Deewiant_sloth: 45.4 14:07:38 !bfjoust sloth (+)*12((++-)*1024+(--+)*1024)*100(>)*8+([>[-]+])*100 14:07:42 Score for Deewiant_sloth: 29.6 14:07:46 Heh 14:07:50 !bfjoust sloth (+)*12((++-)*1024-(-+-)*1024)*100(>)*8+([>[-]+])*100 14:07:54 Score for Deewiant_sloth: 29.6 14:07:58 find dat sweat spot 14:07:59 !bfjoust sloth (+)*12((+-+)*1024-(-+-)*1024)*100(>)*8+([>[-]+])*100 14:08:00 sweet 14:08:03 Score for Deewiant_sloth: 36.3 14:08:11 !bfjoust sloth (+)*12((+-+)*1024-(-+-)*1024+)*100(>)*8+([>[-]+])*100 14:08:14 Score for Deewiant_sloth: 40.7 14:08:28 !bfjoust sloth (+)*12((++-)*1024-(--+)*1024)*100(>)*8+([>[-]+])*100 14:08:32 Score for Deewiant_sloth: 45.4 14:08:36 This is just silly :-P 14:08:49 have you been looking at the other programs at all? 14:09:26 Not beyond from what's been pasted here, mostly only what's been pasted here in the last 30 minutes :-P 14:09:40 http://codu.org/eso/bfjoust/in_egobot/ read, learn, understand, know 14:10:24 Nah, that's cheating 14:10:38 nope 14:10:44 why are they posted publicly then? 14:10:53 As in, I consider it cheating :-P 14:11:08 Or something like cheating but not quite cheating, there may or may not be a good word for it 14:11:11 Unsportsmanlike 14:11:14 :-P 14:27:17 -!- leonid_ has joined. 14:30:11 to submit, it's !bfjoust program 14:30:16 it'll append your name to the start automatically 14:30:25 if the name matches a program's name it gets overridden 14:30:43 so for instance one of mine is 14:30:44 !bfjoust juggernaut +(>(-)*128.--++)*29 14:30:47 Score for Patashu_juggernaut: 47.9 14:31:33 how is the score evaluated? 14:31:43 it runs it against every other program on the hill 14:31:51 for each win, the more points that program had the more points you get 14:31:55 hmmm 14:32:02 !bfjoust juggernaut 14:32:03 Use: !bfjoust 14:32:11 !bfjoust butt + 14:32:14 lol 14:32:16 Score for lereah__butt: 10.5 14:32:20 so 14:32:23 even if you do nothing interesting 14:32:24 I have no idea what's going on 14:32:28 you can still get a few wins if you make programs fall off the edge 14:32:31 !bfjoust lols > 14:32:36 Score for leonid__lols: 11.5 14:32:41 hmmmm 14:32:43 !bfjoust butt [+] 14:32:47 Score for lereah__butt: 9.2 14:32:51 here's a short program that has the capability of winning 14:33:01 (>)*9([-]>)*21 14:33:11 the flag is between 9 and 29 cells away to start off 14:33:12 My butt is weak :( 14:33:17 so we move 9 tiles forward 14:33:38 and to win we have to blank the flag at some point. we can do this either way since 128 is equidistant from 0 in either direction 14:33:48 but [-], if the other pointer is not altering it at the same time, will decrement it until it is 0 then continue 14:34:04 so if that was the enemy's flag and they aren't changing it at the same time you win if you zero out their flag first 14:34:04 !bfjoust lols < 14:34:08 suicid 14:34:08 Score for leonid__lols: 3.0 14:34:48 !bfjoust butt [>] 14:34:53 Score for lereah__butt: 11.5 14:34:54 !bfjoust lols (>[-])*30 14:34:58 Score for leonid__lols: 16.8 14:35:13 I'm typing random things because I have no idea what's going on 14:35:18 !bfjoust lols (>[-])*9 14:35:23 Score for leonid__lols: 10.5 14:35:29 !bfjoust lols (>[-])*20 14:35:33 Score for leonid__lols: 19.5 14:35:39 !bfjoust lols (>[-])*20 14:35:42 Score for leonid__lols: 19.5 14:35:47 hmm 14:35:49 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*8[+[-]]+.--.++>(-)*8[-[+]]+.--.++>)*10(+)*8[+[-]]+.--.++ 14:35:49 am I spamming? 14:35:52 Score for Patashu_rushpolarity: 51.0 14:35:57 we're not talking about anything else go ahead 14:36:03 !bfjoust lols (>[-])*15 14:36:07 Score for leonid__lols: 11.5 14:36:08 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*8[[+][-]]+.--.++>(-)*8[[-][+]]+.--.++>)*10(+)*8[+[-]]+.--.++ 14:36:10 !bfjoust lols (>[-])*18 14:36:13 Score for Patashu_rushpolarity: 44.9 14:36:14 Score for leonid__lols: 11.0 14:36:18 !bfjoust lols (>[-])*19 14:36:22 Score for leonid__lols: 19.5 14:36:26 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*10[+[-]]+.--.++>(-)*10[-[+]]+.--.++>)*10(+)*8[+[-]]+.--.++ 14:36:30 Score for Patashu_rushpolarity: 56.2 14:36:34 oho 14:36:47 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*12[+[-]]+.--.++>(-)*12[-[+]]+.--.++>)*10(+)*8[+[-]]+.--.++ 14:36:51 Score for Patashu_rushpolarity: 47.6 14:36:56 nope 10 is a sweat spot apparantly 14:36:56 haha 14:37:02 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*11[+[-]]+.--.++>(-)*11[-[+]]+.--.++>)*10(+)*8[+[-]]+.--.++ 14:37:07 Score for Patashu_rushpolarity: 49.9 14:37:09 oops I keep saying sweat spot 14:37:13 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*10[+[-]]+.--.++>(-)*10[-[+]]+.--.++>)*10(+)*8[+[-]]+.--.++ 14:37:17 Score for Patashu_rushpolarity: 56.2 14:37:19 back to the version that works best 14:38:05 !bfjoust lols ((+)*10(>[-])*19(<)*19)*10 14:38:35 .... 14:38:43 did i break it 14:38:47 wait for it 14:39:22 !help 14:39:22 Supported commands: addinterp bf_txtgen bfjoust daemon daemons delinterp fyb help info kill mush userinterps 1l 2l adjust asm axo bch bct befunge befunge98 bf bf16 bf32 bf8 bfbignum boolfuck c chiqrsx9p choo cintercal clcintercal cxx dimensifuck echo forth glass glypho google hello kipple lambda lazyk linguine malbolge notecho ook pbrain perl qbf rail rhotor rot13 sadol sceql sh show slashes test trigger udage01 underload unlambda whirl yodawg 14:40:09 lol 14:40:16 mmmm 14:40:33 why on earth would that break it *raisez eyebrow* 14:40:46 lol wow sry guys 14:40:48 !bfjoust suicide_is_your_only_option < 14:40:49 s'ok 14:41:08 !kill all humans 14:41:09 Daemon all_humans does not exist! 14:41:13 :( 14:41:17 don't you go around killing things 14:41:23 !kill Patashu 14:41:23 Daemon Patashu does not exist! 14:41:28 lolol 14:41:30 Dayum 14:41:45 !daemon 14:41:46 Invalid invocation. 14:41:50 !daemon Patashu 14:41:51 Invalid invocation. 14:41:55 !halp 14:41:59 halp lol 14:42:05 !help daemon 14:42:06 daemon: !daemon . Add a daemon to EgoBot. A daemon will run in the background, and accept a line of input every time ! is run. Note that daemons are only allotted one line of output for each line of input. 14:42:10 o 14:42:44 !daemon Patashu bf 14:42:44 !daemons 14:42:45 Running daemons: bottles butt 14:42:45 Daemon Patashu running. 14:42:50 !kill Patashu 14:42:51 Daemon Patashu killed. 14:42:56 TAKE THAT 14:42:59 whered my lols gone 14:43:02 Damn demon 14:43:08 where my lollers at 14:43:23 !bottles 1 14:43:32 !butt 1 14:43:37 :o 14:45:30 !hello h 14:45:31 Hello World 14:45:39 btw leonid 14:45:42 yea 14:45:43 http://codu.org/eso/bfjoust/in_egobot/ < programs currently on the hill 14:46:17 !sh kill 22653 14:46:18 /tmp/input.23677: line 1: kill: (22653) - Operation not permitted 14:47:08 hmmm 14:47:50 !fyb 14:47:50 Use: !fyb 14:47:53 let's play fyb while we wait 14:47:53 lol 14:47:57 wuts day 14:47:59 dat* 14:48:35 heard of corewars? 14:48:39 it's like that but brainfuckier 14:48:45 dunno about corewars 14:48:47 :( 14:49:24 http://codu.org/eso/fyb/ and readme 14:50:02 Score for Patashu_suicide_is_your_only_option: 2.8 14:50:02 Score for leonid__lols: 26.6 14:50:05 ah 14:50:06 here we go 14:50:09 finally lol 14:50:10 how long was that? 14:50:22 about 12 min 14:50:43 I queried him to let him know 14:50:53 maybe he'll fix the bug 14:50:55 or someone will fix it 14:50:57 !bfjoust lols ((+)*10(>[-])*10(<)*10)*2 14:51:05 you fool noooo 14:51:07 lol 14:51:10 lol 14:51:27 whyd it take so long 14:51:31 I have no idea 14:51:35 it might be a bug with < maybe 14:53:05 you are hereby banned from using < until you know better 14:53:05 XD 14:53:26 ugh 14:53:33 brb reading rules 14:53:43 have you ever looked at brainfuck code before? 14:53:55 i often write simple bf codes 14:53:58 also, tidbit: the ] check is considered a cycle 14:54:01 i very often bf songs too 14:54:08 so [+] is executed like +]+]+]... until the cell is zero 14:54:08 and 14:54:23 for loops it uses the value of the cell before the two programs take their turn for that turn 14:54:33 that won't matter unless both pointers are altering the same cell though 14:56:10 .... 14:56:17 whoa lol what did i just do 14:57:00 maybe i should change the code for the sake of etiquette lol 14:57:32 I'm almost certain it's the multiplied < 14:57:35 so just don't use that for now 14:57:39 okay 14:59:20 -!- myndzi has quit (Read error: 113 (No route to host)). 15:01:50 ..... 15:01:56 omg 15:04:08 D: 15:05:17 <_< 15:06:39 how long has it been this time 15:07:03 16 min 15:07:13 reduced the number of loops and still 15:07:37 i wonder what happens if I do +[] 15:07:49 *kicked* 15:08:02 You should get summarily beaten by all opponents :-P 15:08:05 yes 15:08:06 also 15:08:10 there's a 384000 cycle limit on a game 15:08:18 relief 15:08:36 and the game would end as soon as one of them suicides or a flag is 0 for consecutive cycles 15:08:47 you can't really lock up bfjoust...except through bugs I guess D: 15:08:47 lol 15:08:51 2 consecutive* 15:09:01 2 15:09:02 ya 15:09:06 Btw, does that mean one turn for both players after the flag is zero? 15:09:09 Or two turns? 15:09:24 flag is x, both players take turns, flag is 0 15:09:31 flag is 0, both players take turns, flag is 0 15:09:38 that would declare the game over 15:09:40 1 turn = 1 instruction for each player, they're run in parallel 15:09:50 So 1 turn for both after it's zero 15:10:21 ya 15:10:48 if you use [-] you're basically doing -]-]-]... so that handles the two cycle thing 15:10:56 but if you're using (-)*abignumber you're doing ----- 15:10:56 so you go right past 0 15:13:19 .... 15:13:21 20 min D: 15:13:39 super bug hunter leonid 15:13:42 !bfjoust woot ([>+)*5(])*5 15:13:43 lolol 15:13:53 i can make ruby segfault 15:13:58 how 15:14:02 leonid_: how? 15:14:02 by doing something wrong 15:14:12 aww egobot doesn't do ruby 15:14:14 but how 15:14:40 you figure it out 15:14:44 *puzzle* 15:14:56 never used ruby before 15:15:05 puts "Segmentation fault." 15:15:05 ? 15:15:09 not that 15:15:18 one day i misused Marshal 15:15:22 and it caused segfault 15:15:35 A BUG! >:@ 15:15:40 :D 15:26:09 !help addinterp 15:26:09 addinterp: !addinterp . Add a new interpreter to EgoBot. This interpreter will be run once every time you type ! , and receive the program code as input. 15:26:22 I wanna try something 15:27:12 hmm 15:27:15 does egobot do php or ruby? 15:28:04 !help 15:28:04 Supported commands: addinterp bf_txtgen bfjoust daemon daemons delinterp fyb help info kill mush userinterps 1l 2l adjust asm axo bch bct befunge befunge98 bf bf16 bf32 bf8 bfbignum boolfuck c chiqrsx9p choo cintercal clcintercal cxx dimensifuck echo forth glass glypho google hello kipple lambda lazyk linguine malbolge notecho ook pbrain perl qbf rail rhotor rot13 sadol sceql sh show slashes test trigger udage01 underload unlambda whirl yodawg 15:28:10 !help ruby 15:28:10 Sorry, I have no help for ruby! 15:28:12 !help php 15:28:12 Sorry, I have no help for php! 15:28:14 !help egobot 15:28:15 Sorry, I have no help for egobot! 15:28:20 !about 15:28:23 -!- lereah_ has quit (Remote closed the connection). 15:28:42 !c *0=1; 15:28:44 Does not compile. 15:29:04 !echo imsickofuprock 15:29:04 imsickofuprock 15:29:11 !c int* n; *n=0; 15:29:13 ./interps/gcccomp/gcccomp: line 52: 27871 Segmentation fault /tmp/compiled.$$ 2>&1 15:29:17 yay! 15:29:17 -!- myndzi has joined. 15:30:05 !help yodawg 15:30:05 Sorry, I have no help for yodawg! 15:30:16 !yodawg 15:30:16 Unexpected end of file 15:30:39 !yodawg 1!2@3#4$5%6^7&8*9(0)-_=+[{]}\\:;'",<..>/? 15:30:39 Unknown function: 1 15:30:42 hmm 15:30:43 !sh ps -l 25684 15:30:44 what is yodawg 15:30:47 it is a mystery 15:31:21 whoa 15:31:25 no result yet? 15:31:28 nope lol 15:31:30 how long now 15:31:33 40 min 15:32:35 Hmm 15:32:37 Signal 18 (CONT) caught by ps (procps version 3.2.7). 15:33:01 I thought SIGCONT couldn't be caught 15:37:24 -!- myndzi has quit (Read error: 60 (Operation timed out)). 15:41:27 * oerjan cackles evilly 15:41:52 imagine a world with no !bfjoust 15:41:54 :( 15:42:03 i killed it 15:42:17 silent stealth assassin of !bfjoust 15:42:23 lol 15:42:32 !echo hi 15:42:33 hi 15:42:42 !echo glove owned the simfiles forums 15:42:43 glove owned the simfiles forums 15:42:51 !echo bush hid the facts 15:42:52 bush hid the facts 15:42:53 huh let me check 15:42:56 !echo hst is ninshikou 15:42:56 hst is ninshikou 15:43:04 check what 15:43:06 nooo don't 15:43:25 mmk 15:43:40 !revive !bfjoust 15:43:48 what 15:43:54 huh lol 15:43:54 is it a valid command? 15:43:56 nope 15:44:05 !yodawg ````.B.o.o.!i 15:44:06 Boo! 15:44:13 wuts yodawg 15:44:21 it seems to have an interpreter in unlambda 15:44:26 i see 15:44:27 so it might be lambda calculus based 15:44:38 !bfjoust suicide_is_your_only_option < 15:44:43 i tried it some with universal lambda 15:44:52 so hard 15:44:53 * oerjan wonders if leonid_ and Patashu have even _heard_ of the yo dawg meme 15:44:58 I have 15:45:04 but it didn't help me solve the conundrum did it 15:45:10 it should 15:45:14 i have too 15:45:20 i made some too 15:45:25 is it to do with 15:45:27 nesting? recursion? 15:45:48 * oerjan lets you ponder it for a while 15:45:50 yo dawg, i herd u liek functions, so we've put a function in your function so now you can derive while you derive 15:45:58 hang on 15:46:03 !help yodawg 15:46:03 Sorry, I have no help for yodawg! 15:46:08 -!- myndzi has joined. 15:46:16 !info yodawg 15:46:16 EgoBot is a bot for running programs in esoteric programming languages. If you'd like to add support for your language to EgoBot, check out the source via mercurial at https://codu.org/projects/egobot/hg/ 15:46:24 !userinterps 15:46:24 how did I do it last time 15:46:24 Installed user interpreters: bct bfbignum chiqrsx9p choo echo google hello num ook rot13 slashes yodawg 15:46:34 !userinterps yodawg 15:46:35 Installed user interpreters: bct bfbignum chiqrsx9p choo echo google hello num ook rot13 slashes yodawg 15:46:37 !src yodawg 15:46:39 !yodawg 15:46:40 Unexpected end of file 15:46:42 how to uninstall interpreter? 15:46:42 !help 15:46:43 Supported commands: addinterp bf_txtgen bfjoust daemon daemons delinterp fyb help info kill mush userinterps 1l 2l adjust asm axo bch bct befunge befunge98 bf bf16 bf32 bf8 bfbignum boolfuck c chiqrsx9p choo cintercal clcintercal cxx dimensifuck echo forth glass glypho google hello kipple lambda lazyk linguine malbolge notecho num ook pbrain perl qbf rail rhotor rot13 sadol sceql sh show slashes test trigger udage01 underload unlambda whirl yodawg 15:46:47 there was a command to do it 15:46:48 !show yodawg 15:46:49 unlambda (sending via DCC) 15:46:49 what was iiiit 15:46:51 aha 15:46:56 !show yodawg 15:46:56 unlambda (sending via DCC) 15:46:59 !show num 15:46:59 sadol !1 15:47:04 ;D 15:47:06 !show yodawg 15:47:07 unlambda (sending via DCC) 15:47:14 !show yodawg 15:47:15 unlambda (sending via DCC) 15:47:25 oooh I get it 15:47:26 ### Copyright (C) 2001 by Ørjan Johansen 15:47:36 yo dawg we put unlambda code in your unlambda interpreter 15:47:51 i herd u liek 15:47:51 so you can do lambda calculus while you do lambda calculus 15:47:53 wat? copyright? 15:47:56 forgot this part 15:48:14 * oerjan cackles his evil maniacal laughter. BWAHAHAHA! 15:48:24 nooga: it's GPL 15:48:26 * nooga stabs oerjan 15:48:28 ;D 15:48:29 iirc 15:49:09 nooga: technically i'm not sure a norwegian _can_ cancel his copyright. 15:49:21 wow 15:49:33 although i write "public domain" in my programs recently 15:49:33 !show bct 15:49:34 bf (sending via DCC) 15:49:46 i can sell it, of course 15:49:47 bf bf bf 15:49:54 brain fuck bitch 15:49:54 somehow i feel sad 15:49:59 bf bf 15:50:00 sell yodawg interpreter in unlambda 15:50:02 yeah 15:50:05 !show chiqrsx9p 15:50:06 perl (sending via DCC) 15:50:08 but i'm not sure that norway has a PD concept apart from actual expiration 15:50:09 that'd sell 15:50:34 not that i've actually checked 15:50:58 !show choo 15:50:58 bf >,[>,]<++++++++++++++++++++++[<]>[[.>]<[<]>[-]>] 15:51:04 !choo 15:51:06 !choo 0 15:51:07 0 15:51:10 !choo 1 15:51:10 1 15:51:14 !choo foo bar 15:51:14 !choo 255 15:51:14 foo bar oo bar o bar bar bar ar r 15:51:14 255 55 5 15:51:20 woah 15:51:27 !choo choo 15:51:27 choo hoo oo o 15:51:32 handy 15:51:36 !choo echo 15:51:36 echo cho ho o 15:51:42 !show echo 15:51:43 bf ,[.,] 15:51:54 !show num 15:51:54 sadol !1 15:51:58 !show rot13 15:52:00 bf (sending via DCC) 15:52:10 o_o 15:52:23 !show hello 15:52:23 c char buf[1024]; int i; fgets(buf, 1024, stdin); for (i=0;buf[i];i++)buf[i]=(buf[i]=='\n')?'\0':buf[i]; if (!strcmp(buf, "h")) printf("Hello World\n"); else printf("Unknown command (%s) encountered\n", buf); 15:52:34 lol 15:52:37 what? 15:52:40 !hello h 15:52:42 Hello World 15:52:43 !hello any other input 15:52:45 Unknown command (any other input) encountered 15:52:50 !hello hh 15:52:51 Unknown command (hh) encountered 15:52:52 get it? 15:52:56 !hello hentai 15:52:57 Unknown command (hentai) encountered 15:53:05 :( 15:53:13 Hmm, that's an extremely silly implementation 15:53:21 !userinterp 15:53:24 it's not faithful to the specs? 15:53:25 !userinterps 15:53:25 Installed user interpreters: bct bfbignum chiqrsx9p choo echo google hello num ook rot13 slashes yodawg 15:53:33 leonid if you have any trivial interpreters feel free to add them on :o 15:53:34 lol ook 15:53:39 or daemons 15:53:42 !chiqrsx9p hhh 15:53:43 perl: warning: Setting locale failed. 15:53:48 lol 15:53:49 nice 15:53:54 what the heck 15:54:00 !perl print "hi"; 15:54:00 perl failure :awesome: 15:54:01 perl: warning: Setting locale failed. 15:54:01 golfscript interpreter would be good 15:54:07 it would buuut 15:54:10 it's in RUBY 15:54:14 oh snap 15:54:16 !slashes Then this won't work either 15:54:16 perl: warning: Setting locale failed. 15:54:21 :( 15:54:22 slashes... 15:54:26 wait wasn't slashes working earlier 15:54:27 interesting 15:54:33 yes, perl is broken 15:54:38 all of those use perl 15:54:40 how'd it break 15:54:41 !ruby p 42 15:54:53 GregorR: perl interps are broken 15:54:58 !bf . 15:55:00 there's no ruby, python, java, php 15:55:06 well what ARE we meant to program in god 15:55:25 Patashu: Perl, C, C++, Forth, or an esolang 15:55:27 !bfbignum . 15:55:33 maybe some i've forgot 15:55:45 hmm...what are asm, axo and bch? 15:55:53 asm is assembler 15:55:55 asm is the GNU assembler 15:56:39 !help 15:56:40 Supported commands: addinterp bf_txtgen bfjoust daemon daemons delinterp fyb help info kill mush userinterps 1l 2l adjust asm axo bch bct befunge befunge98 bf bf16 bf32 bf8 bfbignum boolfuck c chiqrsx9p choo cintercal clcintercal cxx dimensifuck echo forth glass glypho google hello kipple lambda lazyk linguine malbolge notecho num ook pbrain perl qbf rail rhotor rot13 sadol sceql sh show slashes test trigger udage01 underload unlambda whirl yodawg 15:56:46 !show whirl 15:56:46 That is not a user interpreter! 15:56:48 hmm 15:56:52 can't get info on commands 15:56:55 owell 15:57:01 !test 15:57:02 !help whirl 15:57:03 Sorry, I have no help for whirl! 15:57:06 !test a 15:57:09 !test a=b 15:57:13 !test bfjoust 15:57:16 !show test 15:57:17 !test !bfjoust 15:57:17 That is not a user interpreter! 15:57:25 huh 15:57:33 $!@#$!@#$ 15:57:50 bfjoust has been dead for 67 min 15:58:02 !sh echo $? 15:58:03 0 15:58:09 !sh exit 255 15:58:14 !sh echo $? 15:58:15 0 15:58:29 !sh ruby -e'p 42' 15:58:29 /tmp/input.1687: line 1: ruby: command not found 15:58:32 dam 15:58:49 !sh whoami 15:58:50 /usr/bin/whoami: cannot find name for user ID 1242221 15:58:57 !sh pwd 15:58:58 /home/egobot/egobot.hg/multibot_cmds 15:59:01 !sh ls 15:59:02 interps 15:59:08 ... 15:59:09 !sh echo interps 15:59:09 interps 15:59:12 oops 15:59:15 what 15:59:16 !sh cat interps 15:59:18 that's better 15:59:27 maybe not 15:59:33 !sh echo $? 15:59:34 0 15:59:39 oh just didn't want to do it for some reason 15:59:44 !sh head interps 15:59:55 what if I do sh vi 16:00:02 won't do much good for you 16:00:07 since it only returns one line 16:00:13 !sh vi 16:00:14 Vim: Warning: Output is not to a terminal 16:00:18 ya 16:00:21 it's not interactive 16:00:31 that process is still running 16:00:33 i guess 16:00:39 !sh :q! 16:00:39 /tmp/input.2330: line 1: :q!: command not found 16:00:43 It outputted "lib" and "slox" 16:00:54 !sh echo * 16:00:55 interps lib slox 16:00:57 :-P 16:01:03 echo * does what? 16:01:05 !sh ps 16:01:13 It echoes * 16:01:20 !sh ls -1 16:01:20 Where * is glob-expanded as usual 16:01:20 interps 16:01:22 !sh job 16:01:23 /tmp/input.2592: line 1: job: command not found 16:01:27 oops 16:01:38 !sh ls -l 16:01:39 /bin/ls: interps: Function not implemented 16:01:43 !sh yes 16:01:44 y 16:01:55 oh okay 16:01:57 it can dcc with you 16:02:02 -!- oerjan has quit ("leaving"). 16:02:16 ugh 16:02:17 wait 'yes' is a command 16:02:18 ? 16:02:20 bfjoust x_x 16:02:21 yeah 16:02:28 it prints y forever 16:02:31 !sh no 16:02:32 /tmp/input.2902: line 1: no: command not found 16:02:32 why 16:02:34 lol 16:03:18 alias no='yes n' 16:03:27 !sh yes n 16:03:28 n 16:03:53 uh wow 16:03:59 lol 16:04:00 okay 16:04:02 x_x 16:04:10 !sh alias no='yes n' 16:04:15 can't alias in sh right 16:04:19 or maybe you can... 16:04:31 -!- myndzi has quit (Read error: 113 (No route to host)). 16:04:49 !sh no 16:04:49 /tmp/input.3403: line 1: no: command not found 16:04:54 guess not 16:05:04 !sh echo a tear shed for those who have fallen 16:05:05 a tear shed for those who have fallen 16:05:08 !sh alias no='yes n'; no | head -1 16:05:09 /tmp/input.3514: line 1: no: command not found 16:05:15 !csh alias no='yes n' 16:05:15 -!- impomatic has left (?). 16:05:19 Hmmh 16:05:21 !csh no 16:05:25 nvm 16:05:30 alias /is/ in sh 16:06:07 Hmm, it just doesn't work like that after ; 16:06:25 maybe you can't save aliases 16:06:53 It works if you do it as a separate command 16:07:05 !sh alias no='yes n';no 16:07:06 /tmp/input.3915: line 1: no: command not found 16:07:13 :x 16:07:22 !sh cd . 16:07:24 !sh pwd 16:07:24 /home/egobot/egobot.hg/multibot_cmds 16:07:27 But like said, not when separated with ; :-P 16:07:27 !sh cd .. 16:07:28 !sh pwd 16:07:29 /home/egobot/egobot.hg/multibot_cmds 16:07:32 can't move :o 16:07:37 !sh cd ..;pwd 16:07:38 !sh cd ..;pwd 16:07:38 /home/egobot/egobot.hg 16:07:38 /home/egobot/egobot.hg 16:07:41 ninjad 16:07:44 :( 16:07:44 lol 16:13:03 -!- Patashu has quit ("Patashu/SteampunkX - MSN = Patashu@hotmail.com , AIM = Patashu0 , YIM = Patashu2 , Googletalk = Patashu0@gmail.com ."). 16:16:13 00:18 pikhq: AnMaster: BTW, have you ever checked out Second Life? 16:16:13 00:18 AnMaster: pikhq, no I haven't 16:16:14 00:18 AnMaster: pikhq, doesn't work in offline mode 16:16:16 HAHAHAHAHAHHAHAHAHA 16:16:58 lol 16:17:19 gregorr rewrote bfjoust? 16:18:16 -!- myndzi has joined. 16:18:56 myndzi=nescience 16:19:34 \m/ \m/ 16:19:46 D'aw. 16:19:58 01:37 psygnisfive: ive got a NeXT machine! :o 16:20:00 it's shit, it's not a cube 16:21:00 -!- myndzi has quit (Read error: 113 (No route to host)). 16:25:05 01:06:21 would be to be given a set of numbers and usable operators 16:25:05 01:06:28 and to make it equal a number given upfront 16:25:06 01:06:31 first person to answer wins 16:25:08 countdown 16:25:26 -!- myndzi has joined. 16:25:40 !sh cd ..;touch flimble 16:25:41 /usr/bin/touch: cannot touch `flimble': Permission denied 16:25:53 !sh mkdir foo;touch flimble 16:25:53 /bin/mkdir: cannot create directory `foo': Permission denied 16:26:21 yikes 16:26:27 firewall freaked the hell out 16:30:13 it's shit, it's not a cube <-- about cube... What happened to that Mac called "Cube"? 16:30:25 it seems like it just was forgotten quietly 16:30:27 AnMaster: It had overheating issues and also flopped commercially. 16:30:28 AnMaster: lmso 16:30:35 nooga, "lmso"? 16:30:37 lmao* 16:30:39 ah 16:30:39 The Mac Cube was a pretty cool design. 16:30:43 AnMaster: But some enthusiasts still have one. 16:30:45 yea 16:30:47 pikhq, designwise yes 16:30:47 Not in the sense that it ran cool, mind. 16:30:49 -!- MizardX has quit ("Proclamation of invalidity!"). 16:30:49 say that about mac mini 16:30:53 If you put two mac minis on top of each other: 16:30:53 http://www.apple.com/macmini/ 16:30:57 it would look basically the same. 16:30:59 (And be just as hot!) 16:31:04 ehird, hah 16:31:15 * nooga has got mac mini and mb pro 16:31:19 ehird, the cube did have a nice design though 16:31:23 and mac mini < mb pro 16:31:23 * pikhq is tempted to get a Mac Cube and stick a Mac Mini in its case 16:31:39 pikhq: Been done. 16:31:48 ehird, link! 16:31:51 ehird: Thus why I'm tempted. I want one, too. 16:31:57 AnMaster: google.com 16:32:10 !bfjoust test >+>->+>->+>->+>-(>[>[-+++++++++++++++++[-.]]+]+)*20 16:32:17 i'd better go back to my work, erm.. playing enigma 16:32:26 Score for Patashu_suicide_is_your_only_option: 2.9 16:32:26 Score for nooga_woot: 13.0 16:32:26 Score for leonid__lols: 24.2 16:32:26 Score for myndzi_test: 44.4 16:32:31 o_O 16:32:32 O_o 16:32:41 woot? 16:32:44 It lives 16:32:58 ha, it does indeed beat the defends 16:33:05 i thought a timing attack might work out :P 16:33:11 still i don't get how this game works 16:33:12 :f 16:33:26 Just found out erlang's standard library have a module implementing a directed graph, and various operations on it (such as topological sorting). Nice. 16:33:34 AnMaster: Anyway, if you think the G4 Cube was pretty: 16:33:57 ehird, not pretty. That is something else. You can have nice design without it being pretty 16:34:02 Well, whatever. 16:34:02 http://www.channelu.com/Turbo/NeXT/i/cube1a.jpg 16:34:11 ↑ NeXTcube >>> G4 Cube 16:34:12 !bfjoust test >+>->+>->+>->+>-(>[>[------------++++++++++++++++++++++++++++[-.]]+]+)*20 16:34:13 nice design as in "looks cool (NOT in the thermal sense)" 16:34:16 Score for myndzi_test: 36.6 16:34:18 BTW, yes, I also <3 the NeXTcube. 16:34:21 ...apart from not loading, that image is nice 16:34:26 -!- fungebob has quit ("ChatZilla 0.9.84 [Firefox 3.0.10/2009042316]"). 16:34:28 http://upload.wikimedia.org/wikipedia/commons/2/27/NeXTcube.jpg 16:34:30 have a low-res version 16:34:36 hmm actually the same one, whatever 16:34:44 is the image large 16:34:49 640x480. 16:34:53 !bfjoust test >(+)*20>(-)*20>+>->+>->+>-(>[>[-+++++++++++++++++[-.]]+]+)*20 16:34:57 huh why does it take so long to load then 16:34:57 Score for myndzi_test: 80.1 16:35:04 hot fucking damn :> 16:35:04 meh. timeout 16:35:05 ... 16:35:07 AnMaster: cuz the site is down, use http://upload.wikimedia.org/wikipedia/commons/2/27/NeXTcube.jpg 16:35:10 16:34 ehird: ...apart from not loading, that image is nice 16:35:11 ehird, ah... 16:35:12 18 | - - + + + + - + + + + + + + + + + + - | 80.1 | 11 | myndzi_test.bfjoust 16:35:14 gawd, it's just a little bit of reading... 16:35:21 um 16:35:28 ehird, I was so eager to look at the picture that I didn't read the next line! 16:35:30 whoa 16:35:33 finally 16:35:41 !bfjoust lols < 16:35:45 AnMaster: clearer pics: http://www.fortunecity.com/marina/reach/435/nextsystem_on.jpg, and http://www.fortunecity.com/marina/reach/435/nextcube_fullback.jpg 16:35:45 Score for leonid__lols: 3.0 16:35:50 ehird, looks like a cross between a cube and a safe? 16:35:54 yes it lives! 16:35:55 *dances* 16:35:57 AnMaster: that would be the fan grill 16:36:03 heh 16:36:14 ah those clearer pics doesn't make it looks that way 16:36:17 AnMaster: the CPU ran at 25MHz! 128KB of ROM! 12MB-64MB of RAM! 16:36:18 AnMaster: Probably took a hint from the IBM school of design. 16:36:21 1120x832 two-bit video 16:36:27 2GB harddrive, 256MB optical drive 16:36:29 wasn't the mac cube fanless? 16:36:31 or do I misremember 16:36:33 no 16:36:39 (Nextstations used optical drives instead of HDs, but that was sloooooooooow) 16:36:47 ehird, it was fanless? 16:36:48 !bfjoust lols >-< 16:36:50 no 16:36:50 it was not 16:36:52 Score for leonid__lols: 12.3 16:36:52 ah 16:36:56 "Your computer equipment should be able to be used instead of a cinder block for putting a car on bricks." 16:37:00 <3 early IBM. 16:37:01 ehird, needed a better fan then to not run hot? 16:37:11 AnMaster: oh, and that machine ran tis this operating system: http://www.linuxfocus.org/common/images/article128/next24.jpg 16:37:21 which was then forced to have a child with BSD to produce OS X 16:37:25 AnMaster: it just had terrible airflow 16:37:34 pikhq, what is a cinder block? 16:37:49 http://en.wikipedia.org/wiki/Concrete_masonry_unit 16:40:01 hm ok 16:40:03 -!- inurinternet has quit (Read error: 60 (Operation timed out)). 16:45:03 !bfjoust lols . 16:45:06 Score for leonid__lols: 14.0 16:45:09 what 16:49:16 why do you people insist on submitting this junk :\ 16:49:52 myndzi, "this junk"? 16:50:00 < leonid_> !bfjoust lols . 16:50:09 about the score for it 16:50:13 Patashu> !bfjoust suicide_is_your_only_option < 16:50:13 etc 16:50:26 I guess it scored better than some of the pure defenders, that were waiting for something to happen 16:50:31 so draw against them 16:50:36 draw != better 16:50:51 myndzi, yeah I know I typoed 16:51:01 it did beat two of mine though :> 16:51:04 i know why but i'm not telling! 16:51:05 hehe 16:51:32 myndzi, and I don't care really. :P 16:52:16 (I'm not very interested in programming war games 16:52:40 (which isn't a good name for it probably, but I can't think of anything better for stuff like corewars, bf joust and so on) 16:53:31 !bfjoust lols [-]+.[-]+.[-]+.[-]+ 16:53:35 Score for leonid__lols: 20.5 16:53:45 !bfjoust lols ([-]+.)*10 16:53:49 Score for leonid__lols: 17.0 16:54:50 !bfjoust test . 16:54:55 Score for myndzi_test: 6.4 16:56:10 !bfjoust slowrush >(+)*20>(-)*20>+>->+>->+>-(>[[-+++++++++++++++++[-.]]+>]+)*20 16:56:14 Score for myndzi_slowrush: 84.2 16:56:20 O_o 16:56:37 interesting.. ties? 16:56:50 !bfjoust slowrush >(+)*20>(-)*20>+>->+>->+>-(>[>[-+++++++++++++++++[-.]]+]+)*20 16:56:54 Score for myndzi_slowrush: 80.1 16:57:09 had to check 16:57:20 whoa 16:57:30 !bfjoust lols ([-]+.)*20 16:57:35 Score for leonid__lols: 12.6 16:57:35 btw, between the June 8 and the June 13 I will be away and offline. 16:57:41 !bfjoust lols ([-]+.)*5 16:57:45 Score for leonid__lols: 9.1 16:57:46 (that is inclusive) 16:57:51 *** 16:58:30 -!- inurinternet has joined. 16:58:45 !bfjoust lols ([-]-.)*10 16:58:48 Score for leonid__lols: 9.1 16:59:19 x_x 16:59:34 where's your defense now ehird!? :) 16:59:58 !bfjoust lols (>[-])*10 17:00:02 Score for leonid__lols: 11.0 17:00:15 leonid_: i'm not sure you have grasped the point of this yet 17:00:56 myndzi: that applies to most everyone doing most everything 17:01:05 :\ 17:01:13 did the hillsize get bumped overnight? 17:01:23 For some values of "overnight", yes 17:01:32 myndzi, no 17:01:33 Some 8 hours ago or so 17:01:41 i read the rules though 17:01:58 i'm dumb >_< 17:02:00 oh awesome, he added the archived reports too 17:04:19 !bfjoust lols >+[->+].[-].[-] 17:04:23 Score for leonid__lols: 14.6 17:04:27 ?_? 17:04:28 !bfjoust slowrush >(+)*20>(-)*20>+>->+>->+>-(>[[+-----------------[+.]]+>]+)*20 17:04:32 Score for myndzi_slowrush: 77.8 17:04:34 huh 17:04:44 !bfjoust lols >+[->+].[-].[-].[-].[-] 17:04:48 Score for leonid__lols: 13.0 17:09:04 -!- MizardX has joined. 17:11:52 !bfjoust lols ([-]-)*100 17:11:55 Score for leonid__lols: 13.4 17:18:04 !bfjoust donald (>)*20([-]<)*5 17:18:07 Score for Deewiant_donald: 14.1 17:18:40 !bfjoust donald (>)*21([-]<)*5 17:18:43 Score for Deewiant_donald: 16.5 17:19:00 !bfjoust donald (>)*22([-]<)*5 17:19:04 Score for Deewiant_donald: 17.6 17:19:09 !bfjoust donald (>)*23([-]<)*5 17:19:13 Score for Deewiant_donald: 9.1 17:19:17 !bfjoust donald (>)*24([-]<)*5 17:19:25 Score for Deewiant_donald: 7.6 17:19:30 !bfjoust donald (>)*25([-]<)*5 17:19:34 Score for Deewiant_donald: 7.6 17:21:18 Deewiant: overruns the tape often 17:21:20 it's 10-30 17:21:31 Yes, I am well aware 17:21:52 !bfjoust donald (>)*21([-]<)*5 17:21:58 Score for Deewiant_donald: 17.0 17:22:02 I think I'll settle with this guy, beats shade :-P 17:22:10 http://buttersafe.com/2009/05/28/do-you-want-this-snake/ 17:22:27 ehird: I was just trying to get the right values out of the randomizer to beat the best bots :-P 17:22:43 Deewiant: just do (>)*N(-)*128[-] 17:22:51 it's almost optimal for the write tape length N 17:22:59 in fact, completely optimal, I think 17:23:01 Ah right, (-)*128 is of course better 17:23:03 hm actually make it 17:23:25 Deewiant: (>)*N(-)*128.[(-.)*128] 17:23:28 Although I guess too many programs will modify their flag a bit, even attackers 17:23:32 see above 17:23:35 ehird: Why . 17:23:38 Deewiant: nop 17:23:43 ehird: Not what, why 17:23:55 Deewiant: because the flag has to be 0 for two generations 17:24:02 [-] handles this because it's [-]-]-] 17:24:13 hmm otoh, -.-. takes the same cycles 17:24:14 Oh right, the * is inside the [] 17:24:20 (>)*N(-)*128.[-], then 17:24:24 without the comma 17:24:29 oh wait, the [ takes a cycle 17:24:31 (>)*N(-)*128[-] 17:24:34 bruteforce for N 17:24:36 :-P 17:24:37 Deewiant: you want a short N 17:24:41 i'd bruteforce for N=9 17:24:45 so 10-length tape 17:24:48 that way you take less cycles 17:25:06 It takes less cycles than the opponent in any case 17:25:15 yes 17:25:20 but less cycles objectively = winzor or sth 17:25:26 !bfjoust donald (>)*21(-)*128[-] 17:25:31 Score for Deewiant_donald: 15.1 17:25:39 Yay, beats shade again 17:25:44 I'm happy with that :-P 17:25:53 !bfjoust fuck (>)*9(-)*128[-] 17:25:54 !bfjoust lols (+.)*100 17:26:00 leonid_: how stupid 17:26:04 :( 17:26:16 leonid has the amazing ability to make running the joust take upwards of 10 minutes 17:26:37 no 17:26:45 it was about 80 min 17:26:52 Before that, it was 12 17:26:54 yes 17:26:54 Wasn't it 17:26:55 * ehird kicks leonid_ 17:27:00 :-D 17:27:03 ehird don't hate stupid people 17:27:08 give them some love 17:28:11 and why isn't it terminating again 17:28:12 fun compiler bug for when the last function isn't properly closed. ./polynomial.erl:999999: syntax error before: 17:28:24 note file is 125 lines long with comments 17:28:29 err, 129 17:28:30 but still 17:28:41 (fixed in next version) 17:29:01 gah 17:29:04 is this my fault again 17:29:08 >_> 17:29:17 yes 17:29:20 how 17:29:30 -!- Gracenotes has joined. 17:30:59 how indeed 17:32:05 i think ehird just hates me ._. 17:32:17 * ehird kicks leonid_ again for good measure 17:32:21 argh 17:32:28 i'm prejudiced against people i kick 17:32:28 you fellow golfer 17:32:29 sorry. 17:32:34 why do you dislike leonid_? 17:32:43 AnMaster: i kicked him, therefore I dislike him. QED. 17:32:44 I thıṅk that my dotted ıṡ don't lıḳe dots. 17:33:01 lmfao 17:33:11 ehird, I think there is a flaw in that logic somewhere. But I can't pinpoint it... 17:33:12 hey ehird why did you stop golfing 17:33:16 leonid_: oh you're the anarchy golf leonid? 17:33:23 yes don't you realize 17:33:23 also I just haven't been there in a while i guess you brought me there now. 17:33:29 right okay i retract my kicks 17:33:32 :( 17:33:38 you submitted a non-embed to my http://golf.shinh.org/p.rb?Walk+the+line 17:33:40 which is a-okay 17:33:43 ehird, finished that new joust interpreter? 17:33:47 oh 17:33:49 oh right that's why I stopped anagolfing 17:33:53 EVERYONE JUST SUBMITS EMBEDS 17:33:58 well 17:34:01 AnMaster: no, GregorR made his own so why bother? 17:34:04 post a problem that prevents embed 17:34:15 leonid_: that sucks, there are plenty of interesting non-embed problems 17:34:20 ehird, hm thought it was mostly done? 17:34:23 ehird 17:34:25 ehird: the +- thing? the exahustive battle? 17:34:33 i know >_> 17:34:45 myndzi: yeah, but GregorR said that egojoust was fine for now 17:34:56 well, it's currently lagged to hell, but yeh 17:35:02 Score for ehird_fuck: 11.3 17:35:02 so /shrug 17:35:03 Score for leonid__lols: 14.5 17:35:08 too bad, i think i figured out how to fix my bug 17:35:11 !bfjoust fuck (>)*9(-)*128[-] 17:35:12 oh nice 17:35:16 Score for ehird_fuck: 9.0 17:35:17 even though it is gonna kill his ram 17:35:19 !bfjoust fuck (>)*9(-)*128[-] 17:35:19 ehird: What's an embed 17:35:22 ehird 17:35:24 Score for ehird_fuck: 9.0 17:35:26 why do you do (-)*128 17:35:36 leonid_: because ------- takes less cycles than [-]-]-]-]-] 17:35:36 doesn't it just go back to its position 17:35:41 erm 17:35:42 no 17:35:44 128→0 17:35:48 (-(-)*128-)*128 17:35:52 Deewiant: embedding the outputs required in the examples on the golf site 17:35:55 instead of actually doing the computation 17:36:01 note that the above won't work 17:36:01 almost always shorter than actually solving it 17:36:06 it'll dec you right through 0 and past it 17:36:11 128^128+2 FTW? 17:36:11 myndzi: ehm, no 17:36:13 ehird: Ah, so it's the marking for the "cheating entries" 17:36:19 128→0, [, ding! you win 17:36:21 referring to (-(-)*128-)*128 17:36:23 Erm. 128¹²⁸+2. 17:36:24 oh 17:36:25 it's all -'s 17:36:27 !bfjoust fuck (>)*9(-)*128[-] 17:36:27 !bfjoust fuck (>)*9(-)*128[-] 17:36:28 !bfjoust fuck (>)*9(-)*128[-] 17:36:30 !bfjoust fuck (>)*9(-)*128[-] 17:36:32 D: 17:36:32 !bfjoust fuck (>)*9(-)*128[-] 17:36:34 Hmm, no golfscript entry 17:36:34 !bfjoust fuck (>)*9(-)*128[-] 17:36:36 * ehird prays 17:36:38 dear lord, please make this work 17:36:40 amen 17:36:43 i think i slowed it down horribly 17:36:56 i wasn't quite thinking about the numbers i was using, i should fix that 17:37:00 deewiant, golfscript entry for which problem? 17:37:04 but if/when it runs properly it should win 17:37:09 leonid_: mine 17:37:09 beat everything but shade 17:37:10 Walk the line 17:37:10 leonid_: The one ehird linked 17:37:13 oh 17:37:30 oh god 17:37:35 180000000 expansions 17:37:43 O_o 17:37:46 you wrecked it 17:37:49 you broke it 17:37:53 that's what you get for making me use loop operators for "if not zero" :( 17:37:53 It doesn't cache it in between, does it? :-D 17:37:58 lol i don't think so 17:38:01 and it has to run it 20 times 17:38:08 19 17:38:15 any tips for good bots? 17:38:24 Try random shit until you get a good score 17:38:32 that sounds convincing 17:38:32 Worked for me (for middling values of "good") 17:38:44 514MB 17:38:45 that's i do when i golf 17:38:46 oshi 17:38:50 that can't be good 17:38:52 that's what i do* 17:39:02 i'll take it off as soon as i can 17:39:09 i'll take my two ties 17:39:17 !bfjoust toofuckingexponential___indahouse (((((-)*65536)*65536)*65536)*65536)*65536 17:39:21 if this is the compromise 17:39:25 oh god 17:39:28 well 17:39:31 he doesn't expand those 17:39:33 so that's ok i guess 17:39:37 1,073,741,824 petabytes 17:39:45 wait, actually 17:39:48 = 1 yottabyte 17:39:48 if my understanding is correct 17:39:55 huh 17:39:58 omg 17:39:59 A YOTTABYTE! 17:40:02 it should only then be somewhere in the range of 25.7MB 17:40:19 it'd expand the ({}) inside the () but not expand it 20 times 17:40:20 ..i hope 17:40:20 don't care it's 1 yottabyte, in my mind 17:40:26 erm 17:40:30 where is leonid_'s 180000000000000 expansions 17:40:42 i am talking about my (((((-)*65536)*65536)*65536)*65536)*65536 17:40:42 what 17:40:43 no 17:40:52 =1YB 17:40:58 what i did was doing (<)*x or something 17:41:12 damn i want to see the results but i gotta go to work 17:41:16 bai 17:41:57 ehird i forgot what your main language for anagol was 17:42:17 leonid_: varied. sometimes ruby, sometimes perl, sometimes haskell 17:42:22 sometimes C 17:42:28 cool 17:42:41 yeah i saw some ruby submissions of you 17:42:46 http://golf.shinh.org/p.rb?Linear+Congruences ← if Mathematica was an option this would be a oneliner :-D 17:43:13 There's maxima 17:43:18 will maxima work? 17:43:20 ah 17:43:21 perhaps 17:43:21 oops ninjad 17:43:49 well 17:43:53 this problem is easy 17:43:55 brb embedding 17:45:01 forget it 17:45:32 Score for ehird_fuck: 9.5 17:45:32 Score for ehird_fuck: 9.5 17:45:32 Score for ehird_fuck: 9.5 17:45:32 Score for ehird_fuck: 9.5 17:45:32 Score for ehird_fuck: 9.5 17:45:33 Score for ehird_fuck: 9.5 17:45:42 Score for ehird_toofuckingexponential___indahouse: 31.1 17:45:43 lmfao 17:45:52 wtf, it ran my 1yb program :D 17:45:58 lolol 17:46:08 I wonder what it expanded it to 17:46:33 !bfjoust lols (-)*99999 17:46:46 Score for leonid__lols: 20.8 17:46:52 !bfjoust lols (-)*999990 17:46:57 Score for leonid__lols: 20.8 17:46:58 !bfjoust fuck (-)*99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 17:47:03 lmfao 17:47:10 actually 17:47:13 that's likely smaller 17:47:17 !bfjoust lols (-)*-1 17:47:26 >> 65536*65536*65536*65536*65536 17:47:26 => 1208925819614629174706176 17:47:27 or not 17:47:40 omfg 17:47:45 ehird: It treats it as a for(int i = 0;i < HUGE_FUCKING_NUMBER;i++) and doesn't unroll the loop. ;) 17:48:06 pikhq: but running a loop that many times should take way longer than it did 17:48:31 Except that it's a suicide program. 17:48:49 It'll end execution in the first run of the loop. :p 17:49:00 pikhq: no loop 17:49:09 it has to stay 0 for two cycles 17:49:14 it goes 1, 0, 255 17:49:16 I'm calling (x)*foo a loop. :p 17:49:18 ... Oh. 17:49:23 For two cycles? 17:49:23 w/ [-], yes, it would stop 17:49:24 Well, then. 17:49:25 [-]-]-]-] etc 17:49:32 the ] would make it suicide 17:49:37 -!- oerjan has joined. 17:50:21 no ais523 :( 17:50:24 !bfjoust scrooge (+)*384000 17:50:32 17:46 ehird: !bfjoust fuck (-)*99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999 17:50:39 ahead of you i way am 17:50:55 No, you're trying to kill the interpreter or something :-P 17:51:01 I'm using +, besides 17:51:39 i bet the interpreter hates you 17:52:42 -!- tombom has joined. 17:54:40 do i have to wait for this until the world ends 17:54:48 you ehird you fool 17:55:03 this is why MYYY interpreter is needed ;;;;;;;;;;)))))))))))))))) 17:56:27 ugh 17:56:43 the interpreter should have a timeout 17:58:09 it does 17:58:10 20k cycles 17:58:12 but it's slow as fuck 18:01:24 -!- oerjan has quit ("Good night"). 18:01:48 :d 18:02:05 ehird: 384k cycles was claimed by someone 18:03:50 maybe GregorR did that 18:04:16 (Thence the value used in scrooge) 18:17:58 it's 100000 18:18:07 yd.f oace 18:18:14 they said the other night 18:18:36 but the timeout doesn't count the time spent expanding 18:20:36 Ah, so I see, 100k it is. 18:21:11 nescience: yd.f oace? 18:21:24 going to bed 18:21:32 bye 18:21:55 * leonid_ goes to bed 18:29:43 ehird: accidental keyboard layout swap 18:29:53 :D 18:29:56 what was it meant to be? 18:30:18 "they said" 18:30:26 so did you guys fuck up the bot? :\ 18:30:37 i took my broken thing off 18:30:52 i realized to do what i want (and be victorious against everything except shade) i need THREE nested expansions 18:31:03 !bfjoust turnintoagreenthing . 18:33:46 so i got into work today 18:33:52 open up the back door to get a cross breeze blowing 18:33:57 and there's some chick back behind our building 18:33:59 in a little fort 18:34:04 smoking a joint and changing her clothes 18:34:05 o_O 18:34:17 she's like 18:34:18 "hi" 18:34:21 "i'm just changing" 18:34:26 First law of IRCodynamics: Everyone has a more interesting life than you, except when they don't. 18:34:42 -!- olsner has joined. 18:36:19 so you gonna write that interpreter after all? 18:36:38 seeing as we managed to cripple the bot somehow 18:36:52 (plus if you do expansionless evaluation then i can make slowrush better!) 18:38:31 Yeah, I guess so. 18:38:59 :) 18:39:06 * ehird refactors some of the rubbish code in it and gets to work on an interpreter loop 18:41:10 hrm 18:41:23 you could probably ask GregorR-L for his code 18:41:31 naw 18:41:32 the one he pasted before isn't the most recent 18:41:41 not hard to write from scratch 18:41:45 & his code probably isn't mit-licensed 18:41:49 don't want to submit a patch? ;) 18:41:58 also, I'm making a new hill infrastructure 18:42:01 so it would be rather pointless 18:42:13 aha 18:42:33 anyway, it'll just be part of 18:42:33 !help 18:42:34 Supported commands: addinterp bf_txtgen bfjoust daemon daemons delinterp fyb help info kill mush userinterps 1l 2l adjust asm axo bch bct befunge befunge98 bf bf16 bf32 bf8 bfbignum boolfuck c chiqrsx9p choo cintercal clcintercal cxx dimensifuck echo forth glass glypho google hello kipple lambda lazyk linguine malbolge notecho num ook pbrain perl qbf rail rhotor rot13 sadol sceql sh show slashes test trigger udage01 underload unlambda whirl yodawg 18:42:35 er 18:42:36 !info 18:42:37 EgoBot is a bot for running programs in esoteric programming languages. If you'd like to add support for your language to EgoBot, check out the source via mercurial at https://codu.org/projects/egobot/hg/ 18:44:34 i guess it must expand 90s, 'cause i can't see anything else evil in the buffer 18:44:37 Okay let's see this parser is awful I'm rewriting the paresr 18:44:46 nescience: I'm going to do expanding as a pre-processor stage 18:44:50 with guards against omggigantic programs 18:45:02 i outlined how to do it without expanding at all earlire 18:45:04 earlier* 18:45:06 also, no (a{b}c)%N, you can just do (a)*Nb(c)*N 18:45:07 i can elaborate if you want? 18:45:14 not quite 18:45:15 nescience: well, almost all programs are small enough just to expand beforehand 18:45:20 also, yes, w/ mine 18:45:25 'cause you have to execute both Ns the same amount of times 18:45:27 I know ais's interp can't handle it 18:45:32 if the first one breaks out before it's done... 18:45:32 nescience: ehm wut 18:45:34 oh i see what you mean 18:45:39 i just mean syntactically 18:45:50 (a[)*Nb(]c)*N will work in mine, for instance 18:45:50 yeah 18:45:56 i see, but i'm not sure why it's worth it 18:46:01 so there's no need for (a[{b}]c)%N 18:46:07 nescience: one less useless feature 18:46:20 there is a need for %N though 18:46:26 the problem with doing it like this: 18:46:31 (a[)*Nb(]c)*N 18:46:35 -!- jix_ has joined. 18:46:40 is that when the [ fails and you skip the rest of the iterations 18:46:49 nescience: excuse me... 18:46:51 you have to only do the same amount of closing iterations on the second one 18:47:03 i don't think you understand. at all 18:47:09 (a[)*5b(]c)*5 18:47:09 → 18:47:16 a[a[a[a[a[b]c]c]c]c]c 18:47:19 before running 18:47:19 yes 18:47:21 which is identical to 18:47:23 if you expand it 18:47:26 (a[{b}]c)%5 18:47:27 → 18:47:29 a[a[a[a[a[b]c]c]c]c]c 18:47:31 nescience: which I am 18:47:39 the longest legit program, when expanded, is ~1MB 18:47:47 but you can save yourself time, energy, and memory without expansion 18:47:53 also 18:48:01 instructions != cycles as far as legitimacy goes 18:48:03 nescience: time, not really 18:48:06 energy, um what 18:48:11 memory, oh noes 1MB 18:48:16 for example, there will be programs that have a lot of code inside [] 18:48:18 that won't get executed 18:48:26 nescience: so? 18:48:28 and they'll have to repeat that block of [] a number of times to do what they want to accomplish 18:48:31 ~20k max cycles 18:48:36 so, the longest legit program can be a lot longer than that 18:48:36 irrelevant 18:48:45 because you could skip 10000 instructions all at once 18:48:51 I don't see your point. 18:49:05 ehird: 100k. 18:49:06 obviously not 18:49:11 Deewiant: 20k in mine. 18:49:14 my point is that 1mb, fully expanded, is not enough space 18:49:14 I can raise it to 100k if I want. 18:49:23 nescience: err, what 18:49:29 running programs takes constant space 18:49:44 100k is not higher than 1mb :P 18:49:51 ehird: 100k in both of GregorR's and ais's, so I'd do it 18:49:53 yes, running programs takes constant space 18:49:53 that means 100,000 18:49:55 but earlire 18:49:57 earlier, 18:50:01 Deewiant: 20k in ais's. 18:50:02 i submitted one that was like 25mb 18:50:09 ehird: 2009-05-28 09:05:45 ( GregorR-L) myndzi: Actually, 100000 in ais' and mine. 18:50:09 and it was bugged, it should have been bigger 18:50:17 Deewiant: I don't care, ais told me. 18:50:29 nescience: it'll just reject programs bigger than 100MB. 18:50:35 ehird: while ($steps++ < 100000) { 18:50:37 ehird: From the source. 18:50:38 since that's about as high as any legit warrior will be 18:50:39 Deewiant: k 18:50:42 which is something of a mistake, and also unnecessary 18:50:51 you could be running a program that's like 1000 bytes instead 18:50:51 nescience: your arguments are unconvincing 18:50:54 but you don't want to 18:51:10 -!- psygnisfive has joined. 18:51:12 partly i'm in a hurry, partly you're being stubborn 18:51:26 nescience: ... there's no advantage to expanding it in-time 18:51:36 you're seriously overreacting 18:51:40 i was saying you don't have to expand it at all 18:51:44 which saves a lot of work 18:51:51 yes you do, to handle the cycle count 18:51:52 but also that the ({}) syntax is necessary to do so 18:51:57 not true 18:52:13 nescience: then tell me. 18:52:16 you simply don't count non instructions towards the number of cycles 18:52:22 -!- Slereah has quit (Read error: 60 (Operation timed out)). 18:52:26 what would you like me to tell you? 18:52:50 nescience: how do you not expand it 18:52:55 (+)*57 takes 57 cycles 18:52:56 it must 18:53:11 yes 18:53:21 so how do you avoid expanding 18:53:23 for ()s you simply need a counter 18:53:28 for a simple ()*N loop, 18:53:44 when you reach ), increase the counter; if it == N, then proceed, else go back to ( 18:53:52 so what advantages does this have over preëxpanding, other than using a measly 100MB less memory? 18:54:20 the time spent to expand to that 100mb every battle (or store it) 18:54:33 which is what is currently making EgoBot unusable 18:54:34 Just store it -> cheap 18:54:35 ehm 18:54:46 and the lack of an arbitrary program length limit 18:54:46 nescience: i can expand 100mb in like a few miliseconds. 18:54:49 but yeah 18:54:51 I'm just going to store it 18:55:13 because of the nature of brainfuck, some programs are simply going to be extremely long 18:55:19 and you are basically saying "nope, not doin it" 18:55:20 * nescience shrugs 18:55:24 it stands to reason that chickens are green? 18:55:32 you're not giving me any arguments why 100mb programs are needed 18:55:50 -!- bsmntbombdood has joined. 18:55:51 because that's how many insructions it takes to do certain things? 18:55:56 i thought that was fairly obvious 18:55:58 No point in doing it until it's necessary, unless it's trivial 18:56:00 i can give you some code later if you like 18:56:06 do show me this amazing 100mb warrior 18:56:20 i don't know the exact expansion size, but from earlier: 18:56:51 >(+)*20>(-)*20>+>->+>->+>-(>[[-+++++++++++++++++[-.]]+>]+)*20 <- this program tops the hill 18:56:53 2 ties and 1 loss 18:56:56 -!- Slereah has joined. 18:57:02 the 2 ties are because of polarity, so i was attempting to beat them too 18:57:02 * ehird measures 18:57:14 to do that i needed to do the -. loop a fixed number of times 18:57:17 which means i hae to do something like: 18:57:28 nescience: dude 18:57:29 that's 654 bytes 18:57:30 BYTES 18:57:34 not even a KILOBYTE 18:57:38 let along 1024KB = 1MB 18:57:40 let alone 100MB! 18:57:43 that wasn't the example dude 18:57:44 chill the fuck out 18:57:48 o_O 18:57:50 i'm explaining the reasoning and necessity 18:57:50 i'm chilled 18:57:51 -!- jix has quit (Read error: 113 (No route to host)). 18:57:51 >(+)*20>(-)*20>+>->+>->+>-(>[[-+++++++++++++++++([-.{}([+.{}])*3000])*3000]+>]+)*20 18:57:56 * ehird measures that 18:58:05 that one is broken but expands to like 4 bytes * 3000 * 3000 + something * 20 18:58:21 the fix requires another nested loop 18:58:31 which again exponentially increases the size 18:58:36 nescience: let's say something=1000 18:58:36 i didn't bother with the fix because it wouldn't work on EgoBot 18:58:38 that's 34MB 18:59:25 now take that and add another expansion like i said :P 18:59:32 *3000 again? 18:59:34 that's well on its way to 100mb 18:59:44 i doubt *3000, but i don't know, i haven't thought it out yet 18:59:47 What's with those {}, aren't they ignored 18:59:48 i just know it'll be big 18:59:54 nescience: um no 18:59:56 that's 100 gigabytes 18:59:58 so 19:00:05 to hell with that :) 19:00:14 it's definitely not gonna be *3000 19:00:32 but my point is no expansion is necessary at all and such programs can be supported 19:00:41 and are also within reason necessary to accomplish certain goals 19:00:46 He's got a point 19:00:51 Deewiant: define h 19:00:51 e 19:01:19 but apparently to you it makes more sense to expand that ~100 byte program to ~100 megs 19:01:24 so uhh i guess there's not much i can do for you 19:01:32 ehird: Whoever's chatting behind the nick nescience 19:01:45 nescience: it seems like a lot of work for barely any game 19:01:47 gain 19:01:57 i mean... it's not as if we all have 64K of ram. 19:02:07 1) it is NOT a lot of work 19:02:24 It's pretty much the same amount of work as parsing the * in the first place 19:02:24 2) the gain is the lack of an arbitrary limit on what you can and can't write 19:02:30 i don't understand it and you've explained it 3 times :-) 19:02:34 -!- max has joined. 19:02:34 it requiers a counter and 2 pointers 19:02:51 probably a stack for the counters or whatever 19:03:00 -!- max has changed nick to Guest65774. 19:03:01 just tell me the algorithm :) 19:03:04 Or manual recursion, whatever 19:03:23 -!- Taejo has quit (Nick collision from services.). 19:03:26 -!- Guest65774 has changed nick to Taejo. 19:03:29 an in the end, hell, being wasteful just because you can is never a great agrument 19:03:48 well, since () are used in two contexts you need to identify ahead of time which it is 19:04:01 for ({})%N, all you do is keep a loop counter as before 19:04:05 nescience: wait, okay, question 19:04:08 Jump to the ) and look at whether it's % or * 19:04:10 why is ({}) necessary in this 19:04:12 when you hit } increase it, if it == N, continue on; otherwise jump to ( 19:04:20 err, hit { increase, jump to ( 19:04:31 if you hit ) decrease it, if it == 0, continue on; otherwise jump to } 19:05:03 the reason ({}) is necessary for non-expanding interpretation is because otherwise you don't know how many times to execute the *N affecting the ] corresponding to a [ 19:05:11 err 19:05:20 handle [] like you would if ({}) wasn't even there, as long as they are balanced inside the () they will work fine 19:05:42 i don't see why (a[)*Nb(]c)*N wouldn't work 19:05:57 ok, assume for a moment that before you execute a[ N times, one of the [ fails 19:06:04 nescience: "fails"? 19:06:05 you are then going to skip all subsequently expanded code 19:06:10 like what, it gets all creaky? 19:06:12 you execute [ while the data is 0 19:06:21 thus do not execute the contents of the brackets 19:06:25 including the rest of the expansions 19:06:31 now you hit ]c*N 19:06:36 you can't expand it N times, because that's too many 19:06:50 you can't rely on the data to determine how many times to expand it, because it must match the a[ 19:06:55 Deewiant: is this making sense to you? maybe you could help me understand... 19:06:58 in short, you're screwed (unless you expand it all ahead of time) 19:07:15 ehird: See last line above :-P 19:07:17 let's take 3 as an example 19:07:28 (a[)*3b(]c)*3 19:07:29 Deewiant: ? 19:07:33 a[a[a[b]c]c]c 19:07:36 ehird: 2009-05-28 21:06:58 ( nescience) in short, you're screwed (unless you expand it all ahead of time) 19:07:46 Deewiant: that is not explanatory. 19:07:50 if the 2nd [ expands on a 0, you skip the bolded parts: 19:07:56 a[a[a[b]c]c]c 19:08:12 which means you need to execute "c]c" and no more no less 19:08:14 no boldin 19:08:15 g 19:08:17 +c 19:08:20 mode 19:08:24 a[a[>a[b]c] part in >< is skipped 19:08:38 yes, that's obv— no, it's not 19:08:38 there's no sensible way to get "c]c" out of (]c)*3 19:08:45 ehird: Well, looks like he's trying to explain what should happen with (a[)*Nb(]c)*N, and saying that you're somewhat screwed with the looping technique 19:08:55 Deewiant: I know what he's trying to say. 19:08:59 I just don't understand _what_ he's saying. 19:09:01 ehird: So what do you want explained 19:09:07 i'm sorry, i'm on limited time and i am trying to be quick 19:09:09 i must get back to work 19:09:12 kay 19:09:15 I'll read it 70 times :P 19:09:16 i can explain with more patience and detail later if you actually want 19:10:18 -!- inurinternet has quit (Connection timed out). 19:10:23 ehird: In a[a[>a[b]c]< is skipped if the second [ finds 0 19:10:34 Okay okay stop it you are just repeating him 19:10:46 ehird: Did you understand that? 19:11:07 Or alternatively, what don't you understand :-P 19:11:24 English! Am foreign no americano. 19:12:14 Then I'll just continue 19:12:18 Oh dear. 19:12:21 I take it back, whatever I said. 19:13:19 ehird: So, in (a[)*3b(]c)*3 if the second time through the loop the [ finds zero, you'd need to execute c]c to preserve the semantics 19:13:33 But, how do you figure that out without expanding all of the code 19:13:37 And that's the problem. 19:13:42 END OF LINE 19:14:34 green 19:17:22 damn, EgoBot still hasn't recovered 19:17:22 !ps 19:17:48 Guess they're not real processes then 19:18:30 what did you do to it, anyway? 19:20:01 -!- ehird has quit (Remote closed the connection). 19:20:13 -!- ehird has joined. 19:20:28 !sh pidof bfjoust 19:20:30 /tmp/input.11841: line 1: pidof: command not found 19:21:03 sticking to 80 columns with tabs @ size 8 kills me 19:21:06 but my code thanks me 19:21:17 19:20 ehird: Disconnecting from stoned server. 19:21:22 erm my bouncer doesn't like potheads 19:23:33 i mean 19:23:39 let's say you have a for loop, looping through a thing 19:23:43 and inside, a switch on its value, right? 19:23:54 at some point you want a conditional in one of these cases 19:23:59 you know, just to make sure everything's okay 19:24:03 fprintf(stderr, "Unmatched ] in %s.\n", filename); 19:24:07 KRRRRRRRRRR OVER 80 COLUMNS 19:24:22 i submitted that code with the *3000s earlier 19:24:29 but i replaced it with the original slowrush so it wouldn't slow things down 19:24:42 ehird submitted some trash earlier, but i didn't think he expanded simple ()*Ns 19:24:45 so i don't really know what's wrong 19:24:57 nescience: i charge you with not being sympathetic to my pain. 19:25:25 lol, i read the buffer top down 19:25:53 in fact, it's only 4 indents 19:25:58 80 columns :\ 19:25:58 that's within Linus's law 19:25:59 -!- psygnisf_ has joined. 19:26:05 I HATE YOUUUUUUUUUUUUUUUUUUUU :| 19:26:07 not you 19:26:07 you 19:26:32 ehird: You put the switch in a separate function 19:26:59 Deewiant: Aha. BUT! The switch mutates a local variable SOMETIMES. 19:27:04 Also, in one case it does a continue;. 19:27:07 ehird: Pass a pointer 19:27:14 Deewiant: IT ALREADY IS A POINTER 19:27:18 ehird: ******************* 19:27:21 I'm not going to go around like a dolt going (*ins)-> 19:27:24 I AM A ONE-STAR PROGRAMMER. 19:27:37 I'm an aleph-null-star programmer 19:28:18 Deewiant: but i did put it in another function 19:28:22 the thing is 19:28:33 the continue; stops ins++ happening after the switch (but in the for) 19:28:37 the rest just break; out from the switch 19:28:47 i can't think of a nice way to handle that 19:28:48 So have it return a bool 19:28:52 Deewiant: EXCEPT 19:28:52 if (foo) continue; 19:28:58 I already return ins— oh, wait. 19:29:02 Yeah. Yeah, that would work. 19:29:03 More ****** 19:29:11 Deewiant: BUT! But. No, wait, that's fine. 19:29:12 Okay then. 19:29:15 Uh, thanks. 19:29:26 FWIW it sounds like it's actually quite crap :-P 19:29:33 Deewiant: What is 19:29:36 It's just a parser man 19:29:46 All this mucking about just to avoid a level 4 indentation level 19:29:56 Sounds like it's obfuscating the code quite a bit 19:29:57 Deewiant: I don't want to avoid that 19:30:08 Deewiant: It's just that my code had some seriously long lines before. 19:30:15 So I'm refactoring it like crazy to 80 columns. 19:30:17 It seems to be helping. 19:30:38 Yeah, I'm just saying that in this instance it sounds like it's just making things worse 19:30:43 But maybe not, beats me. 19:30:49 Yeah, well 19:30:50 your mom. 19:30:57 ehird: bought a computer better than mine yet? 19:31:08 Deewiant: haha, except this function needs a parameter from the caller :-) 19:31:13 bsmntbombdood: No. Soon. 19:32:19 -!- nooga has quit (Read error: 104 (Connection reset by peer)). 19:33:33 Deewiant: Oh, I just realised that making a new struct would help here. 19:33:48 ehird: Damn, I was just about to suggest that :-P 19:33:54 Specifically, almost all the parameters can be passed around in one struct. 19:34:07 Yep, that's what I was guessing 19:34:15 * ehird underlines the already-existing note in eir mental refactoring cookbook: When in doubt, add more data structures. 19:37:09 'Nother thing (mostly aesthetic): Don't use structs without pointers. Generally. Because -> vs .'s ugly. 19:37:18 -!- psygnisfive has quit (Connection timed out). 19:37:20 It has been a while since I wrote a C program. 19:40:09 i need to finish that filesystem 19:40:53 Deewiant: Heh. Also, one of them breaks out from the enclosing loop :-D 19:41:07 But I can do that with a return parameter, as the original one is handled by the function itself 19:41:13 yes, i like to do (&foo)->bar just to avoid that ugly . 19:41:18 haha 19:44:15 Deewiant: guess what 19:44:23 adding a struct changed filename to parser->filename in the printf 19:44:26 thus bringing it— wait for it— 19:44:29 back over 80 columns 19:44:32 :-D 19:44:34 GAHAHAHAHA 19:44:50 Well, printfs can usually be broken over multiple lines 19:45:03 Unless parser->filename itself exceeds 80 columns at that indentation level 19:45:13 fprintf(stderr, "Unmatched ] in %s.\n", 19:45:14 parser->filename); /* this makes me feel like a 19:45:15 dolt */ 19:45:21 hanging out in ##c is painful 19:45:23 You can align stuff 19:45:36 Deewiant: I know, but it's such a trivial statement that it hurts. 19:45:37 bsmntbombdood: o? 19:45:39 If you have 8 columns' worth I'd line break after stderr 19:46:03 Deewiant: Ooh! 19:46:06 return 0; 19:46:06 } else { 19:46:19 utterly idiotic questions, no one seems to speak english 19:46:19 YAY ANOTHER LEVEL OF INDENTATION FOR FREE 19:47:56 lance.c:92: error: conflicting types for ‘parse_inner’ 19:47:56 lance.c:67: error: previous implicit declaration of ‘parse_inner’ was here 19:47:57 ↑ i did parser_inner(parser);, so it inferred the type as void even though that's not mandatory, lawl 19:48:08 wtf are you writing 19:48:08 guess i need a bunch of redundant function declarations 19:48:10 woop woop, C 19:48:18 bsmntbombdood: a better BF Joust 19:49:51 -!- Judofyr has joined. 19:51:14 -!- KingOfKarlsruhe has joined. 19:51:42 so an angel came down to me and said 19:51:48 "EHIRD 80 COLUMNS DOESN'T MATTER" 19:51:49 and 19:51:51 I punched it 19:51:52 in 19:51:53 the face. 19:51:58 and said "FUCK YOU, ANGEL." 19:52:17 I stick to 80 columns, but with 3-column tabs 19:53:11 I figure that most people these days don't care about 80 columns and use 4-column tabs, so it's fine for those folks 19:53:35 Deewiant: ais523 has been adamant at yelling at me that tabs are defined to be exactly 8 spaces 19:53:42 and I have been adamant at replying to him that that's total bullshit and he's wrong. 19:53:45 fun times 19:54:01 Deewiant: (this is when telling him not to use mixed tabs and spaces because tabs != always 8 spaces) 19:54:04 Not 8 spaces, they're defined to be "indent to the next column whose position is a multiple of 8" 19:54:08 But yeah. 19:54:17 no, they're not 19:54:25 they're defined to be "indent." 19:54:33 Well yeah. 19:54:53 But that's the default position adopted by most tools. 19:56:57 ais523 said it was "8 spaces", always, both in theory and practice 19:57:08 programs I have here and what tab what was originally meant to mean disagrees 19:57:11 *disagree 19:58:38 Upon pondering it a bit, I do think that their definition is "indent to next tab stop" where "tab stops" vary from implementation-defined to freely modifiable by the user 20:03:29 -!- BeholdMyGlory has joined. 20:05:03 Wow, how have you people managed to eff up EgoBot :P 20:05:41 I believe by running bfjoust programs that do tonnes of macro expansion 20:06:05 Hmm, you can't prefix "I believe" into a sentence like that directly :-/ 20:06:31 Score for ehird_fuck: 12.5 20:06:31 Score for leonid__lols: 13.9 20:06:32 Score for Deewiant_scrooge: 11.8 20:06:32 Score for ehird_turnintoagreenthing: 4.3 20:06:57 Whoo, scrooge beat shade 20:07:04 GregorR-L: so if my super-awesome polarity-makin' tournamentin' mega-fastin' interp is finished, will you use it or should I not bother :-P 20:07:21 (yes, nescience, with your magical avoid-expanding-macros thing. <_<) 20:07:33 I wrote egojoust because you seemed to have lofty goals. 20:07:36 If it's done, sure. 20:07:58 It's donning itself presently. 20:08:02 The goals aren't really lofty 20:08:11 Just "run the program a fuckload of times then average that" 20:08:28 Is "a fuckload" = 21? 20:08:45 No. 20:08:49 That does not take into account... 20:08:52 PoLaRiTy! 20:08:57 Any choice between: SIEVE, and: KETTLE! 20:09:10 ..................................................... 20:09:26 GregorR-L: Trust me, it's a good idea. Other players say so. The fact that the names make no fucking sense is irrelevant. 20:09:27 GregorR, why 21 to be specific 20:09:36 AnMaster: 21 possible tape lengths 20:09:41 ah 20:09:42 GregorR-L: Just know that it involves reversing dink and donk. 20:09:46 well that sounds like a good idea too 20:09:54 oh 20:09:57 with two polarities 20:10:01 GregorR-L: So it's actually— you will shit your pants— FORTY-TWO runs. 20:10:06 that mean 42 combinations 20:10:09 Yep. 20:10:10 :D 20:10:10 But the directions are designed to make no difference. 20:10:12 Verily, the spirit of Douglas Adams is in this implementations. 20:10:16 GregorR-L: Nothing to do with directions. 20:10:32 I don't understand what "polarity" means in this context. 20:10:37 Seeing as that you haven't explained it. 20:10:52 GregorR-L: Basically, if polarity is sieve, + and - do the normal thing. If polarity is kettle, for one program (either, it doesn't matter), + and - are swapped. This stops you stealing someone's program and swapping +/- and rising to the top of the hill, which is boring, and yet still makes you defend against both [+] and [-], etc. 20:10:54 GregorR-L, swaps plus and minus. 20:11:03 Or, yeah, what AnMaster said, but I explained why. 20:11:20 And if you implement that I will sue you for infringing my imaginary patents. 20:11:27 Ah. 20:11:27 -!- Slereah_ has joined. 20:11:31 ehird, since we sent them same second *shrug* 20:11:37 IMAGINARY 20:11:38 PATENTS 20:11:47 You know like imaginary numbers, they have a real part and an imaginary part? 20:11:48 ehird, I never planned to implement joust 20:11:51 They have the power of two fucking numbers. 20:11:54 since I'm like. Not interested in them 20:11:57 it* 20:11:58 (AnMaster: I meant GregorR-L, kthx.) 20:12:01 ah 20:12:02 ok 20:12:02 GregorR-L: Right? So, imaginary patents, 20:12:04 They have the power 20:12:05 of 20:12:07 TWO GODDAMN PATENTS. 20:12:10 You don't want to fuck with that. 20:12:17 um 20:12:21 You know like imaginary numbers, they have a real part and an imaginary part? <-- wrong 20:12:25 complex number does 20:12:28 numbers* 20:12:39 ......................................... 20:12:48 AnMaster: Imaginary numbers are a subset of complex numbers. 20:12:54 I meant to say complex, but I was not technically wrong. 20:12:54 ehird, so they are 20:12:59 Anyway, shut up. 20:13:04 DOUBLE PATENT POWER. 20:13:10 ehird, the imaginary subset are the ones without real parts 20:13:13 :P 20:13:21 AnMaster: No, 0 or <0 real parts. 20:13:28 Your face is the one without real parts. 20:13:40 GregorR-L: I HAVE AN IMAGINARY PATENT ON YOUR FACE. 20:14:04 So, the question is, can you implement this before I can get it into egojoust? X-P 20:14:07 RACE RACE RACE 20:14:11 GregorR-L: No. 20:14:14 I can't. 20:14:20 anmaster: complex numbers do* 20:14:23 ehird, right, I wasn't technically wrong either, since in effect you can consider it like "no real part" (and that is how you write them: 2i not 0+2i) OR the technically correct "real part is zero". 20:14:31 ehird: What you don't realize is that I'm too lazy to put it in egojoust. 20:14:36 AnMaster: Real part is zero OR LESS THAN ZERO. 20:14:38 kthx 20:14:44 GregorR-L: I HAVE AN IMAGINARY PATENT ON LAZINESS 20:14:54 -2+4i is complex isn't it? 20:14:57 In fact, I have an imaginary patent on everything, including not having an imaginary patent on something. 20:15:05 AnMaster: [[Imaginary number]] 20:15:19 anmaster: yes, its complex. 20:15:57 Okay, now I'm going to imaginary work on my implementation. 20:16:09 You know it's true, brotha. 20:16:53 "Although Descartes originally used the term imaginary number to mean what is currently meant by the term complex number, the term imaginary number today usually means a complex number with a real part equal to 0, that is, a number of the form i·y. Zero (0) is the only number that is both real and imaginary." 20:16:59 AnMaster: [[Imaginary number]] <-- from there 20:17:13 DESCARTES FTW 20:17:25 I can't find where it says "or less than zero" 20:17:34 does it need to anmaster? 20:17:38 it says real part. 20:17:50 real numbers range from (-inf, +inf) 20:17:58 "the term imaginary number today usually means a complex number with a real part equal to 0" 20:18:11 but ehird claims it means "real part equal to zero or less than zero" 20:18:28 oh. what? no. an imaginary number is any real multiple of i. 20:18:28 oh, wait 20:18:32 [[In mathematics, an imaginary number (or purely imaginary number) is a complex number whose squared value is a real number less than or equal to zero.]] 20:18:43 i am the dumb 20:18:49 agreed! 20:18:49 ehird, As usual! 20:18:56 butts 20:18:57 -!- psygnisf_ has changed nick to psygnisfive. 20:18:58 ehird, and I'm right (as usual) 20:19:00 ;P 20:19:07 but i still love you ehird, dont worry 20:19:09 AnMaster: AND YOU'RE GAY 20:19:09 AS USUAL 20:19:10 I shall forever treasure this moment. 20:19:12 AND SO'S YOUR FACE 20:19:13 AND YOUR MOM 20:19:15 AND STUFF 20:19:41 ehird, s/AnMaster/psygnisfive/ and at least one of those claims would be correct instead of incorrect. 20:19:52 WOW GUYS AMAZING NEWS psygnisfive is *GAY* 20:20:00 HOLY HELL HE SEXUALLY PREFERS MEN TO WOMEN. LET'S MENTION IT 20:20:00 AND STUFF 20:20:03 YES 20:20:04 AND STUFF 20:20:11 lawl my parser is O(n^2) because I use strlen() to allocate the result kekekekeke 20:20:13 who cares 20:20:17 >_< 20:20:21 i like big COCKS and i cannot lie 20:20:27 Deewiant: beats reallocating every 3 seconds 20:20:31 ehird: GCC might actually be able to optimize that away 20:20:35 (At least) 20:20:38 Deewiant: It's user input 20:20:44 EgoBot will break if you give it megabytes of raw input anyway 20:20:46 ehird: I mean, repeated calls to it 20:20:48 guys 20:20:51 I only use strlen() once, Deewiant 20:20:56 But then I loop thru da string 20:21:02 do you happen to know of any really good textbook download sites? 20:21:03 So where's the ^2 20:21:25 ehird, sorry, I thought wrote the wrong nick, since the claim wasn't valid for me I considered the other people present and talking. Thus I came to the conclusion you meant psygnisfive. I don't know why you like to mention it. 20:21:28 Deewiant: O(n) - strlen(). O(n^2) - looping through the string again. 20:21:37 AnMaster: YOU'RE BLACK. 20:21:40 ehird: strlen() has __attribute__((pure)). ;) 20:21:41 ehird: Uh, how is looping through a string O(n^2) 20:21:52 Is that not O(2n) 20:21:57 Er. 20:21:58 Yes. 20:22:00 wtf is O(2n) 20:22:00 Yes it is. 20:22:05 But O(2n) = O(n). 20:22:08 Deewiant: Which is O(n). 20:22:10 O(2n) is short for O(2 * n) which is O(n). 20:22:12 ohay it's back 20:22:13 i hate that shit 20:22:13 ill take it you dont, so: gigapedia.com 20:22:19 It's just that "O(n)" is an unhelpful way to say "hay I loop twice" 20:22:28 with some weird bugs 20:22:38 Then say O(2n) 20:22:39 at least i'm back on top of the hill :> 20:22:41 ehird, technically wrong too. And I don't know anyone in here who is. Since I don't care about skin colour. However you might have meant that my current clothes are indeed black? A pair of black socks. And a black t-shirt. 20:22:53 Even if it's equal to O(1000n) most people assume that the constant within is meaningful somehow :-P 20:22:56 ehird: If thou wert smart, then thou wouldst keep the string size. 20:22:57 AnMaster: THUS YOU ARE BLACK!!!!!!1731263712537638273621873ELEVENTYONE 20:23:05 pikhq: Erm, I don't need it again. 20:23:08 pikhq: After parser->ins = xmalloc(sizeof(ins_t) * strlen(source)); 20:23:10 I just do 20:23:12 while ((c = *parser->source)) { 20:23:14 xmalloc! 20:23:21 xyzmalloc 20:23:26 struct string {char *cstr;size_t size;}; 20:23:29 Deewiant: Also known as "goddammit libc, get some fucking error handling system." 20:23:34 pikhq: Why?! I only need it once! 20:23:37 To allocate the string! 20:23:41 What benefit does that get me at all in this case? 20:23:45 *allocate the instruction array 20:23:51 Oh. 20:24:04 Well, anyways. 20:24:19 xmalloc should have __attribute__((malloc)). :p 20:24:28 Wtf is that 20:24:29 pikhq: what does that do? 20:25:02 gcc has an attribute for everything 20:25:04 ehird, I don't think either "ELEVENTYONE" or any variant of splitting that ("ELEVENTY", "ONE"), ("ELEVEN", "TY", "ONE") or ("ELEVEN" "TYONE") is a valid (set of) number(s). 20:25:06 __attribute__((strfry)) 20:25:12 AnMaster: Shut up. 20:25:15 Informs GCC that any non-NULL pointer it returns doesn't alias with any other valid pointer. 20:25:28 -!- Sgeo has joined. 20:25:36 pikhq, indeed, so it does. 20:25:43 __attribute__((solve-halting-problem)) int main(); 20:25:48 Deewiant, doesn't exist 20:26:04 AnMaster: Forty = 40. Fifty = 50. Therefore, foo-ty = foo0. Eleven = 11. Therefore, eleventy = 110. One hundred one = 101. THEREFORE, Eleventy-one = 111. 20:26:07 I thought gcc has an attribute for everything :-( 20:26:13 Doesn't exist? 20:26:16 OMGWTFBBQ HOW COME!!11 20:26:18 eleventy 20:26:21 one. 20:26:23 point one. 20:26:24 ehird, interesting 20:26:38 ehird, Onethousandtytyty? 20:26:46 pikhq: isn't that the same as returning restrict? 20:26:46 = 1000000 20:26:47 what would that be 20:26:48 hm 20:26:49 ok 20:26:58 ehird, ity 20:27:01 You might also want to give that __attribute__((alloc_size(1))). 20:27:07 AnMaster: i*10 20:27:15 -!- Slereah has quit (Connection timed out). 20:27:17 ehird, "Therefore, foo-ty = foo0." 20:27:21 AnMaster: yes 20:27:24 and that's = foo*10 20:27:25 so it would be the non-sense "i0" 20:27:31 I was abbreviating informally. 20:27:31 i0 isn't nonsense 20:27:34 i0 = i * 0 = 0 20:27:37 That's true too. 20:27:40 But foo-ty is obviously foo*10. 20:27:50 Deewiant, sure. But according to that definition of ty then 10 is 1*0 :P 20:27:52 So ity = i*10 = 10i. 20:28:02 ehird, right 20:28:12 (= -i) 20:28:29 AnMaster: No, it isn't 20:28:46 onety is still 1*10 = 10 20:29:26 Whereas onety and crumpets is 10 + crumpets 20:29:30 lance.h:14: warning: comma at end of enumerator list 20:29:32 WHY IS THAT A WARNING. 20:29:32 Indeed 20:29:42 ehird, is that gcc 20:29:44 warning: you appear to be using GCC 20:29:45 yes 20:29:47 -Wall -pedantic 20:29:50 well 20:29:56 is it allowed by C89 then 20:29:59 ehird: I'd say it's because of -pedantic :P 20:30:02 Yes, AnMaster. 20:30:10 GregorR-L: It's not an error. It's not bad. It's good practice, for when you add new values. 20:30:12 ok... why does -pedantic warn about that... 20:30:22 I believe some pre-C89 compilers choke on that. 20:30:23 and I agree with ehird here 20:30:25 __attribute__((dont_fucking_warn_me_about_that_kind_of_shit_okay_btw_this_applies_to_the_whole_program_you_hear_me_question_mark)) 20:30:32 ↑ An attribute gcc needs. 20:30:33 ehird: Try -std=c89 20:30:36 Deewiant: Yes. I did. 20:30:37 Deewiant, good idea 20:30:39 ehird: -ansi? 20:30:40 CFLAGS = -std=c89 -Wall -pedantic 20:30:40 ifdef DEBUG 20:30:41 CFLAGS += -g 20:30:43 else 20:30:45 CFLAGS += -O3 20:30:47 endif 20:30:49 Deewiant: -ansi = -std=c89 20:30:53 D'oh 20:30:55 ehird, so you don't allow -march=native there 20:30:58 LOL WUT 20:31:00 Oh 20:31:00 nm 20:31:04 I thought adding -ansi fixed it 20:31:06 but I removed the comma 20:31:06 lol 20:31:09 AnMaster: Vut? 20:31:09 :-P 20:31:19 AnMaster: Oh, does that like, use i7 on an i7? 20:31:33 ehird, CFLAGS="-march=native -pipe" make will not use the -march setting in there 20:31:39 -!- Corun has joined. 20:31:49 It optimizes code for the host CPU, allowing code that is invalid for other CPUs 20:31:51 AnMaster: What the fuck are you talking about, sir? 20:32:07 ehird: He's talking about you overriding any outer CFLAGS 20:32:14 Oh. 20:32:14 ehird, if that above is your makefile then the cflags user set in environment will be ignored 20:32:19 which may contain important bits 20:32:28 Ehm, I've done CFLAGS=butt since forever. 20:32:28 like -march, -m32/-m64 and what not 20:32:30 Everyone does that. 20:32:32 -!- BeholdMyGlory has quit (Remote closed the connection). 20:32:53 what about: 20:32:54 CFLAGS ?= -march=generic 20:32:58 So, what do I use instead? 20:33:03 CFLAGS += -std=c89 -Wall -pedantic 20:33:05 and so on 20:33:11 kay 20:33:15 -march=generic? Is that just the default setting? 20:33:15 err 20:33:16 wait 20:33:21 % make -n 20:33:21 cc -std=c89 -Wall -pedantic -O3 -march=native lance.c -o lance 20:33:22 -mtune=generic 20:33:24 is needed 20:33:31 it doesn't work for march 20:33:37 since that is default 20:33:47 * GregorR-L lols at "cc" 20:33:48 err 20:33:50 I mean 20:33:51 -march supercedes -mtune 20:33:53 AnMaster: what about defining CC? "CC ?= gcc" doesn't work, as make defines its own default. 20:34:00 -march defaults to i386 still iirc 20:34:08 -mtune=generic does "for the most common current cpus" 20:34:29 ehird: CC = gcc works, as when people override CC they don't want the CC in the Makefile at all. 20:34:33 ehird, hm.. It defines it to the CC. User can override it in the environment 20:34:42 GregorR-L: Kay. 20:34:54 lance.c:1: error: bad value (native) for -march= switch 20:34:54 lance.c:1: error: bad value (native) for -mtune= switch 20:34:56 GregorR-L: Don't. 20:34:58 Guess my gcc 4.1 is too old huh? 20:34:59 ehird, too old gcc 20:34:59 Also, lolporridge. 20:35:00 for that 20:35:03 ehird, yes. 20:35:05 AnMaster: Then it's not very useful for me. 20:35:07 Make defines CC. 20:35:18 pikhq: I know that, but it defines it to cc on most systems, which is stoopid. 20:35:19 export CC=gcc-4.2 20:35:21 make 20:35:30 AnMaster: No, thanks. 20:35:31 pikhq: This code clearly will not compile with non-gcc. Esp. with those CFLAGS :P 20:35:35 ehird: And on all systems, cc is the C compiler. 20:35:36 ehird, it should clearly define it to /usr/bin/c99 20:35:37 :P 20:35:49 pikhq: And on all systems, cc takes -O3 -std=c89 -Wall... hmm, wait, no. 20:35:53 AnMaster: I don't want to require twiddling for OS X users. 20:35:54 which is the only one found in POISX 2008 (iirc!) 20:35:59 So >gcc4.1 things are out of the question 20:36:07 POISX! 8-D 20:36:12 And that's why you probably shouldn't define CFLAGS. :p 20:36:13 ehird, right. But the -march=native was for what user defines in envrionment 20:36:16 and 20:36:20 POS, icks. 20:36:21 your makefile should respect it 20:36:27 20:36 pikhq: And that's why you probably shouldn't define CFLAGS. :p ← youuuuuuuuu're barmy 20:36:28 ehird, that was my point 20:36:44 if nobody defined cflags everyone would get -O0, warningless compiles :) 20:36:47 This is why you should use autoconf. 20:36:52 GregorR-L: HAHAHAHA 20:36:53 * ehird punches GregorR-L 20:36:55 ehird, on legacy systems like OS X the user would define CFLAGS to be something like -march=core2 (or is the gcc too old for that as well?) 20:36:55 Stop that. 20:37:07 AnMaster: ehird, on legacy systems like OS X ← ENOTREADINGRESTOFLINES 20:37:15 ehird: You're making portability damned difficult. I HATE yOU FOR THAT. 20:37:15 Also, you have to use gcc-4.2(1) to use -march=core2 :P 20:37:19 ehird, it was a joke 20:37:20 duh 20:37:27 let me rephrase it 20:37:28 AnMaster: So was mine 20:37:31 ah ok 20:37:35 Also, there are non-Core2 current Macs. 20:37:45 The Mac Pro uses Xeon Nehalems. 20:37:47 ehird, then they define -march=whatever 20:37:48 (not i7, Xeons) 20:37:49 that they want 20:37:53 AnMaster: I know, I know. 20:37:59 pikhq: yeah they have to change one line in the makefile :))) 20:38:01 GregorR-L: He seems to think that everyone runs GCC, and specific versions of it at that. 20:38:08 ... what? 20:38:12 I just said I wasn't using anything >gcc4.1. 20:38:18 pikhq: That's because everyone does run GCC :P 20:38:23 And for that, I keel you. 20:38:24 pikhq: Are you SERIOUSLY arguing that I should not define CFLAGS? 20:38:30 ehird: Yes. 20:38:34 Is your MIND on a SATELLITE in OUTER SPACE? 20:38:35 GregorR-L: He seems to think that everyone runs GCC, and specific versions of it at that. <-- ehird? Seems so 20:38:37 That's what autotools is for. 20:38:38 yeah 20:38:39 Is it communicating with your body from down here? 20:38:43 Is it going, oh, 20:38:47 the distance is so long 20:38:50 ehird, anyway that makefile isn't going to work at all with icc! 20:38:50 I'd better keep the thoughts short 20:38:55 So let's not define any CFLAGS! 20:38:58 . 20:39:00 Also, use autohell. 20:39:04 * GregorR-L lollercopters. 20:39:06 ehird, so you better check if you have GCC before you add the cflags 20:39:08 That's always a good idea. Replace a 15 line makefile. 20:39:12 With the autotools shitfest. 20:39:16 you can add -O usually 20:39:26 SYNOPSIS 20:39:26 c99 [-c][-D name[=value]]...[-E][-g][-I directory] ... [-L directory] 20:39:26 ... [-o outfile][-Ooptlevel][-s][-U name]... operand ... 20:39:27 This is pikhq's satellite brain, reporting from dumbville, in orbit around Earth! 20:39:31 that is what POSIX says about syntax 20:39:34 Replace a 15 line makefile with a 3 line makefile and an automatically generated autoconf.ac? :P 20:39:38 (not that it matters a lot) 20:39:45 -!- myndzi\ has joined. 20:39:50 For such a simple program, Autotools is easy. 20:39:52 GregorR-L, use cmake? 20:39:58 ARGH YOU PEOPLE ACTUALLY ADVOCATE AUTOTOOLS I'M GOING TO JUMP OFF MY ROOF YOU'RE ALL EVIL PEOPLE WHO ARE RUINING SOFTWARE 20:39:59 it is even easier 20:40:00 * GregorR-L wurves stirring the pot. 20:40:02 Cmake is also acceptable. 20:40:09 ANYONE WHO USES AUTOTOOLS WILL FEEL MY WRATH 20:40:33 cd ehird/ && ./configure --without-annoyingness && make -j6 20:40:38 about 5 or 6 lines cmake script if you want to "add cflags if gcc". 20:40:41 trivial still 20:40:43 GregorR-L: THERE IS ONLY ONE FUCKING TARGET 20:40:51 HOW CAN YOU RUN ONE TARGET 6 TIMES AT ONCE 20:40:55 ehird, multiple files right? 20:40:56 YOU'RE MAD! 20:40:58 AnMaster: No. 20:41:03 ehird: For multiple target CPUs! 20:41:03 ehird: Run your code on more than two targets and you will thank Autotools. 20:41:04 ehird, then why a makefile 20:41:06 Profusely. 20:41:08 ehird: You're saying that you're one file? :P 20:41:10 AnMaster: for "make clean" :P 20:41:14 GregorR-L: YES! 20:41:21 pikhq: Good god. 20:41:21 Deewiant, that requires separate configurations 20:41:23 CFLAGS += -std=c89 -Wall -pedantic 20:41:23 ifdef DEBUG 20:41:23 afaik 20:41:24 CFLAGS += -g 20:41:26 else 20:41:28 CFLAGS += -O3 20:41:30 endif 20:41:32 .PHONY: clean 20:41:34 lance: lance.c lance.h 20:41:36 @$(CC) $(CFLAGS) $< -o $@ 20:41:38 clean: 20:41:40 @rm -f lance 20:41:42 AND JUST USING C89! 20:41:44 ARE YOU, pikhq, SERIOUSLY SUGGESTING I NEED AUTOTOOLS, CONFIG.H, PARALLEL MAKE, 20:41:46 MULTIPLE FILES, 20:41:48 IFDEFS EVERYWHERE, 20:41:50 PORTABLE ACROSS C COMPILERS TO AVOID WRITING ONE MORE LINE 20:41:54 WHERE IS YOUR MIND! >______< 20:42:02 * GregorR-L stiiiiiiiiiirs the pot. 20:42:08 Stirry stirry stir stir stir 20:42:12 GregorR-L, what pot 20:42:17 ehird: I'm saying that you need to write your code right, or else I kill you. 20:42:18 It's an expression. 20:42:22 AnMaster: The pot that pikhq is on. 20:42:24 This is the road that leads to IRAF. 20:42:31 It seems to be some pretty potent shit. 20:42:35 Not familiar with IRAF? 20:42:37 THIS IS THE ROAD THE LEADS TO IRAQ 20:42:48 Get its code, and weep. 20:42:50 Anybody who doesn't use autotools is a TRRRRRIST 20:43:03 A TRYST 20:43:05 I spent a fucking month trying to get it to build right. 20:43:15 Hahahahaha pikhq is lecturing me about not using autotools and using portability macros and using multiple files and not making sure my 15-line makefile handles all c compilers even though I use c89. 20:43:16 Working full-time on it. 20:43:18 ehird, so that will cross compile to ARM correctly. The cross toolchain running on a SPARC. (The cross toolchain targeting ARM was compiled on a MIPS btw)? 20:43:19 This is hilarious. 20:43:21 ;P 20:43:22 He is batshit insane. 20:43:28 AnMaster: Should do. 20:43:29 (the last statement there didn't matter) 20:43:33 It's just fucking C89! 20:43:36 ehird, and icc? 20:43:44 ehird: Just use a GNU extension in your code and you'll satisfy him 20:43:50 icc: command line remark #10148: option '-pedantic' not supported 20:44:00 AnMaster: No. "icc -O3 lance.c -o lance" 20:44:04 Oh snap that was *hard* 20:44:06 Deewiant: Okay, I'll prefix a random function name with g. 20:44:06 ehird: For a such a simple project, autotools is trivial. 20:44:07 ;) 20:44:16 ehird, um " CFLAGS += -std=c89 -Wall -pedantic" above 20:44:17 pikhq: I WANT TO STOMP ON YOUR BRAINS ;_; 20:44:17 :P 20:44:23 AnMaster: So don't use the god damn Makefile. 20:44:34 ehird, lets see what clang does here... 20:44:49 oh and open64 and tcc 20:44:54 Let's see what openwatcom does 20:44:55 You guys have driven me to suicide for the 5,000th time. 20:44:58 * AnMaster boots the computer with them on 20:44:58 And Turbo C 20:44:59 Bubye 20:45:01 Don't forget dmc and bcc 20:45:01 And Microsoft C 20:45:07 ah yes 20:45:07 AnMaster: djgpp, too. 20:45:09 GregorR-L: Altair BASIC 20:45:10 that would be /O4 there? 20:45:12 or something 20:45:14 ehird: :-D 20:45:15 See what Altair BASIC does to it 20:45:31 ehird: We've been naming things that we actually test code on. ;) 20:45:34 -!- myndzi has quit (Read error: 113 (No route to host)). 20:45:37 anyway I don't have turbo c, msvc or any of the other ones 20:45:40 pikhq: Exactly, Altair BASIC. 20:45:45 I bet it doesn't run my unportable code. 20:45:46 GregorR-L: I seem to recall that you tested CPlof on DJGPP. 20:45:47 OH THE HORROR 20:45:53 pikhq: And OpenWatcom. 20:45:59 ehird: We've been naming things that we actually test code on. ;) <-- indeed 20:46:04 pikhq: But it used a different build system, because I'm not a lunatic :P 20:46:04 seriously! 20:46:05 pikhq: i'm even planning to include a volatile asm with the body "nop" in my code 20:46:08 GRATUITOUS UNPORTABILITY 20:46:12 SQUEAL, pikhq! 20:46:13 SQUEAL! 20:46:15 GregorR-L: Fair enough. 20:46:45 ehird: See, it's fair enough when I do it, it's only when you do it that it's bad. 20:46:51 ehird: I GET PAID TO MAKE STUFF WORK RIGHT. I HATE YOU AND SENTENCE YOU TO 50 YEARS OF PORTING YOUR CODE TO DIFFERENT ARCHITECTURES WITHOUT USING MORE THAN MAKE. 20:47:07 $ ~/local/tcc/bin/tcc -std=c89 -Wall -pedantic -g -O3 -o hello hello.c 20:47:07 tcc: invalid option -- '-std=c89' 20:47:08 pikhq: I THINK THE PROBLEM HERE IS THAT YOUR JOB SUCKS 20:47:08 pikhq: I had that job at Intel for a while :P 20:47:15 $ ~/local/tcc/bin/tcc -Wall -pedantic -g -O3 -o hello hello.c 20:47:15 tcc: invalid option -- '-pedantic' 20:47:28 other than that the flags work for it 20:47:29 tcc is obsolete :( 20:47:32 GregorR-L: Well aware. 20:47:36 GregorR, so it is. 20:47:37 I ran into your boss last year. :p 20:47:52 pikhq: Oh yeah, I remember you saying something about that. 20:48:00 $ icc -std=c89 -Wall -pedantic -g -O3 -o hello hello.c 20:48:01 icc: command line remark #10148: option '-pedantic' not supported 20:48:01 (just a warning) 20:48:01 GregorR-L: AnMaster yelled at me just because I'm going to buy an Intel processor, I guess working for them is too evil for him to even comment on :) 20:48:02 ehird: What I'd probably do is put the warning stuff only when DEBUG 20:48:26 opencc manages it, since it is based on a GCC frontend 20:48:38 So when your average Joe builds, he won't get that. 20:48:45 Kinda funny. I mentioned Brainfuck. He mentioned "Oh, yeah... Someone who worked for me, Gregor, did that, too." "... Gregor Richards?" "... Yes..." 20:48:46 $ ~/local/llvm/bin/clang-cc -std=c89 -Wall -pedantic -g -O3 -o hello hello.c 20:48:46 Unknown warning option: -Wall 20:48:46 ehird: I worked in their "software portability and converting healthy infants into processor cleaning cloths" department. 20:49:06 :-D 20:49:07 hm doesn't work anyway 20:49:08 GregorR-L: At least you didn't DO UNSCRUPULOUS MARKETING PRACTICES 20:49:12 -!- pingeri has joined. 20:49:18 A $1bn fine just isn't enough, we have to boycott them forever too. 20:49:30 GregorR-L: I'm a sys-admin. Most of what I actually *do* involves RPM, though. 20:49:35 pikhq: RPM? 20:49:36 Oh god. 20:49:50 ehird: For the only sane RPM distro. 20:49:59 pikhq: Paradox detected. 20:50:05 pikhq, what company was that at 20:50:07 Mandriva does RPM well. 20:50:15 oh Intel? 20:50:20 AnMaster: No, GregorR-L worked for Intel. 20:50:24 AnMaster: What, where I ran into Gregor's boss? 20:50:24 You have serious multithreading issues. 20:50:29 I was sent to USENIX. 20:50:53 pikhq, I meant, from what company he was 20:51:01 Intel. 20:51:05 right 20:51:07 GregorR-L worked at Intel. 20:51:10 pikhq found GregorR-L's boss. 20:51:14 Hmmmmmmmmmmmmmmmm what company could it be 20:51:17 ehird, THAT IS WHAT I ASKED ABOUT YES! 20:51:22 YOU DID NOT USE UPPER-CASE, NO. 20:51:42 waaaat 20:51:42 AMDtellol 20:52:05 ehird, I missed the bit about Intel due to working on testing the flags in various compilers 20:52:10 * ehird actually uses the int[pointer] equivalent 20:52:13 -!- pingeri has quit (Client Quit). 20:52:34 ehird, so congrats, that makefile will work in gcc and open64, it will compile with a warning with icc. Apart from that it won't work. 20:52:39 lance.c:92: warning: format ‘%p’ expects type ‘void *’, but argument 3 has type ‘struct _ins_t *’ 20:52:46 -pedantic is shit :) 20:52:54 ehird, that isn't pedantic iirc 20:52:57 it is -Wformat=2 20:52:59 -Wall is shit then 20:53:17 ehird, -Wall -Wextra -pedantic ? 20:53:22 -Wall -pedantic. 20:53:28 AnMaster: http://pastie.org/493136.txt?key=yu7xd3arlhs9vpb0ds1zg ← I think I have some parse tree issues 20:53:32 why no -Wextra 20:53:36 -W -Wall -Werror -pedantic 20:53:53 Deewiant, no 20:54:04 ehird, what program is it parsing 20:54:06 -Wextra is a bumbling pile of shit. Citation: Linus. 20:54:10 AnMaster: [>[-]+] :-P 20:54:12 it doesn't seem listed there 20:54:13 AnMaster: What "no" :-P 20:54:14 I just don't add an EOF node. 20:54:17 ehird, no way 20:54:23 So it runs off the edge of the atpe. 20:54:25 And krrrrrrrr 20:54:44 ehird, wait. that is a trace, no the parse tree? 20:54:49 latter 20:54:56 s/no/not/ 20:54:57 it's a parse tree that has no "OK STOP NOW" node 20:55:07 so it runs into random memory, and here's the fun part: 20:55:08 ehird, that is being dumped? 20:55:21 ins->op["+-><[].@"] (wrong way around for shits and giggles, this is a debug function) 20:55:26 now, when we get into random memory 20:55:31 we then dereference that random memory in my limited size array 20:55:33 which is too small 20:55:35 so we use random memory 20:55:38 to access more random memory 20:55:39 :-D 20:55:44 ehird, it isn't wrong way around. It is perfectly valid 20:55:50 So we get the opcodes c, o, invisible, invisible, invisible. 20:55:51 just not common practise 20:55:53 AnMaster: "unintuitive" then 20:56:22 ehird, easy enough to parse. Doesn't cause any major issues with that. 20:56:38 I know 20:56:42 It's just, you know, ridiculous 20:56:52 (you mean i[ptr] right?) 20:57:05 "+-><[].@"[ins->op] looks even ridiculouslyer 20:57:24 I'm not used to indexing a string literal in code 20:57:32 -!- Corun has quit ("Leaving..."). 20:57:47 the common way tends to be "static const char foo[] = "+-><[].@" 20:57:51 s/"// 20:57:53 or such 20:57:56 as I said, debug code 20:57:57 and then index that 20:58:22 * ehird notes that he's relying on malloc to give him zeroed memory, and fixes that 20:58:32 ehird, what happens if the source contains an a 20:58:49 looks like ins->op["+-><[].@"] will fail then 20:58:51 wait hm 20:58:54 that is reverse map? 20:58:55 wut 20:58:56 oh ok 20:58:56 yes 20:59:02 for debug output yeah 20:59:10 yay, prints correctly now 20:59:16 I just have to make it not rely on malloc zeroing :P 20:59:27 Which is irritating, as I do parser->ins++ wantonly quite a lot. 20:59:28 ehird, mmap() instead 20:59:28 Function time! 20:59:33 AnMaster: Nah. 20:59:38 ehird, then calloc 20:59:48 No, just advance_parser(parser) instead of parser->ins++ 20:59:50 if you need zero 20:59:55 ehird, even better 21:00:05 malloc + handle garbage correctly is the best way 21:00:11 That doesn't handle the first one, but I can set that manually. 21:00:15 Not the prettiest, but meh. 21:00:54 Yay, t'works. 21:01:01 "most significant nibble".... Where on earth did I see that recently... 21:02:26 * AnMaster ponders nibble-endianness 21:02:44 imagine. a short with PDP-endianness for the nibbles! 21:02:59 (short being 16 bit here, but probably shouldn't!) 21:03:07 i used to think endian was at bit-level 21:03:09 * pikhq ponders middle-endian architectures 21:03:16 ehird, there are system with bitendianness 21:03:29 2 = 0100000000000000000000000000000 21:03:30 ehird, but on most systems you can't address individual bits 21:03:48 Sure you can. << and >> FTW. 21:03:59 pikhq, yes. But not as in memory address... 21:04:07 Ah, yes. 21:04:07 which is what is relevant here 21:04:27 bit-endianness isn't relevant when you can't access it like that in memory 21:04:42 * pikhq proposes that x86_128 reuse segment notation for bit addressing. :p 21:04:58 Okay, parsing done. I do not handle (foo)*N or (foo{bar}baz)%N yet. Those can wait. 21:05:04 << and >> (and their corresponding asm opcodes) are defined in terms of arithmetics. Not in terms of memory address... 21:05:07 Time for some hot lovin'^W^Winterpreting. 21:05:17 -!- Slereah_ has quit (Read error: 110 (Connection timed out)). 21:05:29 pikhq, hm? 21:05:50 pikhq, also I think it might be useful with 128 bit GPs, while still being 64 bit. 21:05:56 to speed up ipv6 calculation 21:06:01 (and other stuff) 21:06:08 0xDEADBEEF:8 21:06:08 :p 21:06:20 pikhq, um? 21:06:36 what has that got to do with this 21:06:58 suggestion PDP-endianness on all levels! 21:07:05 s/n /n: / 21:07:17 -!- Slereah has joined. 21:07:38 Not much. 21:07:52 as in, each nibble having such for the bits, then each byte that for the nibbles, each word that for the bytes 21:07:53 and so on 21:08:00 like the idea? 21:08:09 nescience: gimme a crappy tiny bf joust warrior that isn't [>[-]+] 21:08:45 ehird: Grab the http://codu.org/eso/bfjoust/in_egobot/ 21:08:56 Deewiant: Those are neither crappy nor tiny 21:09:04 Also some use ()*N and ()%N. 21:09:06 Some of them are crappy 21:09:10 ehird, [>[-]+] will always run off the end of the tape 21:09:15 and loose? 21:09:17 AnMaster: Ummmm. 21:09:18 No. 21:09:21 And *lose. 21:09:33 AnMaster: It wins when it sets the flag to 0, duh. 21:09:36 ehird, since flag needs to be 0 two cycles in a row 21:09:37 duh 21:09:40 ... 21:09:45 [-]-]-]-(it's zero)](you won!) 21:09:45 ehird: Anyway; [>[+]-] ;-P 21:09:54 Deewiant: Eh, sure. 21:10:14 http://esolangs.org/wiki/BF_Joust 21:10:23 AnMaster: I just explained why it works 21:10:26 "The revised version" 21:10:28 "A program does not lose due to its flag becoming 0 unless its flag is 0 at the end of two consecutive cycles" 21:10:35 You're dense on purpose, aren't you 21:10:36 [-]-]-]-(it's zero)](you won!) 21:10:45 Set to zero by -, another cycle passes by ], and you win. 21:10:49 ah 21:10:51 right 21:10:54 miscounted cycles 21:11:22 !bfjoust lunatic [-] 21:11:26 Score for GregorR-L_lunatic: 9.1 21:11:29 err 21:11:30 HOW 21:11:35 yeah how 21:11:41 GregorR-L, debug it locally 21:11:50 Ties against train2 O_o 21:11:55 Probably others ran off the tape in <128 cycles *shrugs* 21:12:04 Er, GregorR-L. 21:12:09 128*2+1. 21:12:13 [-]-]-]-]-] 21:12:16 In X-P 21:12:32 !bfjoust loony_tick (-)*128[-] 21:12:37 Score for ehird_loony_tick: 9.1 21:12:37 Beats shade, amusingly 21:12:42 Heh 21:12:45 What's shade do again? 21:12:57 Beats me, I don't look at them 21:13:03 !bfjoust dysfunctional [-+] 21:13:07 Score for GregorR-L_dysfunctional: 9.5 21:13:12 heh 21:13:25 !bfjoust i_will_just_wait_here_okay []HI GUYS WHAT'S UP oh, oh I lost. Dayum. 21:13:25 !bfjoust dysfunctional X 21:13:31 Score for Deewiant_dysfunctional: 5.7 21:13:31 !bfjoust lethargic [.] 21:13:32 Score for ehird_i_will_just_wait_here_okay: 5.7 21:13:35 Score for AnMaster_lethargic: 6.2 21:13:35 \o/ 21:13:36 That's really dysfunctional :P 21:13:45 Letting yourself be raped is better than masturbation, this shows. 21:13:52 Case in point: loony_tick does better than i_will_just_wait_here_okay. 21:13:54 And doing better is BAD! 21:14:01 This is good logic okay. 21:14:10 What. Are you all looking at me for. 21:14:11 !bfjoust pensive [[](+)*128] 21:14:14 Stopthat 21:14:15 Score for GregorR-L_pensive: 11.0 21:14:48 0 | 0 0 - - - - 0 0 0 0 - - - - - - - - - + | 6.2 | -12 | AnMaster_lethargic.bfjoust 21:14:50 !bfjoust i_like_big_butts_and_i_cannot_lie ([{-}])%1024 ← this is my butt 21:14:52 it won against shade? 21:14:53 huh 21:14:53 Score for ehird_i_like_big_butts_and_i_cannot_lie: 12.4 21:15:04 !bfjoust i_like_big_butts_and_i_cannot_lie ([-{++}-])%1024 ← this is my butt 21:15:08 Score for ehird_i_like_big_butts_and_i_cannot_lie: 12.6 21:15:16 wait 21:15:23 I guess shade assumes the first nonzero it comes across is a decoy, or something 21:15:34 Deewiant, sounds familiar 21:15:58 !bfjoust loser [>(+)*128] 21:16:02 Score for GregorR-L_loser: 14.9 21:16:10 !bfjoust shade_needs_to_get_laid http://pastie.org/493170.txt?key=6e0w9h8pg7tbirpusvxta 21:16:14 Score for ehird_shade_needs_to_get_laid: 46.6 21:16:16 It's totally bitch-assing. 21:16:34 ehird, how does that one work? 21:16:42 AnMaster: s/[-]/[(-)*128[-]]/ shade 21:16:49 It's totally bitch-assing. 21:17:01 Oh right, that was the one that was manually expanded because the interpreter was broken 21:17:04 GregorR-L, where is defend9? 21:17:16 ... in HELL. 21:17:19 Bitch-ass land!!!!!1 21:17:33 GregorR-L, your interpreter doesn't handle it? 21:17:42 Was there ever a defend9? 21:17:51 I'm sure it would handle it, maybe it just wasn't good enough. 21:17:57 GregorR, wasn't it the one that made it slow down to a trickle? 21:18:16 or was that defend8 21:18:21 defend8 21:18:24 And it's there. 21:18:24 ah ok 21:18:32 Okay, interpreter loop time. 21:18:41 Sirs and gentlemens, I'd like to talk about interpreter loops. 21:18:45 Y'see... they're bitch-assing. 21:18:52 Thank you. 21:18:55 B'bye. 21:19:35 seems like http://codu.org/eso/bfjoust/in_egobot/myndzi_slowrush.bfjoust is the best current one? 21:19:40 Yeah 21:19:42 By a lot. 21:19:56 and that one is even short 21:20:00 and not a mess 21:20:12 impressive 21:20:14 !bfjoust the_unknowable_reversi_of_slowrush >(-)*20>(+)*20>->+>->+>->+(>[[+-----------------[+.]]->]-)*20 21:20:19 Score for ehird_the_unknowable_reversi_of_slowrush: 67.0 21:20:31 GOOD ENOUGH FOR JESUS, GOOD ENOUGH FOR ME 21:20:36 ? 21:20:44 ... 21:20:49 do you have a highlight on jesus? 21:20:57 X-D 21:20:59 ehird, you only do reversed ones... 21:21:03 Sgeo IS Jesus. 21:21:06 AnMaster: Not true. 21:21:09 More correct: 21:21:10 ehird, sorry 21:21:11 mostly 21:21:16 My reversed ones are the only ones that don't get knocked off the hill. 21:21:21 ehird, ah! 21:21:39 ehird, reversed ones are cheating 21:21:44 !bfjoust yodelin_bob_farbenhowm (<)*128 21:21:48 Score for GregorR-L_yodelin_bob_farbenhowm: 2.9 21:21:51 2.9?! 21:21:53 HOW 21:22:01 AnMaster: My interp makes reversed programs = unreversed ones. 21:22:07 With ~*polarity*~ 21:22:08 * GregorR-L wonders why that's 2.9 instead of 0. 21:22:16 because 21:22:23 !bfjoust mc_buttfuck_went_to_town ] 21:22:28 Score for ehird_mc_buttfuck_went_to_town: 16.0 21:22:33 ehird, no that isn't same 21:22:34 BEAT THAT 21:22:39 ...is that even valid? 21:22:41 AnMaster: ? 21:22:43 Sgeo: No. 21:22:47 !bfjoust does_not_parse ( 21:22:52 Score for GregorR-L_does_not_parse: 2.9 21:22:53 Whaaaaaaat the fuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuck 21:22:54 9 | 0 0 - - - 0 0 0 + + - - - - - - - - - + | 16.0 | -9 | ehird_mc_buttfuck_went_to_town.bfjoust 21:22:56 IT WINS 21:23:01 against 21:23:01 8 | - - - - + - + - - - - + + + + + - + - + | 48.2 | -2 | ehird_defend8mwahahaha.bfjoust 21:23:06 HAAAAAAAAAAH 21:23:08 and 21:23:08 10 | - - + + + + + + + - - + - 0 - - - - - - | 42.3 | -3 | ehird_shade_needs_to_get_laid.bfjoust 21:23:10 3 | - - - - - - - - - - - - - - - - - - - - | 2.9 | -20 | GregorR-L_yodelin_bob_farbenhowm.bfjoust 21:23:15 and draws against tons of other 21:23:15 s 21:23:16 XD 21:23:32 !bfjoust oh_mc_farmer_why_dont_you_KRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR [- 21:23:35 * GregorR-L goes to debugglefy why that's 2.9 21:23:35 Score for ehird_oh_mc_farmer_why_dont_you_KRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRR: 19.2 21:24:31 !bfjoust too_long_name_breaks_formatting.bfjoust [-] 21:24:34 Score for AnMaster_too_long_name_breaks_formatting_bfjoust: 11.2 21:24:35 um 21:24:38 ah 21:24:42 !bfjoust . [-] 21:24:46 -!- impomatic has joined. 21:24:46 Score for AnMaster__: 11.2 21:24:52 I like that name 21:25:08 wait what 21:25:10 Whoops, found that bug. 21:25:10 !bfjoust only_your_butt_can_break_the_infinite_mass_of_extreme_formatting_that_is_what_you_have_known_to_be_a_superllllllllllllllllllllllllllllllooooooooooooonnnnng_name_okay_okay_good_that_is_very_good . 21:25:12 that wins against 21:25:14 Score for ehird_only_your_butt_can_break_the_infinite_mass_of_extreme_formatting_that_is_what_you_have_known_to_be_a_superllllllllllllllllllllllllllllllooooooooooooonnnnng_name_okay_okay_good_that_is_very_good: 25.5 21:25:16 11 | + 0 + + + + + + + + + - + + - + + - 0 - | 67.5 | 10 | ehird_the_unknowable_reversi_of_slowrush.bfjoust 21:25:21 !bfjoust loser (<)*128 21:25:24 Nopping = 25.5 points. 21:25:25 Score for GregorR-L_loser: 0.0 21:25:28 !bfjoust this_is_basically_the_same_as_the_anmaster_trivial [+] 21:25:31 Score for Sgeo_this_is_basically_the_same_as_the_anmaster_trivial: 19.2 21:25:35 ... 21:25:43 randomized tape lengths 21:25:45 mine fixes that 21:25:48 with *~averages~* 21:25:49 Maybe it isn't? 21:26:00 it is. 21:26:05 Why is [+] 19.2 and [-] 11.2? 21:26:11 0 | - - 0 - - - - - - + - - - 0 - 0 - - - + | 11.2 | -13 | AnMaster__.bfjoust 21:26:11 11 | + 0 + + + + + + + + + - + + - + + - 0 - | 67.5 | 10 | ehird_the_unknowable_reversi_of_slowrush.bfjoust 21:26:13 that 21:26:20 is what I'm wondering about 21:26:29 AnMaster: It's a puddle of infinity! 21:26:31 wait 21:26:34 10 | - - - + + + + + + + - + - 0 - - - - - - | 41.5 | -3 | ehird_shade_needs_to_get_laid.bfjoust 21:26:40 that is the second line I meant to paste 21:26:45 * Sgeo is confused 21:26:48 how can it loose against that 21:26:51 Where can I learn about BF Joust? 21:26:51 err 21:26:52 win 21:26:54 ehird: So where's your bitchin' sweet interpreter? 21:27:01 !google bf joust 21:27:02 http://google.com/search?q=bf+joust 21:27:04 GregorR-L: Being written this very second, you bitch ass. 21:27:20 ehird: Bitchin' bitchin' bitch bitchin' bitch. 21:27:25 BITCH! 21:27:34 !bfjoust 21:27:34 Use: !bfjoust 21:27:41 !bfjoust a 21:27:41 Use: !bfjoust 21:27:43 meh 21:27:53 I wanted to name my program a space 21:27:59 !bfjoust a 21:28:00 Use: !bfjoust 21:28:01 .. 21:28:38 !bfjoust make_me_a_sammich (>)*10+>->+[[-]>+] 21:28:42 Score for GregorR-L_make_me_a_sammich: 12.0 21:28:43 !bfjoust , 21:28:44 Use: !bfjoust 21:28:44 !bfjoust sleep [.] 21:28:48 !bfjoust test , 21:28:48 Score for Sgeo_sleep: 25.5 21:28:53 Score for AnMaster_test: 25.5 21:29:04 !bfjoust sleep [.] <-- I did that above 21:29:08 oh 21:29:15 !bfjoust iturnedintoa >>>>>>>>>>+[>+][[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]Sandwiches are >++ 21:29:18 Score for ehird_iturnedintoa: 4.8 21:29:24 4.8 21:29:26 Lowest so far 21:29:27 BITCHES 21:29:37 Sgeo, called lethargic 21:29:39 !bfjoust ohai < 21:29:43 Score for Deewiant_ohai: 0.0 21:29:45 ehird: . 21:29:58 FUCK! 21:30:05 !bfjoust negativeplz <<<<<<<<< 21:30:09 Score for ehird_negativeplz: 0.0 21:30:12 HA 21:30:16 my 0.0 is smaller than yours 21:30:17 !bfjoust oh_nose [[](+)*128] 21:30:20 ehird, also GregorR-L did lower than 4.8 before 21:30:22 Score for GregorR-L_oh_nose: 30.3 21:30:31 2.8 or 0 21:30:42 Challenge: Lowest positive score. 21:30:45 !bfjoust oh_you_have_a_nose_i_see (-)*127< 21:30:50 Score for ehird_oh_you_have_a_nose_i_see: 8.5 21:30:59 It weakens itself pitifully, then runs off the tape. But still does okay. 21:31:02 !bfjoust oh_you_have_a_nose_i_see (-)*127[>+] 21:31:06 Score for ehird_oh_you_have_a_nose_i_see: 21.0 21:31:08 !bfjoust oh_you_have_a_nose_i_see (+)*127[>+] 21:31:12 Score for ehird_oh_you_have_a_nose_i_see: 16.5 21:31:14 ;_; 21:31:15 !bfjoust fail >+[.] 21:31:18 Score for AnMaster_fail: 19.0 21:31:21 meh 21:31:31 !bfjoust oh_nose [[--++](+)*128] 21:31:35 Score for GregorR-L_oh_nose: 30.9 21:31:36 !bfjoust ohai (+)*128< 21:31:39 Score for Deewiant_ohai: 11.2 21:31:51 Oh, ehird already did something like that 21:32:01 !bfjoust ohai (+)*22< 21:32:04 Score for Deewiant_ohai: 0.0 21:32:08 !bfjoust ohai (+)*32< 21:32:10 !bfjoust i_hate_myself_and_i_want_to_die [>(+)*127] i am very helpful 21:32:15 Score for ehird_i_hate_myself_and_i_want_to_die: 4.1 21:32:15 Score for Deewiant_ohai: 3.9 21:32:19 Ha 21:32:19 Oh dman 21:32:20 !bfjoust ohai2 (+)*40< 21:32:23 I had the world record for <1 second 21:32:24 Score for AnMaster_ohai2: 3.8 21:32:26 !bfjoust ohai2 (+)*30< 21:32:26 D'oh 21:32:29 Score for AnMaster_ohai2: 0.0 21:32:31 !bfjoust i_hate_myself_and_i_want_to_die [>(-)*127>+] 21:32:32 hm 21:32:32 !bfjoust ohai (+)*31< 21:32:34 Score for AnMaster_ohai2: 3.8 21:32:37 I WIN 21:32:37 Score for ehird_i_hate_myself_and_i_want_to_die: 10.2 21:32:37 Score for Deewiant_ohai: 0.0 21:32:37 ATM 21:32:39 !bfjoust ohai (+)*33< 21:32:41 !bfjoust another_loser - 21:32:43 Score for Deewiant_ohai: 0.0 21:32:45 !bfjoust ohai (+)*34< 21:32:46 Deewiant, ehird ^ 21:32:46 Score for Sgeo_another_loser: 32.7 21:32:47 :P 21:32:49 Score for Deewiant_ohai: 0.0 21:32:49 :PPPPPPP 21:32:50 !bfjoust ohai (+)*35< 21:32:50 !bfjoust fuck_my_life (>)*37 21:32:52 How did that happen? 21:32:54 Score for ehird_fuck_my_life: 0.0 21:32:54 Score for Deewiant_ohai: 0.2 21:32:56 !!! 21:33:01 Beat that, luzers 21:33:02 !bfjoust oh_nose [[](+Wow)*128] 21:33:03 How did - survive at all? 21:33:07 Score for GregorR-L_oh_nose: 35.0 21:33:08 !bfjoust fuck_my_life (>)*9(<)*9[-] 21:33:12 Deewiant: Haha 0.2 21:33:12 Score for ehird_fuck_my_life: 16.4 21:33:14 That's amazing 21:33:22 !bfjoust ohai (-)*35< 21:33:26 Score for AnMaster_ohai: 0.0 21:33:27 Score for Deewiant_ohai: 0.2 // nothing's going to beat this. 21:33:30 !bfjoust fuck_my_life >-<->-<- 21:33:31 !bfjoust ohai (+)*36< 21:33:34 GregorR-L: Y NOT 21:33:35 ehird: I expect it to be thanks to your fuck_my_life 21:33:36 Score for ehird_fuck_my_life: 16.8 21:33:37 Score for AnMaster_ohai: 6.1 21:33:41 !bfjoust ohai (+)*34< 21:33:44 !bfjoust ohai_sensible (-)*35 21:33:45 ehird: It would've got 0 if that hadn't been in the same run :-P 21:33:45 Score for AnMaster_ohai: 0.0 21:33:50 Score for Sgeo_ohai_sensible: 32.0 21:33:54 ............:! 21:33:59 ehird: Since yours killed itself before mine did 21:34:04 !bfjoust (-)*128 21:34:04 Use: !bfjoust 21:34:06 !bfjoust ()*65536 21:34:06 Erm. 21:34:06 Deewiant, you were lucky with tape length 21:34:06 Use: !bfjoust 21:34:12 !bfjoust parenthesi_or_butt ()*65536 21:34:17 Score for ehird_parenthesi_or_butt: 36.4 21:34:18 !bfjoust loserp (-)*128 21:34:18 IT DOES NOTHING 21:34:18 SLOWLY 21:34:20 HAHAHAHA 21:34:20 The actually good programs on top seem unthreatened :P 21:34:21 Score for pikhq_loserp: 3.5 21:34:21 A 21:34:23 36.4!!! 21:34:26 !bfjoust parenthesi_or_butt ()*10000000000 21:34:30 THIS WILL GET LIKE 300000000000 21:34:32 ehird: Nah, 37 is over the max (I think) 21:34:34 Err 21:34:35 AnMaster: ^ 21:34:41 Deewiant, ? 21:34:46 !bfjoust more_loserp (-)*65536 21:34:59 The single most straightforward suicider didn't get a 0? 21:35:01 ah 21:35:08 AnMaster: No luck involved... my program killed itself before anything could touch it, but ehird's killed itself first 21:35:09 !bfjoust fucking_termoil_wants_me_to_term_oil (-)*99999999999 21:35:11 !bfjoust more_loserp (-)*6553 21:35:14 ehird: polarity for slowrush played a part in one warrior 21:35:15 !bfjoust ohai (+)*35< 21:35:16 see? 21:35:23 nescience: hm? 21:35:25 - gets 1 loss 2 ties and + gets like 2 losses 2 ties 21:35:32 Why isn't more_loserp running 21:35:34 ehird: Did you have to do that again? 21:35:35 also seriously, would you quit with the submitting the inverse thing? 21:35:37 ... what have you done this time? :P 21:35:41 Sgeo, because ehird clogged it 21:35:43 GregorR-L: ehird's *9999999999999 I expect 21:35:49 LAWL 21:35:58 nescience: not until i has my polarity :) 21:36:08 which am doin 21:36:12 ehird, do it 21:36:29 I am. 21:36:39 good, as soon as you do then it'll be only 1 loss 0 ties :) 21:36:45 Wait, enter needs to be 0 two times? 21:37:03 nescience: Yes. 21:37:05 nescience: Who's the loss? 21:37:31 i don't remember 21:37:37 <_< 21:37:41 it may have been more than one actually 21:37:44 That really shouldn't cause this kind of problem. 21:37:45 oh, you mean now? shade 21:37:47 shade beats slowrush 21:37:58 SHADE NEEDS TO GET PAID 21:38:11 -!- stupid_connectio has joined. 21:38:15 i'm bored 21:38:18 i need to go to work 21:38:18 Score for AnMaster_ohai: 0.0 21:38:18 Score for Sgeo_more_loserp: 39.3 21:38:18 Score for ehird_fucking_termoil_wants_me_to_term_oil: 49.5 21:38:19 Score for Sgeo_more_loserp: 39.3 21:38:19 Score for ehird_parenthesi_or_butt: 52.3 21:38:24 LOL 21:38:26 52.3 21:38:36 21:34 ehird: !bfjoust parenthesi_or_butt ()*10000000000 21:38:39 = 52.3 scor 21:38:39 e 21:38:45 Amazing. 21:39:04 train2 fell off the hill :-( 21:39:06 That's because I killed them so it tied a bunch. 21:39:16 Oh 21:39:24 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*30 21:39:28 Score for Deewiant_train2: 28.3 21:39:30 GregorR-L: how about eliminating polar duplicates from the hill? :P 21:39:31 :-( 21:39:42 nescience: using 21:39:44 MY INTERPRETER 21:39:51 ehird's interpreter will do the trick. 21:39:55 [[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[ 21:40:00 Yes. 21:40:00 ya 21:40:03 HELLO LAMENT 21:40:03 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*28 21:40:05 You're GREEN. 21:40:06 but also once you use it, 21:40:07 Score for Deewiant_train2: 17.2 21:40:09 DID. YOU. KNOW. 21:40:09 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*32 21:40:11 HELLO EHIRD 21:40:12 then infinite variations of the same warrior can be submitted 21:40:13 Score for Deewiant_train2: 27.7 21:40:15 YOU'RE COLORLESS 21:40:15 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*31 21:40:17 YES HELLO lament, THIS IS TRULY AMAZING 21:40:19 Score for Deewiant_train2: 15.0 21:40:21 which could be abused 21:40:22 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*29 21:40:24 WOW, DO YOU WANT TO TURN INTO A - 21:40:26 ? lament? 21:40:32 Score for Deewiant_train2: 16.9 21:40:44 WAT 21:40:55 A SCALE OF MONTOLOGY, lament. 21:40:58 JUST BASIC SCIENTIFICS. 21:41:06 OHHHHHHH-KAY 21:41:32 Hey, what did you do to shortsword :-/ Who's to blame? 21:41:41 <-- 21:41:43 i mean uhh :P 21:41:49 !bfjoust hopefully_fixed_bug ()*1000000 21:41:54 Score for GregorR-L_hopefully_fixed_bug: 29.4 21:42:05 !bfjoust hopefully_+mug ()*1000000000000000000000000000000000000000000000000000000 21:42:09 ONE THOUSAND GILLION 21:42:09 Score for ehird_hopefully__mug: 31.1 21:42:32 i am an avant-gardist. isn't that right lament? lament? ent? ? 21:42:38 yyyyes. 21:43:17 !bfjoust toast [>+>-] 21:43:21 Score for GregorR-L_toast: 10.9 21:43:28 ur toast 21:43:37 !bfjoust toast (>+>-)*10 21:43:41 Score for GregorR-L_toast: 9.6 21:43:47 Erm :P 21:44:34 !bfjoust toast (>+>-)*5 21:44:38 Score for GregorR-L_toast: 20.1 21:47:27 -!- myndzi\ has changed nick to myndzi. 21:48:06 -!- stupid_connectio has changed nick to impomatic[2]. 21:48:09 -!- myndzi has changed nick to myndzi\. 21:48:35 -!- myndzi\ has changed nick to myndzi. 21:49:24 sorry for nickspam 21:49:30 accidentally submitted under wrong nick 21:49:45 !bfjoust pooper_scooper [>([{}-])%5+] 21:49:49 Score for GregorR-L_pooper_scooper: 39.5 21:50:04 too many ties, needs to be a suicide 21:50:05 * nescience sighs 21:50:06 -!- nescience has changed nick to myndzi\. 21:50:39 brrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrb. 21:53:33 -!- GregorR has quit (Connection timed out). 21:53:38 ... uh oh. 21:53:55 at least you didn't wind up with 'no route to host' earlier :) 21:53:58 -!- GregorR has joined. 21:54:13 HAIL GREGOR! 21:54:52 BTW, any idea which program that (-)*128 is *beating*? 21:55:31 my suicide 21:55:39 myndzi\_slowrush 21:55:43 -!- impomatic has quit (Connection timed out). 21:55:44 myndzi\: The text being? 21:55:55 Should work now. 21:57:00 !bfjoust pooper_scooper [>([{}-])%5+>([{}-])%5-] 21:57:04 Score for GregorR-L_pooper_scooper: 39.1 21:57:50 Wow, that myndzi\_foo really confused it :P 21:59:41 !bfjoust pooper_scooper [>[[-]-]+] 21:59:45 Score for GregorR-L_pooper_scooper: 37.7 22:00:09 !bfjoust pooper_scooper >[[-]-] 22:00:13 Score for GregorR-L_pooper_scooper: 34.2 22:00:17 Huh 22:00:37 -!- impomatic[2] has changed nick to impomatic. 22:01:46 oh, the backslash? 22:01:54 pikhq: < 22:01:56 Yeah, but it's fixed now, that shouldn't cause issues. 22:01:59 i didn't realize iw as on my altnick 22:02:03 -!- myndzi\ has changed nick to nescience. 22:02:05 when i sent it 22:02:10 and then it responded and i thought crap! 22:02:18 tried to fix it, but with all the defenders, the ties kept it on the board 22:02:34 Ahah. 22:02:39 Due to its confusion, when it finally erased one it was the good one :P 22:02:41 what 22:02:42 Which I put back. 22:02:45 slowrush lost to mirage? :( 22:02:55 ah 22:02:59 that's why! 22:03:00 Oh noes, a single loss 22:03:06 What a terrible failure 22:03:08 it's unacceptable 22:03:18 What about the two ties! 22:03:21 can't fix those 22:03:28 without a better interpreter or bogging down the bot 22:03:31 And you're losing to shade, too 22:03:34 or an idea i don't have yet 22:03:38 shade is mine :> i don't care! 22:03:40 :-P 22:03:47 !bfjoust ()*-2 22:03:47 Use: !bfjoust 22:03:48 i think i'll stick to the 3 ties 1 loss 22:03:50 !bfjoust foo! ()*-2 22:03:51 instead of 2 ties 2 losses 22:03:54 Score for AnMaster_foo_: 30.6 22:04:01 how did it expand 22:04:11 !bfjoust foo! (*[]) 22:04:15 Score for AnMaster_foo_: 0.0 22:04:20 um what 22:04:21 it must have got lucky when i first tried the updated slowrush 22:04:24 !bfjoust foo! (*,[]) 22:04:25 it beat mirage 22:04:28 Score for AnMaster_foo_: 0.0 22:04:31 !bfjoust foo! (*+[]) 22:04:35 Score for AnMaster_foo_: 0.0 22:04:37 hm 22:04:38 i'll have to think of another way to beat the reflected slowrush 22:04:44 AnMaster: (x)*number -> x repeated number times 22:04:54 Deewiant, yes I'm trying to break it 22:04:58 by providing nonsense 22:05:03 !bfjoust foo! (*{}{\}+[]) 22:05:07 Score for AnMaster_foo_: 0.0 22:05:12 !bfjoust foo! +(*{}{\}+[])*1 22:05:15 Score for AnMaster_foo_: 28.1 22:05:23 WAAAT 22:05:40 !bfjoust foo! +(*{}{\+[])*1 22:05:40 AnMaster: If it breaks you get 0, I guess it might read some of them as comments 22:05:44 Score for AnMaster_foo_: 32.0 22:05:47 huh 22:06:00 hehe 22:06:02 cheap trick but it worked 22:06:09 nescience, what trick 22:06:13 and it beats shade now! 22:06:22 but not the shade reflection 22:06:24 jesus ehird 22:06:34 !bfjoust foo! -(*{}{\+[])%1 22:06:36 Score for AnMaster_foo_: 52.5 22:06:44 Nae bad. 22:06:45 O_o 22:06:49 parser error 22:06:54 -!- psygnisf_ has joined. 22:06:56 !bfjoust foo! -(*{}{}\+[])%1 22:07:01 Score for AnMaster_foo_: 29.9 22:07:08 GregorR-L: That had to be a bug 22:07:08 -!- psygnisfive has quit (Connection reset by peer). 22:07:11 0 | 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 | 52.6 | 0 | AnMaster_foo_.bfjoust 22:07:11 whatever, good enough for now 22:07:13 I want to know what that actually did though :P 22:07:22 18 | + 0 + + + + + + + + 0 - + + + + + + + | 90.0 | 15 | myndzi_slowrush.bfjoust 22:07:23 booyeah :> 22:07:24 Oh 22:07:25 Heh 22:07:35 Probably segfaulted :P 22:07:42 >_< 22:07:55 GregorR, what? -(*{}{\+[])%1 segfaulted? 22:08:03 GregorR, you need more fuzz testing then! 22:08:05 AnMaster: It tied against everything 22:08:06 i'll have to consider a different way to beat the stallers without messing up my attack 22:08:07 and bug fixes 22:08:11 Deewiant, I know 22:08:26 GregorR, I expect you to fix the bug in the parser 22:08:49 !bfjoust interpreter_fail -(*{}{\+[])%1 22:08:51 Score for AnMaster_interpreter_fail: 52.5 22:08:57 yay 22:09:02 now it is on the hill 22:09:07 and will stay there for a while 22:09:25 Nope, because I just fixed the bug. 22:09:36 GregorR, sure. But you won't retcon the history! 22:09:40 Time for another POOPER SCOOPER 22:09:44 Nope. 22:09:46 Deewiant, a what 22:09:56 AnMaster: GregorR-L_pooper_scooper.bfjoust 22:10:03 !bfjoust pooper_scooper [>([{}-])%5+] 22:10:07 Score for GregorR-L_pooper_scooper: 38.9 22:10:08 Deewiant, what does it do 22:10:20 !bfjoust foo! -(*{}}\+[])%1 22:10:23 Dobleve te efe? D-8 22:10:24 Score for AnMaster_foo_: 31.4 22:10:26 Looks like a basic attacker 22:10:31 But the bug wasn't fixed :-P 22:10:32 interpreter_fail is still there! D-8 22:10:44 GregorR-L: It tied against everything except pooper scooper :-D 22:10:53 because error = tie 22:10:54 Do you rerun old results? 22:10:54 which shouldn't be 22:10:57 Oh duh, it's cached. 22:10:58 error should = loss 22:11:09 nescience: I guess he can't tell which one errored 22:11:30 !bfjoust pooper_scooper [>([{}-])%5+] 22:11:36 Score for GregorR-L_pooper_scooper: 35.7 22:11:42 Thar. 22:11:55 !bfjoust foo! -(*+[])%1 22:11:59 Score for AnMaster_foo_: 0.2 22:12:05 nice 22:12:12 It tied against interpreter_fail P 22:12:14 :P 22:12:23 GregorR, why did you rerun the interpreter fail one 22:12:34 you reconned the history 22:12:34 :( 22:12:36 There were only 20 on the hill at the time. 22:12:39 It's not a rerun, it's on the hill 22:12:43 I didn't retcon any history. 22:12:53 just need to validate programs beforehand or something 22:13:16 GregorR-L, you did. The ties should be the same. Or do you rerun them all every time. All against all other ones? 22:13:29 Oh, I removed the cache, yes. 22:13:31 Right. 22:13:37 GregorR, you altered history 22:13:38 :( 22:13:41 fail 22:13:44 I'll alter your face. 22:13:56 GregorR, retcon is evil! 22:14:13 History wasn't altered; these programs are all pure, right? 22:14:21 Deewiant, ... 22:14:25 Should be, except when I fix bugs :P 22:14:26 Same output for the same input 22:14:35 Deewiant, no 22:14:41 since tape length is random 22:14:44 !bfjoust pooper_scooper [>+[+-]] 22:14:48 Score for GregorR-L_pooper_scooper: 22.9 22:14:53 AnMaster: It depends only on the sources of the two combatants 22:14:55 lollame 22:14:57 thus removing the cache will always alter programs 22:15:00 AnMaster: Nope 22:15:02 Deewiant, hm 22:15:18 The tape length is generated from the source of the two programs. 22:15:20 still. He altered history 22:15:34 !bfjoust foo! (()%1)%1 22:15:35 No, the programs are pure so it's impossible for history to have changed 22:15:37 Score for AnMaster_foo_: 0.2 22:15:39 !bfjoust pooper_scooper [>([{}-])%10+] 22:15:42 Since it's impossible it didn't happen :-P 22:15:43 Score for GregorR-L_pooper_scooper: 30.7 22:15:58 interpreter_fail won't go away :P 22:16:04 Meh, why does train2 have such a low score 22:16:04 GregorR, don't you dare push it off! 22:16:04 (Until somebody actually ADDS a better one) 22:16:11 !bfjoust train3 (>(-)*10)*4(>(+)*10)*4>>([>][[-][-]>+])*27 22:16:13 There you go 22:16:15 Score for Deewiant_train3: 23.6 22:16:22 BETTER ENOUGH :P 22:16:28 Or wait, was it there already 22:16:32 :-E 22:16:42 !bfjoust amazingly_useless >+[<>] 22:16:46 Score for GregorR-L_amazingly_useless: 18.6 22:16:53 GregorR, don't you dare push it off by hand! 22:16:58 meh 22:16:58 It's gone now 22:17:02 :((((((((((((((((( 22:17:03 AnMaster: It was pushed off by report.c :P 22:17:12 GregorR, retconning history 22:17:18 evil revisionist! 22:17:22 Meh, nescience/myndzi owns the whole hill 22:17:38 !bfjoust (( 22:17:38 Use: !bfjoust 22:17:41 !bfjoust (( (( 22:17:45 Score for AnMaster___: 0.0 22:17:57 !bfjoust %999999999999999999999999999999999999999999999999999999999 22:17:58 Use: !bfjoust 22:18:01 !bfjoust t %999999999999999999999999999999999999999999999999999999999 22:18:05 Score for AnMaster_t: 28.5 22:18:07 how 22:18:13 !bfjoust AnMaster_is_a_loser (.)*10[>(+)*128] 22:18:14 -!- Patashu has joined. 22:18:17 Score for GregorR-L_AnMaster_is_a_loser: 17.0 22:18:17 GregorR-L: any idea if it really was my program that broke things earlier? 22:18:18 !bfjoust q [] 22:18:21 GregorR, I aim for low 22:18:21 or was it the messin around after that 22:18:22 Score for Deewiant_q: 32.6 22:18:28 q > t 22:18:29 nescience: Which? 22:18:33 if it's not gonna break things i'd still like to try and fix those ties 22:18:39 GregorR-L: the one with the nested *3000's 22:18:55 nescience: Oh, it wasn't yours, it was another. Should be fine. 22:18:57 the bot was out of commission so long i figured maybe it wasn't lag, maybe something else was wrong 22:19:00 nescience: Given that the admin is here now it's fairly safe to try ;-) 22:19:00 ah ok 22:19:03 i'll play with it later 22:19:07 !bfjoust t2 >+>+>(+{(-)*999999999999999999999999999999999999999999999999999999999999999}+)%999999999999999999999999999999999999999999999999999999999 22:19:11 Score for AnMaster_t2: 52.5 22:19:13 hm 22:19:14 i don't think i need 3000 after all anyway 22:19:21 GregorR-L: Your interp is a pile of bugs 22:19:22 ok 22:19:24 that is nice 22:19:25 that was just because i thought i wasn't looping enough 22:19:27 GregorR-L, ^ 22:19:39 GregorR-L, don't clear the cache this time! 22:19:40 when it was a different problem entirely 22:19:53 wtfbbq 22:19:56 lol 22:19:57 apparantly 22:20:04 tieing everything gives you a REALLY good score 22:20:14 Patashu: A tie is better than a loss. 22:20:27 !bfjoust lazy >(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5(>(-.)*128)*21[-]((-)*2048(+)*2048.)*2 22:20:31 Score for Patashu_lazy: 35.1 22:20:31 !bfjoust matador >+[]<(++-)*1000+(--+)*1000(>)*9(>[+][-])*21 22:20:32 !bfjoust interpreter_fail2 >+>+>(+{(-)*999999999999999999999999999999999999999999999999999999999999999}+)%999999999999999999999999999999999999999999999999999999999 22:20:36 Score for AnMaster_interpreter_fail2: 52.4 22:20:37 Score for Patashu_matador: 35.3 22:20:38 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*10000(-+)*10000(>)*8(>(-.)*128)*20 22:20:42 Score for Patashu_waiter: 48.6 22:20:45 !bfjoust juggernaut +(>(-)*128.--++)*29 22:20:49 Score for Patashu_juggernaut: 31.0 22:20:51 !bfjoust electrictrain (>(+)*10)*4(>(-)*10)*5([-][-][+][+]>)*20 22:20:54 Score for Patashu_electrictrain: 28.8 22:21:02 !bfjoust push_them_off1 >+>+>(+{(-)*999999999999999999999999999999999999999999999999999999999999999}+)%999999999999999999999999999999999999999999999999999999999 22:21:05 !bfjoust push_them_off2 >+>+>(+{(-)*999999999999999999999999999999999999999999999999999999999999999}+)%999999999999999999999999999999999999999999999999999999999 22:21:05 Score for AnMaster_push_them_off1: 52.5 22:21:07 !bfjoust push_them_off3 >+>+>(+{(-)*999999999999999999999999999999999999999999999999999999999999999}+)%999999999999999999999999999999999999999999999999999999999 22:21:08 Score for AnMaster_push_them_off2: 52.5 22:21:12 Score for AnMaster_push_them_off3: 52.5 22:21:14 !bfjoust train2 (>(-)*10)*4(>(+)*10)*4>>+([[-][-]>+])*27 22:21:14 !bfjoust yes_jerk >+>+>(+{(-)*999999999999999999999999999999999999999999999999999999999999999}+)%999999999999999999999999999999999999999999999999999999999 22:21:20 Score for AnMaster_yes_jerk: 52.4 22:21:20 Score for Deewiant_train2: 37.1 22:21:21 (I won't do more) 22:21:29 still 22:21:34 you know 22:21:34 Hey, you ass, you killed sloth 22:21:40 I guess he will just retcon history 22:21:41 I'll have to dig into text files to find its source again 22:21:42 saying *number where number is greater than 386000 22:21:42 so not an issue 22:21:43 is pointless 22:21:51 Deewiant, it scored worse than all draws 22:22:00 Patashu, why 386000 22:22:02 AnMaster: All draws is fairly good 22:22:08 Patashu: 100k is the turn limit 22:22:08 that's the max number of cycles 22:22:11 ah 22:22:12 not when they aren't draws but broken programs 22:22:16 Patashu: It's 100k 22:22:20 oh 22:22:22 it got lowered? 22:22:31 Beats me, but that's what it is :-P 22:22:34 7 37.07 -5 Deewiant_train2.bfjoust 22:22:35 Dunno what it used to be 22:22:35 hm 22:22:48 Deewiant, if I pushed off sloth it must have been very bad 22:22:53 so good riddance of me 22:22:55 ;P 22:22:55 !bfjoust sloth (+)*12((++-)*1024-(--+)*1024)*100(>)*8+([>[-]+])*100 22:22:58 Score for Deewiant_sloth: 40.5 22:23:05 and he should test them properly 22:23:09 AnMaster: I repeat; all draws is good 22:23:22 7 37.07 -5 Deewiant_train2.bfjoust 22:23:25 !bfjoust pooper_scooper [>([{}-])%10+] 22:23:26 that one was bad though 22:23:33 Score for GregorR-L_pooper_scooper: 37.4 22:23:38 AnMaster: It used to be over 50 22:23:42 -!- impomatic has left (?). 22:24:20 AnMaster: And I'd like to see you do better without abusing bugs before complaining :-P 22:24:31 is that bug abuse? 22:24:36 GregorR, please can has formal verification next time, mkay? 22:24:37 :P 22:24:48 AnMaster: No. 22:24:50 Patashu: All those all-drawers are causing the interp to crash 22:24:56 -!- olsner has quit ("Leaving"). 22:24:57 Patashu: Which is why they draw :-P 22:25:00 that is, next time I manage to crash it. you have to do a full formal verification. 22:25:04 oh XD 22:25:16 AnMaster: No. 22:25:29 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*10[+[-]]+.--.++>(-)*10[-[+]]+.--.++>)*10(+)*8[+[-]]+.--.++ 22:25:33 Score for Patashu_rushpolarity: 42.2 22:25:38 !bfjoust lazy >(+)*5>(-)*5>(+)*5>(-)*5>(-)*5>(+)*5>(+)*5>(-)*5(>(-.)*128)*21[-]((-)*2048(+)*2048.)*2 22:25:42 Score for Patashu_lazy: 36.0 22:25:43 !bfjoust hm_this_should_be_good_since_it_will_draw_against_the_other_ones1 >+>+>(+{(-)*999999999999999999999999999999999999999999999999999999999999999}+)%999999999999999999999999999999999999999999999999999999999 22:25:45 !bfjoust matador >+[]<(++-)*1000+(--+)*1000(>)*9(>[+][-])*21 22:25:46 !bfjoust hm_this_should_be_good_since_it_will_draw_against_the_other_ones2 >+>+>(+{(-)*999999999999999999999999999999999999999999999999999999999999999}+)%999999999999999999999999999999999999999999999999999999999 22:25:49 !bfjoust hm_this_should_be_good_since_it_will_draw_against_the_other_ones3 >+>+>(+{(-)*999999999999999999999999999999999999999999999999999999999999999}+)%999999999999999999999999999999999999999999999999999999999 22:25:49 Score for AnMaster_hm_this_should_be_good_since_it_will_draw_against_the_other_ones1: 25.7 22:25:50 Score for Patashu_matador: 35.8 22:25:51 Score for AnMaster_hm_this_should_be_good_since_it_will_draw_against_the_other_ones2: 25.7 22:25:53 Score for AnMaster_hm_this_should_be_good_since_it_will_draw_against_the_other_ones3: 25.3 22:25:55 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*10000(-+)*10000(>)*8(>(-.)*128)*20 22:25:59 hm 22:25:59 Score for Patashu_waiter: 49.4 22:26:00 nice 22:26:01 !bfjoust juggernaut +(>(-)*128.--++)*29 22:26:05 Score for Patashu_juggernaut: 26.2 22:26:20 so 22:26:56 !bfjoust test (+)*100000 22:27:00 Score for AnMaster_test: 41.8 22:27:09 O_o 22:27:15 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*5000(-)*5000(+-)*5000(-+)*5000(>)*8(>(-.)*128)*20 22:27:19 Score for Patashu_waiter: 47.8 22:27:23 Deewiant, it clearly prevents it being 0 twice in a row a lot 22:27:23 Well, makes sense I guess 22:27:30 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*10000(-+)*10000(>)*8(>(-.)*128)*20 22:27:31 Since most programs try to kill with a [-] 22:27:34 Score for Patashu_waiter: 48.1 22:27:34 yeah 22:27:54 Patashu: Given 100k, there's some pointlessness there :-P 22:27:58 !bfjoust test2 (-)*100002 22:28:00 I know 22:28:01 Score for AnMaster_test2: 45.9 22:28:05 right 22:28:08 I'm trying to figure out why making it use every cycle hurts it :/ 22:28:14 !bfjoust test2 - 22:28:15 !bfjoust test - 22:28:17 Because of the randomization, I guess 22:28:19 Score for AnMaster_test: 34.6 22:28:19 Score for AnMaster_test2: 34.6 22:28:20 to take them down 22:28:37 Hmm, wat 22:28:38 !bfjoust mad_changer (-)*100001 22:28:41 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(>)*8(>(-.)*128)*20 22:28:42 that is the real name of it 22:28:43 Score for AnMaster_mad_changer: 36.1 22:28:45 Score for Patashu_waiter: 43.2 22:28:49 !bfjoust waiter ((++-)*10000-(--+)*10000)*2(+)*50000(-)*50000(+-)*10000(-+)*10000(>)*8(>(-.)*128)*20 22:28:51 Oh right 22:28:53 Score for Patashu_waiter: 45.3 22:28:55 !bfjoust mad_changer (-)*100002 22:28:56 !bfjoust sloth (+)*12((++-)*1024-(--+)*1024)*10(>)*8+([>[-]+])*100 22:29:00 Score for AnMaster_mad_changer: 44.9 22:29:00 Score for Deewiant_sloth: 24.1 22:29:03 Hmm 22:29:03 Good lawd 22:29:06 why 22:29:12 !bfjoust sloth (+)*12((++-)*128-(--+)*128)*100(>)*8+([>[-]+])*100 22:29:15 Score for Deewiant_sloth: 23.5 22:29:23 !bfjoust sloth (+)*12((++-)*1024-(--+)*1024)*100 22:29:27 Score for Deewiant_sloth: 30.5 22:29:31 !bfjoust mad_changer (-)*100002 22:29:32 Odd. 22:29:35 Score for AnMaster_mad_changer: 43.2 22:29:38 !bfjoust mad_changer (-)*100001 22:29:40 hm 22:29:41 !bfjoust sloth (+)*12((++-)*1024-(--+)*1024)*128(>)*8+([>[-]+])*100 22:29:43 Score for AnMaster_mad_changer: 35.6 22:29:45 Score for Deewiant_sloth: 40.9 22:29:46 trying to find optimal value 22:29:50 !bfjoust mad_changer (-)*100003 22:29:54 Score for AnMaster_mad_changer: 44.7 22:29:55 !bfjoust sloth (+)*12((++-)*1024-(--+)*1024)*100(>)*8+([>[-]+])*100 22:29:56 ok 22:29:59 Score for Deewiant_sloth: 41.0 22:29:59 I'll stop at that 22:30:50 anyway I think it is valid to go for the insane approach! 22:31:11 Insane? 22:31:12 !bfjoust test >+>+<<<(-)*100003 22:31:16 Score for AnMaster_test: 0.0 22:31:19 what 22:31:23 !bfjoust test >+>+<<(-)*100003 22:31:24 >><<< -> lose 22:31:25 ah 22:31:28 Score for AnMaster_test: 47.2 22:31:50 !bfjoust test >+>+<<(-)*99994 22:31:52 that is ncie 22:31:55 Score for Deewiant_test: 43.2 22:31:56 !bfjoust test < 22:32:00 Score for Deewiant_test: 0.0 22:32:07 I hate randomness :-P 22:32:26 same 22:32:34 !bfjoust mad_changer2 >+>+<<(-)*100003 22:32:38 Remove dead instructions -> oops, they affected the randomizer so now you lost against this dude 22:32:39 Score for AnMaster_mad_changer2: 47.0 22:33:01 !bfjoust test + 22:33:05 Score for AnMaster_test: 31.2 22:33:18 I use test as my "working" copy. and then name the good ones properly 22:33:27 just fyi 22:34:11 !bfjoust test {}*2 22:34:14 Score for AnMaster_test: 34.8 22:34:15 !bfjoust farmhand (-+)*50000 22:34:20 Score for Deewiant_farmhand: 36.0 22:34:32 !bfjoust test >({+})*2 22:34:36 Score for AnMaster_test: 26.6 22:34:42 !bfjoust farmhand (+-)*50000 22:34:46 Score for Deewiant_farmhand: 36.1 22:34:55 Deewiant, that does make a difference though 22:35:26 !bfjoust farmhand (+-)*25000(-+)*25000 22:35:30 Score for Deewiant_farmhand: 36.1 22:35:35 I wonder how the mad changer can ever lose against any of them 22:35:38 that is strange 22:35:46 Deewiant, stop being silly 22:35:58 Silly? 22:36:01 yeah 22:36:12 you are just experimenting with randomness right? 22:36:16 the mad changer can lose against an opponent that does not zero using a loop 22:36:18 No 22:36:21 22:06 nescience: jesus ehird ←wut 22:36:25 Patashu, oh? 22:36:36 if an opponent gets it onto 0 then uses + it wins 22:36:42 so you just need a creative non-loop based attack 22:36:44 Patashu, ok... 22:36:45 -!- inurinternet has joined. 22:36:48 22:08 AnMaster: GregorR, I expect you to fix the bug in the parser ←AnMaster expecting things since 198x 22:36:52 -!- Taejo has quit ("Leaving"). 22:37:02 !bfjoust killa [>[+]-] 22:37:05 Score for Deewiant_killa: 26.0 22:37:16 AnMaster: ^ beats mad changers 22:37:17 ehird, your mom didn't expect you I guess... 22:37:24 meh 22:37:40 AnMaster: ...what? 22:37:44 is that meant to be an insult 22:37:45 because it's really bad 22:37:53 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-][+]>+])*27 22:37:55 !mad_changer2 >+>--<<(+)*100003 22:37:57 Score for Deewiant_maglev: 37.5 22:38:07 ... 22:38:08 well? 22:38:20 !mad_changer2 isn't a command 22:38:27 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[+][+]>+])*27 22:38:30 Score for Deewiant_maglev: 27.4 22:38:34 !bfjoust mad_changer3 >+>--<<(+)*100003 22:38:39 Score for AnMaster_mad_changer3: 38.9 22:38:43 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-][+]>-])*27 22:38:44 huh 22:38:47 Score for Deewiant_maglev: 32.8 22:38:58 !bfjoust mad_changer3 >+>-->+<<<(+)*100003 22:39:03 Score for AnMaster_mad_changer3: 32.7 22:39:03 !bfjoust maglev (>(-)*10)*3(>(+)*10)*3(>)*4+([[-][+]>+])*27 22:39:07 Score for Deewiant_maglev: 31.5 22:39:10 !bfjoust mad_changer3 >+>-->>+<<<<(+)*100003 22:39:15 Score for AnMaster_mad_changer3: 31.5 22:39:15 !bfjoust maglev (>(-)*10)*2(>(+)*10)*2(>)*6+([[-][+]>+])*27 22:39:19 Score for Deewiant_maglev: 31.3 22:39:23 !bfjoust maglev (>(-)*10)*5(>(+)*10)*5(>)*0+([[-][+]>+])*27 22:39:27 Score for Deewiant_maglev: 23.8 22:39:37 !bfjoust mad_changer3 >+>-->>+<<<<(+)*100000 22:39:42 Score for AnMaster_mad_changer3: 34.1 22:39:43 !bfjoust maglev (>(-)*10)*1(>(+)*10)*1(>)*8+([[-][+]>+])*27 22:39:47 Score for Deewiant_maglev: 26.5 22:39:51 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4(>)*2+([[-][+]>+])*27 22:39:55 Score for Deewiant_maglev: 29.4 22:40:12 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-][+]>+])*27 22:40:15 Deewiant, how does it work? 22:40:17 Score for Deewiant_maglev: 37.0 22:40:19 O_o 22:40:29 (>)*2 to >> improved that quite a bit, sigh 22:40:31 !bfjoust mad_changer4 >+>-->>++<<<<(+)*100003 22:40:35 Score for AnMaster_mad_changer4: 37.3 22:40:42 AnMaster: Sets up a few decoys then attacks 22:40:46 Nothing special 22:40:57 Magggnetic levitttation 22:40:58 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-][+]>+])*30 22:41:00 Deewiant: my interp has noooooooo randomness 22:41:01 Score for Deewiant_maglev: 46.0 22:41:10 Right, whatever. 22:41:10 22:33 AnMaster: I use test as my "working" copy. and then name the good ones properly ← stop messing up the hill 22:41:14 ehird, I'm waiting for it 22:41:20 develop in-place 22:41:20 ehird: That doesn't mess anything up 22:41:26 Deewiant: does in my mind :)))))) 22:41:27 ehird, I don't yet know what it will be then 22:41:33 AnMaster: And you wrote cfunge in a day, didn't you? 22:41:35 ehird: But doesn't actually :))))))) 22:41:38 ehird, I didn't 22:41:45 Hey ehird! Finished that code? No? Hehehehehe, you're a slacker who never does anything. 22:41:47 (5 minutes pass) 22:41:48 ehird, but what has that got to do with it 22:41:48 Hey ehird! Finished that code? No? Hehehehehe, you're a slacker who never does anything. 22:41:58 what has that got to do with the hill 22:42:05 ehird, one major difference 22:42:05 AnMaster: I was not talking about the hill. 22:42:19 ehird, you are talking about how your will solve it all the time 22:42:24 wait 22:42:26 I never did that with cfunge 22:42:27 what's the current interp glitch? 22:42:28 AnMaster: It's called being silly. 22:42:34 Patashu, there is none? 22:42:37 Patashu: randomosity & no polarity 22:42:54 Neither of those are glitches, they're just definitional :P 22:43:08 Yes, but they're nice to not have. 22:43:22 -!- ais523 has joined. 22:43:25 Hi ais523. 22:43:33 hi 22:44:10 ehird: What'll you do about randomosity 22:44:25 Deewiant: For two challengers, run every combination of (tape_length,polarity). 22:44:26 Take the mean. 22:44:36 This requires a fast implementation. :) 22:44:36 ah 22:44:37 (42 runs) 22:44:42 so you ARE doing the change polarity thing I mentioned :) 22:44:43 hehe 22:44:44 !bfjoust test >+>+>+>+>+>+>+>+>+>+>-->+>>+>+>+>+>+>-+>+++>>++>+>+<<<<<<<<<<<<<<<<<<<<<<<(+)*1000000 22:44:45 Patashu: yep 22:44:48 Score for AnMaster_test: 14.5 22:44:48 ehird: I'd take the stddev, too 22:44:56 Deewiant: Yeah, good idea 22:45:07 meh 22:45:25 AnMaster: I think you might run over the tape there already, on occasion 22:45:30 ah 22:45:51 !bfjoust test >+>+>+>+>+>+>+>+>+>++++>-->+>>+>+>+>+>+<<<<<<<<<<<<<<<<<(+)*1000000 22:45:55 Score for AnMaster_test: 22.1 22:46:04 !bfjoust test >+>+>+>+>+>+>+>+>+>++++>-->+>>+>+>+<<<<<<<<<<<<<<<(+)*1000000 22:46:08 Score for AnMaster_test: 33.0 22:46:11 winner_t run_match(ins_t *a, ins_t *b, polarity_t polarity, int tape_length); 22:46:13 Let's gooooooooooo 22:46:15 ... wait. 22:46:17 !bfjoust test >+>+>+>+>+>+>+>+>+>++++>-->+>>+>+<<<<<<<<<<<<<<(+)*1000000 22:46:19 That should go in a match_t structure. 22:46:22 Score for AnMaster_test: 42.1 22:46:27 * ehird underlines "When in doubt, add another data structure." again 22:46:28 ok... 22:46:53 !bfjoust mad_changer3 >+>+>+>+>+>+>+>+>+>++++>-->+>>+>+<<<<<<<<<<<<<<(+)*1000000 22:46:57 Score for AnMaster_mad_changer3: 41.6 22:47:16 !bfjoust test (+)*1000000 22:47:20 -!- tombom has quit ("Peace and Protection 4.22.2"). 22:47:21 Score for AnMaster_test: 48.9 22:47:22 No more sub-40s on the hill 22:47:30 point creep? 22:47:31 lol 22:47:35 !bfjoust mad_changer_4 (+)*1000000 22:47:40 Score for AnMaster_mad_changer_4: 48.1 22:47:55 10 38.50 -5 ehird_defend8mwahahaha.bfjoust 22:47:57 ytes there is 22:47:58 !bfjoust rushpolarity >((+)*10>(-)*10>(-)*10>(+)*10)*2>((+)*10[+[-]]+.--.++>(-)*10[-[+]]+.--.++>)*10(+)*8[+[-]]+.--.++ 22:47:59 yes* 22:48:01 Score for Patashu_rushpolarity: 42.9 22:48:11 hi ais523 22:48:16 hi AnMaster 22:48:17 AnMaster: Remove test first when you copy it to a named one, or you drop an extra program off the hill 22:48:25 Deewiant, ah good pont 22:48:26 See? 22:48:29 Test ftl :P 22:48:30 !bfjoust test < 22:48:32 Score for AnMaster_test: 0.0 22:48:34 there we go 22:48:39 ah 22:48:45 that's how you remove it :) 22:48:46 has the hill been enlarged? 22:48:47 ehird, I don't know what I'm developing 22:48:56 until I hit a good one 22:48:56 AnMaster: Just name it something random! 22:48:58 ais523: Size 20 as of 16 hours ago 22:49:01 ehird, I refuse to 22:49:05 ais523: Yeah, and Gregor made a new implementation. 22:49:09 But I'm making a new new implementation :P 22:49:17 (Gregor's is just faster, nothing else) 22:49:24 yes he is 22:49:27 http://narf.at/pix/ab1512bd2a6df0270a9a4320103c4cac21e4f018.jpeg 22:49:42 AnMaster: Yes he is what? 22:49:43 Deewiant, :DDDDDDDDDDDDDd 22:49:47 Deewiant: Old 22:49:49 ehird, faster 22:49:55 AnMaster: "he"? 22:49:57 Whhhhhhat 22:50:00 Do you give programs genders? 22:50:03 GregorR, ... 22:50:05 he is faster 22:50:07 -_- 22:50:16 than you 22:50:18 at coding it 22:50:32 GregorR-L: how long did it take you to code it, perchance? 22:50:34 5 minutes? 22:50:41 No? Guess you're too slow for SPEEDY AnMaster 22:50:48 -!- Patashu has quit ("Patashu/SteampunkX - MSN = Patashu@hotmail.com , AIM = Patashu0 , YIM = Patashu2 , Googletalk = Patashu0@gmail.com ."). 22:50:49 ehird, well, he started after you did. And you aren't yet done 22:50:59 you started yesterday 22:51:06 so did he, but later 22:51:15 Because I've done other things, goddamn you impatient bastard. And his interp is just a trivial reimplementation. 22:51:23 Because I've done other things, goddamn you impatient bastard. And his interp is just a trivial reimplementation. 22:51:31 I'm not the one who wants it 22:51:37 I'm really tired of HEY EHIRD YOU'RE TALKING MORE THAN A FEW MINUTES TO IMPLEMENT IT YOU'RE SO SLOOOOOW GREGOR IS SO FASTER YOU SUCK 22:51:39 Stop it. 22:51:54 ehird, you are misrepresenting my opinions here 22:52:08 Sorry, you don't say "YOU SUCK". Scratch that part. 22:52:15 ehird, nor the other parts 22:52:22 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-.][+.]>+])*30 22:52:24 Score for Deewiant_maglev: 38.0 22:52:26 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-.][+.]>])*30 22:52:28 Then me and clog must be hallucinating. 22:52:29 Score for Deewiant_maglev: 19.5 22:52:31 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-.][+.]>])*40 22:52:34 Score for Deewiant_maglev: 31.0 22:52:45 ehird, you began it yesterday right? 22:52:46 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-.][+.]>]+)*40 22:52:48 Score for Deewiant_maglev: 38.0 22:52:50 ehird, so did GregorR 22:53:03 AnMaster: I DON'T GIVE A SHIT! WHY ARE YOU TELLING ME THIS AGAIN?! 22:53:04 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-.][+]>]+)*40 22:53:05 AAAAAAAAArgh. 22:53:06 ehird, you began before GregorR yesterday 22:53:06 Score for Deewiant_maglev: 40.0 22:53:07 Oh for cripes sake, you two go sit in opposite corners. 22:53:15 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-][+.]>]+)*40 22:53:18 Score for Deewiant_maglev: 36.6 22:53:18 and you are claiming this is "a few minutes" 22:53:20 GregorR-L: I just don't know why the fuck he's bugging me about not implementing it as super fast as I can 22:53:21 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-]>]+)*40 22:53:22 just fuck off 22:53:24 Score for Deewiant_maglev: 16.6 22:53:30 AnMaster: BECAUSE YOU KEEP BUGGING ME ABOUT IT EVERY HOUR 22:53:39 ehird, I'm not bugging you about doing it 22:53:40 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>->+([[-]>]+)*40 22:53:43 Score for Deewiant_maglev: 27.4 22:53:49 but I'm irritated at you talking a lot about it and doing nothing 22:53:52 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>->+([[-][+]>])*30 22:53:55 Score for Deewiant_maglev: 19.4 22:53:57 which is to me just spam 22:53:58 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-][+]>])*30 22:54:01 Score for Deewiant_maglev: 35.6 22:54:07 AnMaster: maybe ehird is doing something, just there's no visible proof 22:54:11 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>->+([[-][+]>+])*30 22:54:11 like the NetHack devteam 22:54:13 !bfjoust maglev_deewiant (>(-)*10)*4(>(+)*10)*4>>+([[-][+]>])*30 22:54:13 Score for Deewiant_maglev: 26.9 22:54:16 Score for AnMaster_maglev_deewiant: 34.5 22:54:20 what 22:54:21 ais523: He goddamn knows I'm developing it 22:54:23 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-][+]>+])*30 22:54:25 Score for Deewiant_maglev: 42.5 22:54:29 He just keeps saying "HEY EHIRD ARE YOU DONE YEEEEEET????????????????????????????" 22:54:31 Shoo :-P 22:54:35 Deewiant, try submitting the same twice? 22:54:47 22:53 AnMaster: but I'm irritated at you talking a lot about it and doing nothing 22:54:47 AnMaster: It's because you were against my maglev 22:54:49 "a lot"? 22:54:50 ais523: Just ignore them. 22:54:55 Deewiant, ah 22:54:59 Whereas when I do it myself, it obviously isn't there 22:55:01 No. Not a lot. I'm just joking every now and then when people talk about the randomosity etc. 22:55:05 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>->+([[-][+]>+])*30 22:55:08 Score for Deewiant_maglev: 29.5 22:55:10 ais523, hah 22:55:13 God damn, I can't joke without being hounded for hours by AnMaster now. Lovely. 22:55:14 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>([[-][+]>+])*30 22:55:15 Why do I bother. 22:55:17 Score for Deewiant_maglev: 30.6 22:55:22 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>([[-][+]>]+)*30 22:55:24 Score for Deewiant_maglev: 33.5 22:55:29 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>+([[-][+]>]+)*30 22:55:32 Score for Deewiant_maglev: 27.6 22:55:32 -!- pikhq has changed nick to p. 22:55:36 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>->([[-][+]>]+)*30 22:55:39 nice nick 22:55:39 Score for Deewiant_maglev: 44.5 22:55:41 -!- p has changed nick to pikhq. 22:55:48 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>->([[-][+]>]+)*30 22:55:51 Score for Deewiant_maglev: 36.6 22:55:54 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>->>([[-][+]>]+)*30 22:55:56 Score for Deewiant_maglev: 37.3 22:56:05 Aaaw. I was trying to make pıkhq an alias. 22:56:07 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>->([[-][+]>]+)*30 22:56:09 Score for Deewiant_maglev: 44.5 22:56:11 Oh well 22:56:15 Freenode hates Unicode nicks. 22:56:19 GregorR, it would be interesting to run the program against itself and show if it won or it was a draw 22:56:41 AnMaster: A program always draws against itself. 22:56:42 Think about it. 22:56:50 GregorR-L: does your interpreter handle nested ({})? 22:56:50 ehird, sure? 22:56:51 like 22:56:53 AnMaster: Yes. 22:57:01 nescience: Yes. 22:57:04 ehird, I'm pretty sure you could make one that didn't 22:57:09 no 22:57:10 you can't 22:57:16 ehird: What about < 22:57:18 * pikhq bets you couldn't even register ørjan 22:57:21 Deewiant: That draws on everything 22:57:23 Doesn't the first program lose before the other gets a turn 22:57:36 hm yes that is what I'm thinking too 22:57:44 also not that I know of 22:57:45 Turns are simultaneous. 22:57:48 yeah 22:57:50 ah 22:58:08 Evidently 22:59:08 !bfjoust Göta_kanal >+<(-)*10000000000000 22:59:11 Score for AnMaster_G__ta_kanal: 44.0 22:59:19 nice 22:59:22 Waa 22:59:38 Deewiant, randomness? 22:59:49 Try dropping off the 8 extra zeroes 23:00:02 Deewiant, would change randomness. 23:00:12 Yes, I know 23:00:21 !bfjoust Göta_älv >+<(-)*100000 23:00:24 Score for AnMaster_G__ta___lv: 40.0 23:00:33 see 23:00:45 and that is a silly filename 23:00:55 GregorR, Linux handles unicode filanames just fine 23:00:55 hm 23:00:56 Non-ascii -> _ 23:01:03 Deewiant: non-alphanumeric -> _ 23:01:13 here goes nothing 23:01:14 !bfjoust is-that-so < 23:01:17 Score for Deewiant_is-that-so: 0.2 23:01:17 i'm pretty sure i can't even read this 23:01:24 also 23:01:26 !bfjoust is/that+so < 23:01:26 the _ are wrong 23:01:28 Score for Deewiant_is_that_so: 0.2 23:01:34 Yes. That is so. 23:01:35 it uses two _ for one letter 23:01:37 I guess you can count - as numeric 23:01:37 heh yeah 23:01:38 encoding fail 23:01:39 Although I wouldn't 23:01:45 AnMaster: Not giving a shit about non-ASCII inputs win. 23:01:46 maybe manual expansion for part of that 23:01:46 !befunge98 "ö"....@ 23:01:47 182 195 0 0 23:01:51 !befunge98 "ö",,@ 23:01:52 23:01:55 fail? 23:01:55 AnMaster: it probably depends on the filesystem 23:01:57 !befunge98 "ö"\,,@ 23:01:58 ö 23:01:58 AnMaster: Not giving a shit about non-ASCII inputs win. // yes 23:01:59 ah 23:02:18 AnMaster: it probably depends on the filesystem <-- I assume he isn't using FAT... 23:02:29 I whitelist rather than blacklist. 23:02:34 GregorR, US centric bastard! :P 23:02:39 ;P 23:02:41 or rather i overflowed your buffer 23:02:42 :P 23:02:53 Hail Brittania. 23:03:07 ok. UK centric bastard then 23:03:11 sorry for the mistake 23:03:27 GregorR-L is a USian. 23:03:33 ok 23:03:36 US centric it is 23:03:39 I was just being an idiot :P 23:03:44 But anyone who says that English is only in England and the USA is an idiot. 23:03:52 Or lives in a country with a terrible curriculum. 23:03:55 !bfjoust The Colour of Mälaren >+>+<<(-)*10000000000000 23:03:58 Score for AnMaster_The: 36.5 23:04:01 !bfjoust The_Colour_of_Mälaren >+>+<<(-)*10000000000000 23:04:04 Score for AnMaster_The_Colour_of_M__laren: 38.9 23:04:09 !bfjoust The_Colour_of_Mälaren >+>+<(-)*10000000000000 23:04:12 AnMaster: Also: café is an english word. 23:04:13 Score for AnMaster_The_Colour_of_M__laren: 44.9 23:04:15 You can't represent it in ASCII. 23:04:15 wow 23:04:17 that is nice 23:04:20 So not exactly English-centric. 23:04:35 I think that makes some of them not reach the flag cell 23:04:50 oh right 23:04:53 what i had in mind won't work anyway 23:05:00 nescience, for what? 23:05:14 for fixing up slowrush 23:05:20 nescience, oh? 23:05:24 to take care of both polarities of the waiting scripts 23:05:39 i'll have to do it a different way after all 23:06:06 !bfjoust Östersjöns_vågor >+>+<(-++-)*10000000000000 23:06:09 Score for AnMaster___stersj__ns_v__gor: 39.4 23:06:18 !bfjoust Östersjöns_vågor >+>+<(-+-++)*10000000000000 23:06:19 also, is that more tying bullshit at the top there? 23:06:22 Score for AnMaster___stersj__ns_v__gor: 49.1 23:06:46 nescience, ? 23:06:56 I don't aim for anything more than draw 23:07:05 I'm using confusers 23:07:11 a passive technice 23:07:18 spelling 23:07:20 "confusers"? 23:07:27 sigh 23:07:32 They're not called confusers. 23:07:34 ehird, yes. They trap the opposite program and aim for a draw 23:07:36 They're not called confusers. 23:07:38 more like submitting the same thing under 5 names 23:07:52 nescience, there are important differences 23:07:54 read them 23:07:55 ... 23:07:57 one is - 23:07:59 and one is + 23:08:00 neither matters 23:08:05 one is +--+ or whatever 23:08:07 a couple have decoys 23:08:09 still doesn't matter 23:08:12 it does the same thing 23:08:19 and ties need to be nuked out of this scoring system 23:08:24 nescience, ... so why do they manage differently bad 23:08:39 Randomosity. 23:08:48 ehird, not only 23:08:53 or rather, put it back to wins ties losses for score 23:09:01 none of this getting points for tying things that get points 23:09:20 nescience: my NEW CONTEST INFRASTRUCTURE WILL HANDLE THAT! Also before AnMaster lynches me I'm fucking kidding, okay? 23:09:27 lol 23:09:30 nescience: if you want a PONY that can be ARRANGED also 23:09:32 nescience, you just hate them because that sucky program of yours got kicked out 23:09:39 AnMaster: stop being a retard. 23:09:43 kthx 23:09:49 i look forward to it 23:09:51 EHIRD: PROBLEM SOLVER 23:09:53 AnMaster: huh? 23:09:58 SINCE 2009 23:10:03 both of my programs are near the top 23:10:03 nescience, ah I mixed you up with someone else 23:10:06 i don't care what you write 23:10:10 the shade one is still there 23:10:19 just don't submit it under 10 forms so that they only stay on the hill because of the scoring exploit 23:10:37 it's more of a courtesy thing 23:10:38 the bloody hill is alight with draws of all of AnMaster's 57 programs 23:10:41 nescience, you can see that some of the mad changers work on the flag cell, while some doesn't 23:10:48 AnMaster: Argh! 23:10:52 There's a reason you can resubmit under the same name. 23:11:09 ehird, I want to keep the best one. 23:11:17 ................................. 23:11:22 anyway. Just fucking beat them and the issue is solved 23:11:25 So... resubmit... the best one... at the end. 23:11:42 ehird, as if I would remember it by then 23:11:48 well i guess by that logic, i should just submit 10 variants of slowrush and knock everything off the hill 23:11:52 | 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 | score | pts | program 23:11:52 0 | 0 0 0 0 - 0 0 0 0 0 0 0 0 0 - 0 0 0 0 - | 44.6 | -3 | AnMaster_The_Colour_of_M__laren.bfjoust 23:11:58 clearly the tactics work 23:11:58 the thing is your programs ARE getting "just fucking beaten" 23:12:03 AnMaster: Oh, I forgot, YOU ONLY HAVE 3 FUCKING LINES OF BACKLOG? 23:12:03 except that ties are overscored 23:12:11 So you can't just go into the previous lines and pick out the best one? 23:12:16 Might be time to get a better IRC client. 23:12:18 raaaaaaaaawr 23:12:19 nescience, ties being +/- 0 seems sane 23:12:23 * ehird bites something 23:12:24 !befunge98 "abcdefghijklmnopqrstuvwxyzåäö">:#;288**1-`9\0\#x_$$#;,_@>\,3k09a+-0x 23:12:25 öåyxvusrpomljigfdca 23:12:26 nescience, which one would win from it 23:12:27 Darn 23:12:33 Oh well 23:12:36 nescience, in your suggestion 23:12:52 my suggestion is simply to keep a small number of entries per idea 23:12:58 Deewiant, what were you trying to do... 23:13:29 nescience, About the ties I mean 23:13:31 .... 23:13:41 !befunge98 "abcdefghijklmnopqrstuvwxyzåäö">:#;288**1-`a\0\#x_$$:#;,_@>\,3k0aa+-0x 23:13:42 özyxwvutsrqponmlkjihgfedcba 23:13:43 15 | + + + + - - - - + + - + + - + 0 - + - - | 51.5 | 1 | impomatic_mirage.bfjoust 23:13:45 20 | + + - - - + + - + - + - + + + + - + + - | 61.5 | 4 | nescience_shade.bfjoust 23:13:50 since those do win over it... 23:13:58 why not write more like that! 23:14:22 nescience, anyway go complain about ehird's polarity ones instead 23:14:28 it seems more fruitful 23:14:33 Wow, AnMaster is really easy to wind up for hours 23:14:37 that is where I got the idea in the first place 23:14:38 cya 23:14:39 I may start a hill. 23:14:44 !befunge98 "öäåzyxwvutsrqponmlkjihgfedcba">:#;288**1-`a\0\#x_$$:#;,_@>\,3k0aa+-0x 23:14:44 abcdefghijklmnopqrstuvwxyzå 23:14:53 The "wind up AnMaster a lot" hill. 23:14:59 !befunge98 "åzyxwvutsrqponmlkjihgfedcba">:#;288**1-`a\0\#x_$$:#;,_@>\,3k0aa+-0x 23:14:59 abcdefghijklmnopqrstuvwxyzå 23:15:02 Hmmh 23:15:07 haha 23:15:15 15 | + + + + - - - - + + - + + - + 0 - + - - | 51.5 | 1 | impomatic_mirage.bfjoust 23:15:19 that one seems good 23:15:24 it has no issues with either of mine 23:15:31 AnMaster: because it's more interesting to learn than it is to spam the hill 23:16:04 nescience, as I said. I once ehird stops with those polarity ones I may consider continuing this discussion 23:16:18 * nescience sighs 23:16:22 You're batshit insane. I haven't done a polarity one for ages, and also my polarity switchers tend to do badly. 23:16:23 his shit is annoying too, and i called him on it 23:16:28 but at least it's only 2 entries, not 5 23:16:28 Also, I've stopped now. 23:16:40 And mine don't just draw with each other to stay on the hill 4eva and eva. 23:16:44 !befunge98 "åzyxwvutsrqponmlkjihgfedcba">:#;288**1-`b\0\#x_$$:2j;,_@>\,3k0ab+-0x 23:16:44 abcdefghijklmnopqrstuvwxyzå 23:16:47 !befunge98 "öååzyxwvutsrqponmlkjihgfedcba">:#;288**1-`b\0\#x_$$:2j;,_@>\,3k0ab+-0x 23:16:48 abcdefghijklmnopqrstuvwxyzååö 23:16:51 Yay 23:16:55 Deewiant, how comes your maglev wins against my confusers? 23:17:01 AnMaster: also, didn't anyone ever tell you in school "two wrongs don't make a right"? 23:17:01 !befunge98 "öååzyxwvutsrqponmlkjihgfedcbaabcdefghijklmnopqrstuvwxyzåäö">:#;288**1-`b\0\#x_$$:2j;,_@>\,3k0ab+-0x 23:17:01 öäåzyxwvutsrqponmlkjihgfedcbaabcdefghijklmnopqrstuvwxyzååö 23:17:04 (or whatever ehird wants to call them) 23:17:06 or does that not apply to swedish people or sth 23:17:17 Whee, UTF-8 string output in Befunge-98, only works for the BMP 23:17:18 also AnMaster i thought you didn't like warring program games. 23:17:23 latest update on zzo38's version of BF Joust: apparently he's trying to mix it with poker 23:17:35 lol yeah 23:17:40 has he come up with a card that's worthwhile yet? 23:17:47 AnMaster: [-][+] 23:17:48 ais523: exciting 23:17:48 ehird, I'm interested however in seeing "how can you break the systeme" 23:17:51 always been 23:18:06 system* 23:18:10 AnMaster: Go try and break Freenode then. That way, we don't have to deal with you being a dick and breaking shit for the rest of us, because we won't be able to hear you. 23:18:12 AnMaster: that seems to be a general pastime of this entire channel 23:18:22 ais523: generally we put things back afterwards. 23:18:24 ais523, indeed. Why do you think I'm here 23:18:25 which is why bringing bots here tends to be at the peril of the bot concerned 23:18:26 ehird: agreed 23:18:31 ehird, agreed 23:18:39 AnMaster: Which you have not don. 23:18:39 e 23:18:43 Intend to do it? 23:18:48 ehird, I don't see what there is to put back 23:19:02 Getting rid of your 57 minor variations on the same bloody program that are clogging the hill? 23:19:10 ehird, there are no 57 ones 23:19:15 .......... 23:19:23 Do you do this on purpose? 23:19:26 and why not make programs that beat it 23:19:39 Because they are getting beaten. 23:19:45 it seems that ties are indeed overrated 23:19:57 Or losses 23:20:14 So you just want to leave us wading in a shit hill that we can't play on properly because you don't want to get rid of your exploitation of the bug. 23:20:18 Okie-dokie, dick. 23:20:25 ooh, Microsoft has renamed its search engine 23:20:27 it's now called Bing 23:20:31 ais523: ... 23:20:33 ais523: lol wat 23:20:35 hi ais 23:20:39 hi leonid_ 23:20:45 !bfjoust AnMaster_The_Colour_of_Mälaren (+-)*10000000 23:20:46 http://www.google.com/hostednews/afp/article/ALeqM5hRIu8-oMq5U5Kl6RtgGZAtmoNyfw 23:20:47 Score for AnMaster_AnMaster_The_Colour_of_M__laren: 36.9 23:20:54 although apparently not yet 23:20:58 still at search.live.com 23:21:02 damn 23:21:06 !bfjoust AnMaster_The_Colour_of_Mälaren < 23:21:07 why does that work ?_? 23:21:08 ais523: that's a different thing 23:21:09 I'm sure 23:21:09 Score for AnMaster_AnMaster_The_Colour_of_M__laren: 0.0 23:21:12 !bfjoust The_Colour_of_Mälaren (+-)*10000000 23:21:12 looks like Powerset 23:21:14 ehird: ah, possibly 23:21:15 Score for AnMaster_The_Colour_of_M__laren: 23.0 23:21:19 and Microsoft bought Powerset 23:21:22 so maybe not surprising 23:21:26 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>->([[-][+]>]+)*30 23:21:28 http://powerset.com/ ← still there 23:21:29 Score for Deewiant_maglev: 40.9 23:21:37 Deewiant, thanks 23:21:43 !bfjoust lols (-)*999999 23:21:44 powerset, btw, is pretty crap 23:21:46 Score for leonid__lols: 24.6 23:21:49 leonid_: oh not this again 23:21:52 ah 23:21:56 ehird what was your score? 23:22:00 ? 23:22:04 Deewiant, I'd want to see (+-)*10000000 vs. your maglev 23:22:06 the score for (-)*999999999999999999999999 23:22:10 AnMaster: So add it? :-P 23:22:11 leonid_: 50-something 23:22:14 and 23:22:15 it was 23:22:15 !bfjoust diediedie (-)*128 23:22:15 lol 23:22:17 ()*999999999999999999999999999 23:22:18 Score for Sgeo_diediedie: 4.2 23:22:18 all tied i guess 23:22:18 or w/e 23:22:24 leonid_: I think a load of 9s overflows the sort of ints I'm using 23:22:24 !bfjoust maglev_deewian (>(-)*10)*4(>(+)*10)*4>>->([[-][+]>]+)*30 23:22:27 Score for AnMaster_maglev_deewian: 35.7 23:22:29 AnMaster: Err 23:22:40 AnMaster: I meant add that (+-) thing, maglev is safely on the hill 23:22:46 Deewiant, it isn't 23:22:48 Yes it is 23:22:49 !bfjoust maglev_deewian < 23:22:52 Score for AnMaster_maglev_deewian: 0.0 23:22:56 !bfjoust The_Colour_of_Mälaren (+-)*10000000 23:22:58 lol 23:22:59 Score for AnMaster_The_Colour_of_M__laren: 23.1 23:23:00 because the scoring is whacked 23:23:05 wait what 23:23:12 hum 23:23:17 AnMaster: tie 23:23:20 -!- ehird has changed nick to AnMaster_. 23:23:25 Deewiant, no, loss 23:23:26 !bfjoust blaaaaaaaaaaaaaaaaaaa . 23:23:28 Ah, true 23:23:29 Score for AnMaster__blaaaaaaaaaaaaaaaaaaa: 21.1 23:23:30 -!- AnMaster_ has changed nick to ehird. 23:23:32 Looked at wrong column 23:23:52 ehird, you so fail at life 23:24:03 -!- AnMaster has changed nick to AnMaster_. 23:24:07 What a fresh, interesting insult. 23:24:08 !bfjoust blaaaaaaaaaaaaaaaaaaa < 23:24:11 Score for AnMaster__blaaaaaaaaaaaaaaaaaaa: 0.0 23:24:11 Did the scoring algorithm just change? 23:24:11 You fail at life. 23:24:12 -!- AnMaster_ has changed nick to AnMaster. 23:24:13 Amazing/ 23:24:20 Truly amazing, AnMaster I give you the insult award 2009. 23:24:23 ehird, going to such a low 23:24:24 My ego is deplenished. 23:24:26 as you did 23:24:37 I am going to go shoot myself because of how worthless you have shown my life to be. 23:24:45 !bfjoust lols (>[+])*20 23:24:48 Score for leonid__lols: 32.1 23:24:50 Indeed, I would give my dying words, if I thought that anyone would ever care for me again. 23:24:51 nice 23:24:57 But my name will be lost in the sands of time. Goodbye. 23:24:58 → 23:25:03 !bfjoust lols (>[+])*20 23:25:06 Score for leonid__lols: 32.6 23:25:09 !bfjoust lols (>[+])*25 23:25:12 Score for leonid__lols: 34.4 23:25:13 ehird: is that a genuine →, or are you still here? 23:25:18 !bfjoust lols (>[+])*30 23:25:21 Score for leonid__lols: 32.8 23:25:28 also, I just noticed control-I inserts a literal tab character in this client 23:25:35 This is Elliott's mother, I am sorry to report that he has just shot himself. 23:25:40 Please bear with us in this difficult time. 23:25:43 !bfjoust lols (->[+])*20 23:25:46 Score for leonid__lols: 46.5 23:25:48 whoa 23:25:52 His suicide note tells me to call AnMaster a bedwetter. 23:25:53 ehird: Pics or it didn't happen 23:25:57 AnMaster: you are a bedwetter. 23:26:00 Now I shall go and cry. → 23:26:01 !bfjoust lols_down (->[-])*20 23:26:03 !bfjoust lols (->[+])*15 23:26:03 Score for Sgeo_lols_down: 10.4 23:26:06 Score for leonid__lols: 12.2 23:26:11 ehird: I doubt your mother knows how to type a Unicode arrow 23:26:13 leonid_: Nice luck with the randomizer there :-P 23:26:13 although i might be wrong 23:26:16 yeah 23:26:28 aw, i think i didn't save the code for creep 23:26:28 ais523: It is a Hird skill, passed down generation to generation. 23:26:31 !bfjoust lols (->[+])*20 23:26:33 Score for leonid__lols: 46.5 23:26:39 another luck ?_? 23:26:44 !bfjoust lols (->[+])*20 23:26:47 Score for leonid__lols: 46.5 23:26:54 leonid_: The random only depends on the source codes 23:27:01 !bfjoust lols (+>[+])*20 23:27:03 Score for Sgeo_lols: 22.6 23:27:05 i see 23:27:05 or anything so far really 23:27:22 !bfjoust lols ([-]->[+])*20 23:27:25 Score for leonid__lols: 17.1 23:27:29 !bfjoust lols ([+]->[+])*20 23:27:32 Score for leonid__lols: 10.0 23:27:34 nah 23:27:41 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>->([[-][+]>]+)*30 23:27:44 Score for Deewiant_maglev: 32.4 23:27:50 !bfjoust lols (->[+])*21 23:27:50 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>([[-][+]>]+)*30 23:27:52 Score for leonid__lols: 21.7 23:27:53 Score for Deewiant_maglev: 29.4 23:27:55 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>-([[-][+]>]+)*30 23:27:56 !bfjoust lols (->[+])*19 23:27:57 Score for Deewiant_maglev: 39.8 23:27:59 Score for leonid__lols: 19.5 23:28:02 !bfjoust lols (->[+])*20 23:28:05 Score for leonid__lols: 46.1 23:28:09 so 20 is the magic number 23:28:14 !bfjoust lols (->[+])*21 23:28:17 Score for Sgeo_lols: 17.9 23:28:42 ehird: i don't suppose you saved any of the code? :P 23:28:49 nescience: for what? 23:28:55 it's scrolled right out of my buffer now 23:29:02 creep, and/or other programs you swapped +- on 23:29:08 oh 23:29:12 nescience: just take the swapped one and swap it again 23:29:17 http://codu.org/eso/bfjoust/in_egobot/ 23:29:50 !bfjoust lols (-->[+])*20 23:29:52 Score for Sgeo_lols: 10.4 23:29:57 !bfjoust lols (--->[+])*20 23:30:00 Score for Sgeo_lols: 10.7 23:30:03 Hah 23:30:04 !bfjoust lols (+>[+])*20 23:30:07 Score for Sgeo_lols: 26.4 23:30:09 !bfjoust lols (++>[+])*20 23:30:12 Score for Sgeo_lols: 23.2 23:30:15 oh, it's still on? 23:30:51 not there anymore, oh well 23:31:10 You can hg clone that directory to get old ones. 23:31:21 !bfjoust lols (-+->[+])*20 23:31:24 Score for leonid__lols: 16.1 23:31:31 lost me there.. what's hg clone? 23:31:40 hg = version control system 23:31:42 at a console: 23:31:45 GregorR-L: Eh, they're all hg'd? 23:31:46 $ hg clone http://codu.org/eso/bfjoust/in_egobot/ 23:31:51 Deewiant: Yeah. 23:31:59 Deewiant: So I can rewind history to piss of AnMaster. 23:32:04 :-) 23:32:13 oh interesting 23:32:18 The piss of AnMaster. 23:32:20 You can verb it. 23:32:39 i think i have a vm somewhere i can do that in 23:33:03 why vm? 23:33:40 vmmm vm 23:33:51 !choo vvvvvvvvm 23:33:52 vvvvvvvvm vvvvvvvm vvvvvvm vvvvvm vvvvm vvvm vvm vm m 23:34:09 !choo vrrrrrrrrrrrrrm 23:34:10 vrrrrrrrrrrrrrm rrrrrrrrrrrrrm rrrrrrrrrrrrm rrrrrrrrrrrm rrrrrrrrrrm rrrrrrrrrm rrrrrrrrm rrrrrrrm rrrrrrm rrrrrm rrrrm rrrm rrm rm m 23:34:12 because i don't run linux :P 23:34:13 You still have to know how to wander about an hg archive to get the old ones though :P 23:34:13 hmm... 23:34:17 you can't reduce the rs 23:34:18 !cho foo 23:34:24 ?choo foo 23:34:30 ^choo foo 23:34:30 foo oo o 23:34:36 i'm smart, i can figure it out 23:34:40 ^help 23:34:40 ^ ; ^def ; ^show [command]; lang=bf/ul, code=text/str:N; ^str 0-9 get/set/add [text]; ^style [style]; ^bool 23:34:42 myndzi: you can run hg in windows 23:34:45 *on 23:35:13 GregorR-L: No summaries on those commits, nice :-P 23:35:20 Deewiant: They're all automated. 23:35:29 Yes, you could have an automated message there 23:35:34 I use hg log --removed -p | less to browse. 23:35:35 Something that'd make 'hg log' useful 23:35:52 *eh* 23:36:01 *peh* 23:36:02 apt-get install is simpler in this case though 23:38:03 GregorR, did you keep the best of those? 23:38:04 also 23:38:11 if you hate clogging history so 23:38:14 why all the defenders 23:38:21 ... 23:38:22 what? 23:38:43 defender6, defender7, defender6_parody 23:38:50 just rewrite defender! 23:38:54 ... 23:38:54 (same thing!) 23:38:57 No. 23:39:00 Their code is nothing alike. 23:39:10 Their essential strategy is alike, but yours were almost the same code. 23:39:11 Nice strawman. 23:39:58 ehird: Your polarity-stuff is a bit pointless though. 23:40:09 yeah, that's why i stopped. 23:40:43 I'd kill off the defend6 and slowrush flips 23:41:01 I dunno, some of them do really well occasionally :P 23:41:11 kay, though 23:41:16 Sure, but that's mostly due to the base programs being good :-P 23:41:22 !bfjoust the_unknowable_reversi_of_slowrush < 23:41:25 Score for ehird_the_unknowable_reversi_of_slowrush: 0.0 23:41:31 !bfjoust shade_needs_to_get_laid < 23:41:34 Score for ehird_shade_needs_to_get_laid: 0.1 23:41:40 0.1? 23:41:41 hahaha 23:41:41 !bfjoust defend6_a_parody_or_just_plain_ripoff_question_mark < 23:41:48 Score for ehird_defend6_a_parody_or_just_plain_ripoff_question_mark: 0.4 23:41:51 Why are you killing all your own? 23:41:58 shade_needs_to_get_laid looked like it changed more than just polarity 23:41:58 !bfjoust fucking_termoil_wants_me_to_term_oil < 23:42:01 Score for ehird_fucking_termoil_wants_me_to_term_oil: 0.8 23:42:14 Deewiant: that one was just s/[-]/[(-)*128[-]]/ 23:42:28 GregorR-L: I just killed all my ripoffs + one that is deliberately rubbish 23:42:32 Which is all the ones on the current hill. 23:42:39 GregorR-L: Feel free to rm ehird_* 23:42:50 it'll interestify the hill 23:44:10 !bfjoust pooper_scooper [>([{}-])%5+] 23:44:13 Score for GregorR-L_pooper_scooper: 27.9 23:44:18 GregorR, why didn't you keep my best one 23:44:25 instead of an old mediocre one 23:44:33 now I have to resubmit them 23:44:38 is that really what you wanted 23:44:39 I didn't keep or delete anything, I only removed ehird_* 23:44:39 AnMaster: Oh fuck you 23:44:58 !bfjoust lols (.[+]+)*1000 23:45:01 Score for leonid__lols: 14.4 23:45:13 ehird, no. I would have been happy if he had kept the actual best one 23:45:17 The pinnacle of AnMaster's intelligence: threatening to resubmit a bunch of shitty, almost-the-same challengers because GregorR-L didn't do anything. 23:45:27 ehird, so where did they go? 23:45:29 !bfjoust lols (.[+]+)*10000(>[+])*20 23:45:32 Score for leonid__lols: 10.0 23:45:36 They got bumped off the hill, presumably. 23:45:38 AnMaster: They dropped off the hill because they sucked. 23:45:39 !bfjoust vibration (-)*127(-+)*20000 23:45:39 !bfjoust lols (.[+]+)*10000>(->[+])*20 23:45:42 The truth hurts. 23:45:42 Score for leonid__lols: 11.6 23:45:43 Score for ais523_vibration: 23.4 23:45:45 GregorR-L, they didn't the score is wrong for that 23:45:48 !bfjoust vibration (-)*127(-+)*20000 23:45:50 !bfjoust lols ([+]+)*10000>(->[+])*20 23:45:51 Score for ais523_vibration: 23.4 23:45:51 ... what 23:45:53 Score for leonid__lols: 13.5 23:46:12 ais523: you get killed after the 127 -s, probably 23:46:15 try a smaller number 23:46:16 !bfjoust lols ([+](-)*100)*100>(->[+])*20 23:46:19 Score for leonid__lols: 14.0 23:46:25 leonid_: are you actually putting any logic into those? 23:46:29 ehird: the 127 is deliberate 23:46:30 http://codu.org/eso/bfjoust/in_egobot/ does not appear to be an hg repository 23:46:35 ais523: why? 23:46:38 the problem is, I can't set up fast enough 23:46:39 myndzi: ? it is 23:46:43 defending then attacking maybe ?_? 23:46:45 the idea is to hope that the opponent misses the flag altogether 23:46:45 the error says otherwise 23:46:46 and falls off 23:46:54 unless the syntax quoted earlier is incorrect 23:46:54 because it's 0 every other cycle 23:47:05 but I can't set up in time 23:47:10 myndzi: E_WORKSFORME 23:47:14 ais523: I think I tried something like that, and yeah, it's a bit slow 23:47:15 ooh, idea 23:47:25 !bfjoust vibration >---->++++<<(-)*127(-+)*20000 23:47:28 Score for ais523_vibration: 41.4 23:47:34 Nice. 23:47:40 !bfjoust lols (->[+])*20 23:47:42 Score for leonid__lols: 32.4 23:47:48 it beats slowrush 23:47:56 Hah 23:48:23 !bfjoust antivibration [>[+]-]-- 23:48:25 Score for ehird_antivibration: 13.9 23:48:32 ehird: is that designed to beat vibration? 23:48:40 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>-([[-][+]>]+)*30 23:48:43 Score for Deewiant_maglev: 32.3 23:48:43 ais523: as a first prototype, yes 23:48:44 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>-([[-][+][-]>]+)*30 23:48:47 Score for Deewiant_maglev: 39.8 23:48:50 ais523: the idea is to find a zeroed cell and then zero it some more 23:48:56 ^ better antivibration 23:49:04 !bfjoust vibration >>>++++<----<++++<(-)*127(-+)*20000 23:49:05 And better overall, too, which I didn't expect :-P 23:49:07 Score for ais523_vibration: 48.3 23:49:16 Darn 23:49:19 doing it that way round gives me slightly more setup time 23:49:32 !bfjoust antivibration [[>]-[-[-[-]]]+] 23:49:32 !bfjoust vibration >---->++++<<(-)*127(-+)*20000 <-- try higher number. You miscounted 23:49:35 Score for ehird_antivibration: 13.8 23:49:36 Now I lose again, I wonder why 23:49:43 AnMaster: what's the time limit 23:49:46 ais523: 100k 23:49:47 ais523, 100k 23:49:50 !bfjoust vibration >>>++++<----<++++<(-)*127(-+)*50000 23:49:52 snap 23:49:53 Score for ais523_vibration: 38.9 23:49:58 you made it worse! 23:50:06 No, that'd be the random number generator :-P 23:50:07 ais523, just use the old one 23:50:14 or 23:50:16 ooh, better idea 23:50:20 fudge the number 23:50:25 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>-([([-][+])*2>]+)*30 23:50:27 Score for Deewiant_maglev: 33.3 23:50:29 !bfjoust lols (---+)*10000 23:50:31 Score for leonid__lols: 27.5 23:50:41 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>-([[-][+][-][+]>]+)*30 23:50:46 !bfjoust vibration_fool >>>++++<----<++++<(-)*127(-+)*5000[>[-(.)*128]] 23:50:47 Score for Deewiant_maglev: 35.5 23:50:49 Score for ais523_vibration_fool: 44.5 23:50:49 arrgh i'm dumb 23:51:03 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>-([[-][-][+]>]+)*30 23:51:05 Score for Deewiant_maglev: 34.1 23:51:10 ais523, um? 23:51:11 ais523: btw, a good argument for [-] not taking the cycle to make you win: "[]hey, i've been zeroed, let's react" doesn't work 23:51:14 That one beats the vibrators 23:51:20 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>-([[-][-][+][+]>]+)*30 23:51:23 Score for Deewiant_maglev: 37.7 23:52:03 AnMaster: if the opponent doesn't turn up for ten-thousand cycles, almost certainly it's a defence program 23:52:09 so switch to a counter-defence strategy 23:52:10 !bfjoust maglev (>(-)*10)*4(>(+)*10)*4>>-([([-])*2([+])*2>]+)*30 23:52:12 ais523, ai 23:52:13 ah* 23:52:13 Score for Deewiant_maglev: 44.3 23:52:25 !bfjoust barbeque [(+)*256] 23:52:26 ehird: if the ] jumps to the [ rather than to itself, [] still detects itself being zeroed 23:52:28 Score for GregorR-L_barbeque: 24.6 23:52:31 Now it loses against the original vibration again 23:52:35 Hmmh 23:52:50 ais523: I know, but the point is, you can do [] to monitor if an opponent's just zeroed you, and have time to react 23:52:52 Which is nice. 23:52:53 !bfjoust melodic_fooltool [-[+[-[+[-[+[-[+]-]+]-]+]-]+]-] 23:52:56 Score for ehird_melodic_fooltool: 12.2 23:53:01 ehird: oh, agreed it's nice 23:53:05 I thought you were saying that was a bad thing 23:53:15 Haha, melodic_fooltool wins against shade. 23:53:17 so are you saying you agree with [-] being equivalent to -.-.-.-.-.-.-. in the absence of zeroes? 23:53:21 ehird: ([](+)*100)*100000? :-P 23:53:25 ais523: Well, it doesn't work 23:53:33 By the time [] realises you're zeroed, a cycle passes 23:53:35 and thou hast lost 23:53:50 !bfjoust melodic_fooltool_variant >+>+>[-[+[-[+[-[+[-[+]-]+]-]+]-]+]-] 23:53:53 err 23:53:53 Score for AnMaster_melodic_fooltool_variant: 15.2 23:53:56 !bfjoust melodic_fooltool_variant >+>+>+[-[+[-[+[-[+[-[+]-]+]-]+]-]+]-] 23:53:58 Score for AnMaster_melodic_fooltool_variant: 23.9 23:53:59 even 23:54:00 AnMaster: Wow. You're a hypocrite. 23:54:04 ehird: ah, yes 23:54:07 "ehird, don't rip off others' programs and just change a minor detail!" 23:54:10 ehird, I'm going to delete it now 23:54:12 you could change that by making [] take the value at the end of the cycle 23:54:15 kay 23:54:15 !bfjoust melodic_fooltool_variant < 23:54:17 Score for AnMaster_melodic_fooltool_variant: 0.0 23:54:19 ais523: Yes 23:54:21 ehird, just wanted to test an idea 23:54:29 ais523: otoh, you could probably make an unbeatable program that way 23:54:36 [](+)*99999999999 23:54:41 nah, it wouldn't be unbeatable 23:54:41 or whatever 23:54:42 !bfjoust dumbfend [>(+)*128] 23:54:45 Do not meddle in the affairs of ehirds, for they are blunt and quick to anger 23:54:45 ehird, and it seemed my idea worked better 23:54:45 Score for GregorR-L_dumbfend: 18.0 23:54:50 but the other program would have to predict what it was going to do next 23:54:53 Deewiant: totally 23:54:59 ais523: Sounds interesting. 23:55:09 ais523: Think I should put that in my interp? 23:55:10 not really, it would just be a 1/3 chance of being right 23:55:18 I mean, the strategy of [] 23:55:18 with no strategy involved 23:55:24 Is it bad? :P 23:55:34 hmm... it may be interesting to experiment with 23:55:45 but I don't think we should change it to default until we look at what becomes possible and impossible due to it 23:55:48 !bfjoust ehirds_melodic_fooltool_variant >+>+>+>+<+<[-[+[-[+[-[+[-[+]-]+]-]+]-]+]-] 23:55:49 !bfjoust lols (-)*63(->[+])*20 23:55:51 -!- Sgeo_ has joined. 23:55:52 Score for leonid__lols: 20.6 23:55:52 Score for AnMaster_ehirds_melodic_fooltool_variant: 23.8 23:55:52 ais523: right 23:55:58 !bfjoust king >>>[(++)*256>(+)*128<-] 23:55:58 !bfjoust ehirds_melodic_fooltool_variant >+>+>+>+<<[-[+[-[+[-[+[-[+]-]+]-]+]-]+]-] 23:56:02 Score for KingOfKarlsruhe_king: 18.7 23:56:02 Score for AnMaster_ehirds_melodic_fooltool_variant: 26.6 23:56:07 !bfjoust ehirds_melodic_fooltool_variant < 23:56:10 Score for AnMaster_ehirds_melodic_fooltool_variant: 0.0 23:56:30 !bfjoust melodic_toolfool (-[{(+[]-)%50}]+)%50 23:56:32 Score for ehird_melodic_toolfool: 0.0 23:56:35 !bfjoust lols ((-)*64>(+)*64>)*15(>[+])*15 23:56:38 Score for leonid__lols: 5.8 23:56:40 I am very good at being bad. 23:56:40 whoa 23:57:02 is it same as being very bad at being good? 23:57:06 ehird: You put a % where there were no {} 23:57:07 !bfjoust ehirds_melodic_fooltool_variant >++>>+>+>+>++<<[-[+[-[+[-[+[-[+]-]+]-]+]-]+]-] 23:57:10 Score for AnMaster_ehirds_melodic_fooltool_variant: 25.4 23:57:11 Oh 23:57:14 !bfjoust ehirds_melodic_fooltool_variant < 23:57:17 interesting 23:57:17 Score for AnMaster_ehirds_melodic_fooltool_variant: 0.0 23:57:19 !bfjoust melodic_toolfool (-[{(+[]-)*50}]+)%50 23:57:22 Score for ehird_melodic_toolfool: 21.1 23:57:47 ais523: toolfool draws with vibration 23:58:01 wait, no. 23:58:03 ehird: neither contains < or > 23:58:05 so it isn't surprising 23:58:05 ais523: Toolfool wins against vibration. 23:58:13 !bfjoust king (++)*512[>(+)*512<-] 23:58:16 Score for KingOfKarlsruhe_king: 6.5 23:58:46 ehird: so it does. But how? Neither of them move left or right... 23:58:55 and I don't think the original vibration suicides 23:58:58 ais523: No idea. 23:59:19 It also wins against shade. 23:59:27 !bfjoust lols ((-)*64>(+)*64>)*8(>[+])*15 23:59:29 Score for leonid__lols: 14.5 23:59:45 !bfjoust lols ((-)*64>(+)*64>)*7(>[+])*20 23:59:47 Score for leonid__lols: 26.0 23:59:57 !bfjoust king (++>)*20[<-]