00:11:31 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 00:22:38 @hoogle (a -> b -> b) -> a -> Int -> [b] -> (a, [b]) 00:22:39 No results found 00:23:51 hellørjan. what for is to do so? 00:25:04 :t \f x n -> first (foldl' f x) . splitAt n 00:25:05 (c -> a -> c) -> c -> Int -> [a] -> (c, [a]) 00:25:36 it's the type of that, which is a function which can be done more optimized by _not_ using splitAt 00:26:24 oh hm 00:26:38 misordered 00:26:51 It's not that much less optimized. 00:26:52 @hoogle (a -> b -> a) -> a -> Int -> [b] -> (a, [b]) 00:26:52 No results found 00:27:10 Jafet: it leaks memory if n is large 00:28:01 while it can actually be done in constant memory by explicit recursion 00:28:27 Well, don't use the snd first. 00:29:52 i got the idea from this http://stackoverflow.com/questions/25961869/improving-performance-on-chunked-lists 00:31:18 :t \(a, b) -> (a, seq a b) 00:31:19 (t, t1) -> (t, t1) 00:35:28 -!- shikhout has joined. 00:39:11 -!- shikhin has quit (Ping timeout: 272 seconds). 01:00:57 -!- AndoDaan has quit (Ping timeout: 244 seconds). 01:04:06 -!- AndoDaan has joined. 01:05:59 "Yes, hardcore developers laugh when the monks of the Spider Clan speaking about “programming” in HTML, JSTL, CSS, or Javascript. Until the customer decides that the application’s home page absolutely must have dancing translucent pigs follow the mouse cursor in IE 5.5." 01:12:58 -!- AndoDaan has quit. 01:13:56 -!- boily has quit (Quit: EXPERIMENTAL CHICKEN). 01:28:38 -!- perrier has joined. 01:30:07 -!- perrier has quit (Remote host closed the connection). 01:31:02 -!- perrier has joined. 01:35:15 -!- drdanmaku has joined. 01:48:13 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 01:57:33 -!- nisstyre has quit (Changing host). 01:57:34 -!- nisstyre has joined. 01:59:40 http://thecodelesscode.com/case/30 02:00:05 I'm not sure I get it. Is the one-byte integer signed?... yeah, that has to be it, I think 02:00:07 Also with the cups 02:00:29 And I don't get the broom at all 02:22:32 To sign extend a 6-bit number in 6502 assembly code, is this a good way? ASL A : ASL A : ANC #255 : ARR #255 : ROR A 02:26:28 -!- shikhout has quit (Ping timeout: 272 seconds). 02:27:12 I'm beginning to appreciate Racket more and more, although it's not as batteries included as it claims 02:27:30 No good story for client-side cookie handling, for one 02:31:15 Is there better way to sign-extend 6-bits? 02:55:30 -!- Sorella has quit (Remote host closed the connection). 03:08:18 in Cl i'd do a&=63; a-=a&32 03:09:02 when a is of type char 03:09:22 well, does't matter; works same for larger types 03:12:16 you can do it even faster 03:13:11 a -= a&-32 03:14:21 hmm, wait 03:16:51 you need a -= (a&-32) + (a&32) 03:28:45 That isn't a 6502 code though 04:36:41 -!- conehead has joined. 04:46:18 -!- pi___ has joined. 05:11:26 -!- oerjan has quit (Quit: leaving). 05:23:23 ahaha http://thecodelesscode.com/case/104 05:24:14 not bad. 05:28:16 Is this me? http://thecodelesscode.com/case/107 05:30:28 Sgeo: I guess the cups are a reference to a signed integer; the commentary makes them sound like positional binary digits, and the last one is different. Based on the poem, maybe the broom is about the same thing: the signedness is not inherent to having 8 bits, much like sweeping dust is not inherent to a thing that looks like a broom. 05:31:15 fizzie: the last one is a sign bit then? 05:31:26 that finally makes sense. 05:37:56 "For the security of your account, we are poised to open a query. Kindly click on the link: [obvious non-obscured phishing link], for good security practice." 05:44:37 Sgeo: I am far too 'young' as a programmer to see myself in case 107, and yet ... 06:04:06 -!- MoALTz_ has quit (Quit: Leaving). 06:04:25 Someone watches the television show, but now since every channel has the same man on it, they try to put in a DVD and watch that; but, he secretly replaced the DVD with a recording of himself, having a conversation with the viewer; he anticipated all of the questions and timing so he can answer them... 06:04:33 And then, the viewer decides to rewind it a bit due to being confused and wants to figure it out, but this was also anticipated, and all of the things he says are suitable for the new questions too (even though it is in fact all the same things)... 06:05:53 Do you like this kind of things? 06:07:20 -!- AndoDaan has joined. 06:10:25 The puns, they burn 06:10:26 http://thecodelesscode.com/case/128 06:19:27 128 reminds me of the BLIT story. 06:26:01 " When the real meets the imaginary, their product is always complex." XD 06:26:47 zero, zero 06:28:23 I completely misinterpreted http://thecodelesscode.com/case/136 the first time I read it 06:28:37 zzo38: doesn't 6502 have like cheap jumps? could you do something like, AND #$3F; CMP #$20; BCC t; IOR #$C0; t:; 06:28:48 I parsed '“To share important news,” said Zjing. “While observing the party, I discovered a form of communication that cannot be transmitted over IP sockets.”' as meaning some kind of disaster because a new protocol would need to be used which isn't widely supported 06:29:11 though what you said might be shorter 06:30:43 b_jonas: Shorter by one byte, yes. (Also it is called ORA rather than IOR) 06:30:52 ok 06:31:23 Yours is a bit faster though. 06:31:54 [wiki] [[Special:Log/newusers]] create * WinnieTFCfszeh * New user account 06:32:47 Two new users in as many days. We're in an Eso rennaisance. 06:33:26 zzo38: can you just shift left twice then rotate right twice? 06:34:48 Rotate right will rotate through the carry flag. 06:36:03 So, it doesn't work. 06:36:52 hmm 06:37:24 so how about (shift left twice, clear carry, rotate right, clear carry, rotate right); or else (shift left twice, rotate right twice, and)? 06:37:32 wouldn't that still come out shorter but probably slower? 06:37:47 I've no idea how shifts and rotates work in the 6502 06:38:35 The ASL and LSR command shift in a cleared bit and puts shifted out bit into the carry flag. ROL and ROR act similar except that the shifted in bit is the old carry flag. 06:39:19 there's an LSR? that's even simpler then 06:39:33 no wait 06:39:36 um 06:39:48 damn 06:39:52 no it doesn't work 06:40:32 -!- AndoDaan has quit (Remote host closed the connection). 06:40:49 -!- AndoDaan has joined. 06:41:31 Also ARR acts like AND followed by ROR A, but then it sets the carry flag to bit6 of the result. 06:41:45 ANC is AND and then copy the high bit (bit7) of the result into the carry flag. 06:41:55 wait what? 06:42:05 ALR is like AND immediate followed by LSR A. 06:42:15 isn't one of those right shift instructions unreliable and undocumented? 06:42:32 I totally thought the 6502 doesn't have a sane right shift 06:42:35 All are unofficial, but they are all reliable. 06:42:41 huh 06:42:56 I thought at least one was undocumented because it's unreliable 06:43:16 There are unreliable instructions too, but these aren't them. 06:43:17 as in, it was planned to work originally, but didn't work well, so they just made it undocumented 06:43:25 ok 06:47:31 So both of these two ways my and your can help in some ways; one shorter, one faster (in both cases not by much), but maybe there is an even better way; let's see! I can try to think of it too. 06:47:40 yeah 06:48:11 it's funny, I'm used to thinking of modern cpus, where shift/rotates are still expensive, but jumps are also often expensive 06:48:46 but of course x86 have nice ways to avoid jumps 06:49:07 Well, in 6502, shift/rotates of the accumulator are fast, but when acting on memory they are slow. Jumps in 6502 are 3 or 4 cycles, or 2 if the branch is not taken. 06:52:41 For some reason I didn't think of the code you posted, because I looked at Infocom's code which is similar but has a lot of junk added to it, and I inadvertently rejected it... 06:55:11 I still try to think of if there is an even better one though. 06:55:38 oh 06:55:44 I see 06:56:42 It is a size/speed trade, I suppose. 06:56:58 dunno, I was thinking of *(ASL; ASL; CMP #$80; ROR; CMP #$80; ROR) only I think that doesn't work because the carry flag is the complement of what we want 06:58:34 Unlike Z80, 6502 doesn't have a "complement carry flag" instruction. 06:59:01 technically if you have a lot of memory, you could use a lookup table like TAX; LDA lookup,X; 06:59:11 But as it happens, in the case I am using it happens to be in both the X and A registers already. 06:59:23 that's fast but takes 260 bytes 06:59:41 hmm wait, that's a good idea 06:59:44 And yes I did think of that too; I might use it, although I don't need TAX since it is already in X 07:00:14 can you store a copy in X and use some instruction to get the high bit to the carry flag from X somehow? 07:00:15 I probably do have enough ROM space, and it is also possible to make overlapping tables 07:00:24 (that probably won't work) 07:01:23 if you want shorter tables, AND #$3F; TAX; LDA lookup,X; that takes 64+6 bytes I think 07:02:10 There are some instructions that deal with both A and X registers at once, such as LAX (combining LDA and LDX), SAX (storing the bitwise AND of the values in A and X), and AXS (calculate bitwise AND of A with X, subtract an immediate ignoring the carry flag, storing the result in X). 07:03:07 I will probably use a full lookup table, and then change it if I run out of memory 07:03:52 what are you making? 07:04:25 Z-machine interpreter, this time using a new mapper I made up, which bankswitches one byte at a time 07:05:14 wait wait 07:06:46 I wonder if it's possible to do something with shifts and subtract or xor to flip bit 5 07:06:55 Here is a description of the mapper: http://wiki.nesdev.com/w/index.php/User:Zzo38/Mapper_I 07:07:25 Actually, I wonder whether or not sign-extending is really even the best way to do what I am trying to do. 07:07:47 Huh, so there are other Racket users here 07:08:33 Sgeo: I am one. 07:08:49 Currently fighting with the old try-racket code trying to get it to run without X dependencies. 07:08:58 J_Arcane: you're who I was referring to 07:09:01 I expect this small bank size can speed it up a lot 07:09:10 * Sgeo would like a try-racket website 07:09:16 Me too. 07:09:54 There's code for one, but no one's hosting it anywhere, so I cashed out a $20 from my book royalties and bought a VPS and a domain. It's running now, but with issues; the picts don't work right. 07:10:06 Also I stil have to set the domain to redirect right. 07:10:20 Do people use 2hdtp for images, or is there a more ... non-learner image library? 07:10:40 pict is the standard library. 07:10:52 (Not only the small bank size, but also the register mirroring overlapping the Famicom's internal RAM) 07:10:55 2htdp is mostly just some easy to use wrappers for it, is my understanding. 07:11:00 Ah cool 07:11:11 Slideshow also imports variant versions of the pict library. 07:17:32 zzo38: AND #$3F; EOR #$20; CLC; ADC #$60; EOR #$80; 07:17:43 zzo38: that's 9 bytes but is probably quite fast 07:17:54 though it might not be faster than the conditional one 07:18:59 zzo38: also look in this book, it might help: http://www.hackersdelight.org/ 07:21:14 Thank you, although I think I might try something other than sign-extension, since I am not even sure sign extension is actually correct for what I am trying. 07:24:49 zzo38: is it possible to write that in such a way that the CLC is redundant because the carry flag just happens to be clear from previous instructions? 07:26:27 That last example, yes; use ANC instead of AND. 07:28:05 The DNS is propogating now, but I still have to change the default port and make sure my firewall isn't blasting all my ports to the world. 07:28:06 great 07:28:12 that's quite fast and short then 07:28:26 8 bytes, not the shortest 07:29:13 (ANC is like AND, but also copies the high bit of the result to the carry flag. Unofficial instructions are pretty strange, but useful anyways.) 07:29:30 well, the conditional one is faster when the branch is not taken 07:30:08 Yes, it is true 07:30:50 how much time does ANC imm take? 3 cycles? 07:31:04 Two cycles, just like AND imm. 07:31:19 (Also, ANC cannot use any other addressing modes than immediate) 07:31:19 oh 07:31:22 that's even better 07:31:57 that makes this quite fast I think 07:32:06 faster than I thought 07:35:47 When trying to figure out how to decrement a 16-bit number stored in variables $11 and $21 while at the same time loading the mapper registers with their new values, I came up with several things and decided on this: LDA $1021; ORA #255; DCP $1011; BNE L1; DEC $1021; L1: ... 07:36:38 Other things I have tried include: LAX <$11; AXS #1; STX $1011; LDA <$21; SBC #0; STA $1021 and then LDX <$11; BNE L1; DEC $1021; L1: DEX; STX $1011; BIT $1021 07:37:43 Which are respectively: 14 bytes, 18 cycles; 14 bytes, 16 or 21 cycles. The one I then decided on in the end is: 13 bytes, 15 or 20 cycles. 07:38:40 ("DCP x" acts like "DEC x" followed by "CMP x", but is as fast as "DEC x" (since it doesn't reread the value), as well as supporting more addressing modes.) 08:09:18 -!- AnotherTest has joined. 08:21:37 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:23:20 zzo38: I'm a fool, the second xor is redundant 08:23:47 zzo38: AND #$3F; EOR #$20; CLC; ADC #$E0; 08:24:13 or equivalently, EOR #$20; ANC #$3F; ADC #$E0; 08:24:46 that's only six bytes 08:25:36 -!- Patashu has joined. 08:29:45 OK 08:33:26 zzo38: and I should have known this because Hacker's Delight chapter 2-6 tells it straight: http://www.hackersdelight.org/basics2.pdf 08:33:51 see second formula there 08:34:03 that's where I should have looked in first place 08:38:19 Ah, OK! 08:39:23 (or in Knuth volume 4 of course) 08:39:44 Dammit, I hate dealing with DNS. 08:40:04 does not service 08:40:41 ANC, hmm. 08:41:25 -!- Phantom_Hoover has joined. 08:43:25 adorable. "note to ANC: this command performs an AND operation only, but bit 7 is put into the carry, as if the ASL/ROL would have been executed." 08:56:55 int-e: bit 7 of the input or bit 7 of the result? 08:57:09 Bit7 of the result. 08:57:18 whew 09:25:50 -!- conehead has quit (Quit: Computer has gone to sleep). 09:31:34 I have hackersdelight laying right next to me :) 09:31:36 good book 09:41:05 -!- choochter has joined. 10:03:33 mroman_: nice 10:14:51 -!- boily has joined. 10:16:39 -!- Patashu has quit (Remote host closed the connection). 10:17:00 -!- Patashu has joined. 10:17:52 CommonMark has and stuff 10:17:56 wth 10:21:08 wait... it doesn't have tables? 10:24:39 Neither does traditional Markdown, to be fair. 10:26:12 true 10:26:21 but since they are trying to improve it a bit 10:26:27 it might have been good to have tables 10:26:54 For me the idea behind markdown is that it is supposed to be human readable in a text-editor 10:27:03 but can also be easily converted to html, latex etc. 10:27:23 html tables aren't so much human readable imo 10:27:43 I think it's actually bad to allow HTML in it 10:27:54 you can't render html to other formats EXCEPT html neatly 10:28:14 it's not human readable... it's render target specifc 10:31:09 A line break (not in a code span or HTML tag) that is preceded by two or more spaces is parsed as a linebreak (rendered in HTML as a
tag): 10:31:12 ok so 10:31:28 You can't visualy see if it's a line break or not 10:31:34 because 10:31:36 foo 10:31:36 bar 10:31:41 ^-
10:31:42 foo 10:31:43 bar 10:31:45 ^- no
10:32:01 (notice the two spaces after the first foo) 10:34:27 [wiki] [[Object oriented thue]] M http://esolangs.org/w/index.php?diff=40514&oldid=40511 * 4D enthusiast * (+258) /* Syntax */ clarified RHS instance numbering 10:37:10 [wiki] [[Object oriented thue]] http://esolangs.org/w/index.php?diff=40515&oldid=40514 * 4D enthusiast * (-72) /* Syntax */ changed copying example to include explicit numbering 10:44:25 Yeah, I'm not a great fan of that particular syntax; but it's also just codifying existing practice. 10:48:22 (I think many Markdown syntax highlighting modes probably provide a visual indication for that.) 10:51:03 html can be rendered to pdf or stuff 10:51:18 but you *have* to define your page size 10:51:28 and what happens when it's not enough 10:53:19 pdf rendering is a nightmare. pdf rendering from html is... the experience is painful. 10:54:23 add some enterprise software to that, and a half-assed underdevelopped obscure idiosyncratic renderer with known issues... 10:54:23 well, if you use the good library, it already has a conversion method 10:55:05 it may be good, but I'm not touching that anymore without a trusty 10' pole. 10:55:07 pdf don't even support tables the same way html do 10:55:25 -!- pi___ has quit (Ping timeout: 272 seconds). 10:55:56 borders & number of rows per cells are determined cell-wise, not row-wise 11:00:30 I like \LaTeX{} tables. they are artistic. 11:01:22 I like writing tabular stuff in MathJax, because I get to type in & for every column-separating &. 11:01:28 Very artistic. 11:02:57 'twas table, and the slithy &s... 11:08:09 -!- FreeFull has quit (Ping timeout: 246 seconds). 11:11:05 -!- boily has quit (Quit: RUNCIBLE CHICKEN). 11:26:41 -!- Phantom__Hoover has joined. 11:29:37 -!- Phantom_Hoover has quit (Ping timeout: 272 seconds). 12:23:03 -!- Phantom__Hoover has quit (Ping timeout: 246 seconds). 12:25:05 -!- AndoDaan_ has joined. 12:26:32 -!- AndoDaan has quit (Ping timeout: 245 seconds). 12:40:04 Can you do hostname hostname in /etc/hosts? 12:40:12 i.e. foo alias 12:40:22 where alias is an "alias" for the host foo? 12:45:31 -!- AndoDaan_ has changed nick to AndoDaan. 12:47:44 Not in a conventional hosts database. 12:48:30 You can just do "1.2.3.4 foo alias1 alias2". 12:53:45 JSONx is an IBM® standard format to represent JSON as XML. 13:01:04 Sounds sensible. 13:02:20 -!- Patashu has quit (Ping timeout: 260 seconds). 13:03:30 I imagine there are regions of the business world where XML is the most basic medium of communication and storage. 13:04:03 -!- ais523 has joined. 13:06:57 ion: nice find! 13:16:18 -!- impomatic_ has joined. 13:16:45 [wiki] [[Special:Log/newusers]] create * N4t45ha999 * New user account 13:17:57 wow, I thought that username style died out decades ago 13:18:41 Every day, someone discovers the internet for the first time 13:19:31 (Or perhaps, discovers esowiki for the first time, after possibly several decades) 13:23:20 -!- zzo38 has quit (Remote host closed the connection). 13:29:45 Everything is XML nowadays 13:29:48 which is bad. 13:31:12 -!- GeekDude has joined. 13:33:50 http://codepad.org/OROFAWyi <- I like LISP 13:34:54 why convert Lisp into XML? 13:35:08 I don't. 13:35:14 I'd just prefer LISP-like over XML 13:35:48 XML looks ugly, it's harder to read for humans 13:35:54 It takes too much space 13:36:10 ... vs (veryLongName ...) 13:36:22 LISP-like requires less disk space . 13:36:43 !bfjoust growth http://nethack4/esolangs/growth.bfjoust 13:36:44 ais523: URL fetch problems: getaddrinfo: Name or service not known 13:36:49 !bfjoust growth http://nethack4.org/esolangs/growth.bfjoust 13:36:50 ais523.growth: points 18.74, score 82.35/100, rank 3/47 (change: +1) 13:37:49 hmm, if I temporarily delete monolith and preparation, does growth win? 13:37:55 I guess it's worth a try 13:37:59 !bfjoust monolith < 13:37:59 ais523.monolith: points -46.00, score 0.00/100, rank 47/47 (change: -45) 13:38:07 !bfjoust preparation < 13:38:07 ais523.preparation: points -45.00, score 0.00/100, rank 47/47 (change: -46) 13:38:16 nope, space_hotel does 13:38:25 !bfjoust preparation http://nethack4.org/esolangs/preparation.bfjoust 13:38:28 ais523.preparation: points 23.67, score 100.00/100, rank 1/47 (change: +46) 13:38:37 !bfjoust monolith http://nethack4.org/esolangs/monolith.bfjoust 13:38:38 ais523.monolith: points 21.98, score 92.65/100, rank 2/47 (change: +45) 13:38:56 !bfjoust mroman.whoho (-+)*999999 13:38:57 mroman_.mromanwhoho: points -21.43, score 9.61/100, rank 47/47 13:39:32 meanwhile, there's something else I've been working on, but it won't do very well 13:39:37 it should stay on the hill pretty much forever, though 13:39:39 let me try 13:39:56 !bfjoust mroman.whoho (>+>-)*2<<<<(-+)*999999 13:39:58 mroman_.mromanwhoho: points -28.26, score 5.97/100, rank 47/47 (change: --) 13:40:08 that's even worse :( 13:40:11 !bfjoust margins http://nethack4.org/esolangs/margins.bfjoust 13:40:18 ais523.margins: points 0.64, score 37.61/100, rank 12/47 13:40:41 everyone, look at http://zem.fi/bfjoust/breakdown.txt 13:40:42 for margins 13:40:44 it's hilarious 13:41:28 mroman_: "-1" is easier way to type 100000 than "999999" 13:41:53 That's a lot of ties. 13:42:29 mroman_: And you don't need to put your name and a . in manually; in fact, the dot you add is removed. 13:43:00 Maybe I should really make that just reject names with "illegal" characters instead of silently modifying them. 13:43:07 fizzie: the strategy, basically, is to win on tape length 10 and maybe 11 and 12, and draw all the others 13:43:10 thus winning overall 13:43:26 !bfjoust whoho (>)*6(+[]<)*4>([-]>)*64 13:43:28 mroman_.whoho: points -34.24, score 3.40/100, rank 47/47 13:43:36 !bfjoust vibration >(+)*128<(-)*127(-+)*-1 13:43:36 ais523.vibration: points -12.50, score 17.47/100, rank 47/47 13:43:57 mroman_: that's the "original" vibration program, but the strategy's too well known by now 13:44:00 !bfjoust whoho (>)*6(-[]<)*4>([-]>)*64 13:44:02 mroman_.whoho: points -36.81, score 2.68/100, rank 47/47 13:44:32 I don't like Brainfuck :) 13:44:42 (That's why I've started yesterday on fungejoust) 13:44:50 mroman_: as I said earlier to someone else, programs that work via giving the opponent a large head start tend not to do very well 13:45:32 mroman_: It was called "Befunge gladiators" when proposed in 1997. 13:46:39 !bfjoust whoho (>)*9(-<)*8([-]>)*64 13:46:40 mroman_.whoho: points -24.19, score 6.45/100, rank 47/47 (change: --) 13:47:09 !bfjoust whoho (>)*9(-<+<)*4([-]>)*64 13:47:10 mroman_.whoho: points -22.90, score 8.08/100, rank 47/47 (change: --) 13:47:11 !bfjoust BeatYouMate (>------>+++++++)*4>(([(+)*6[-]]>)*3([(+)*6[-]]>)([(+)*6[-]]>)*3([(+)*6[-]]>)([(+)*6[-]]>)*3([(+)*6[-]]>))*7 13:47:11 AndoDaan.BeatYouMate: points -7.64, score 24.32/100, rank 40/47 (change: --) 13:47:20 fizzie: proposed? 13:47:24 So.. not implemented? 13:47:48 (also it's not really befunge as of now. It's just a 2D programming language sofar) 13:48:07 AndoDaan: that program beats growth, which annoys me 13:48:12 On the Befunge mailing list. I don't think anything ever came out of it. 13:48:29 "Oh, and the Warriors/Gladiators code is, for the moment, gone. I plan to get a working version of it _sometime_, but no promises about when." 13:48:39 The only surviving vestige is probably the cryptic "team number" field for the y Funge-98 instruction in the spec. 13:49:54 "Also, Befunge-97 should be a Cartinfinispheribefunge." 13:49:56 Good list. 13:50:06 "For example, Klefunge is a synonym for Mobitrefunge." 13:50:10 Lots of talk on the taxonomy. 13:50:52 Regular Befunge-93 is 80,25-Cartefinitoribefunge-93 in that system. 13:51:21 !bfjoust whoho (>)*9(>[(-)*128])([-])*-1 13:51:22 mroman_.whoho: points -31.10, score 5.77/100, rank 47/47 (change: --) 13:53:05 http://www.phlamethrower.co.uk/befunge/befwars.php 13:53:46 I remember seeing that. Someone made a start of befunge battling 13:54:53 !bfjoust simple (>)*8([>(-)*100[-]])*21 i think I got something like this out of the evolver early on 13:54:53 fizzie.simple: points -32.07, score 5.67/100, rank 47/47 13:55:12 Not exactly like that, but with a simple giant jump at the start. 13:56:01 Er, the > should not be inside the []s. 13:56:12 !bfjoust simple (>)*8(>[(-)*100[-]])*21 i think I got something like this out of the evolver early on 13:56:12 fizzie.simple: points -17.57, score 14.31/100, rank 47/47 (change: --) 13:56:33 It's not much better, but it's at least not entirely absurd. 13:57:19 fizzie: that's just fizzie_tiny, isn't it? 13:57:57 Oh, did I submit it? 13:58:21 fizzie: yes, but it seems to have fallen off the hill in the meantime 13:58:48 Yes. It's pretty much just that, with a .- clear and a couple of decoys. 13:59:11 !bfjoust tiny >(+)*4>(-)*4>+>-(>)*5([(-)*125[.-]]>)*-1 let's see out of curiosity 13:59:12 fizzie.tiny: points -19.55, score 12.73/100, rank 47/47 13:59:28 Still last, which would explain why it's no longer there. 14:01:19 !bfjoust tiny2 >++>-->+>-(>)*4(>[(-)*110[-]])*21 14:01:19 fizzie.tiny2: points -20.67, score 11.34/100, rank 47/47 14:02:42 !bfjoust tiny2 (>-->++)*4(>[(-)*100[-]])*21 14:02:42 fizzie.tiny2: points -23.40, score 9.85/100, rank 47/47 (change: --) 14:02:56 Heh, just worse. 14:06:52 -!- callforjudgement has joined. 14:07:16 -!- ais523 has quit (Disconnected by services). 14:07:18 -!- callforjudgement has changed nick to ais523. 14:08:12 !bfjoust tiny2 (>-->++)*4(>[(-[{(+[{(+)*140[-]}])%6}])%3])*21 14:08:13 fizzie.tiny2: points -16.83, score 15.04/100, rank 47/47 (change: --) 14:09:28 -!- Guest24268 has changed nick to Zuu. 14:09:36 -!- Zuu has quit (Changing host). 14:09:36 -!- Zuu has joined. 14:10:09 !bfjoust BeatYouMate (>------>+++++++)*4>(([+++++++[-]]>)*3([+++++++[-]]>)[-------[+]]>[+++++++[-]]>[+++++++++++++++++++[-]]>[+++++++[-]]>[--------------[+]]>[+++++++[-]]>[+++++++[-]]>[++++++++++++++++[-]]>[----------[+]]>[-------[+]]>[++++++++++++++++++++++++++[-]]>[----------------[+]]>[-------------------------[+]]>[-------------[+]]>[++++++++++++++++[-]]>[++++++++++++++++++++++[-]]>[--- 14:10:09 AndoDaan: error: parse error: starting ( without a matching ) 14:10:09 -------------[+]]>[+++++++++++++++++++++++++++++++++++++++++++++++[-]]>[+++++++++++++++++++++++++++++++++++++++[-]]> 14:11:04 !bfjoust BeatYouMate (>------>+++++++)*4>([+++++++[-]]>)*3([+++++++[-]]>)[-------[+]]>[+++++++[-]]>[+++++++++++++++++++[-]]>[+++++++[-]]>[--------------[+]]>[+++++++[-]]>[+++++++[-]]>[++++++++++++++++[-]]>[----------[+]]>[-------[+]]>[++++++++++++++++++++++++++[-]]>[----------------[+]]>[-------------------------[+]]>[-------------[+]]>[++++++++++++++++[-]]>[++++++++++++++++++++++[-]]>[---- 14:11:04 ------------[+]]>[+++++++++++++++++++++++++++++++++++++++++++++++[-]]>[+++++++++++++++++++++++++++++++++++++++[-]]> 14:11:04 AndoDaan: error: parse error: starting [ without a matching ] 14:11:09 ugh 14:11:11 sorry 14:15:53 It’s too long, your message is getting split up. 14:17:07 It's not illegal to use (+)*n to abbreviate something like +++++++++++++++++++++++++++++++++++++++ too. 14:17:33 (Also possibly makes it easier to tweak constants. Or maybe not, adding or deleting characters is pretty easy too.) 14:17:44 Ah, good. I was really worried about that... 14:18:17 Nah, I'm just trying to get a feel for the hardcode 14:22:41 -!- ais523 has quit (Read error: Connection reset by peer). 14:22:53 -!- ais523 has joined. 14:34:13 -!- `^_^v has joined. 14:36:57 [wiki] [[Bitoven]] http://esolangs.org/w/index.php?diff=40516&oldid=40496 * Imaginer1 * (+11) 14:37:21 hm 14:37:23 lispwars 14:37:33 :) 14:37:37 Do it. 14:37:54 There's a tape. Whereas the tape consists of pointers to lisp lists 14:37:59 (a program is just a list) 14:38:02 something like that 14:38:28 Naturally. 14:38:53 Much harder to say what a step is though. 14:44:36 fizzie, yeah, RLE compression works great on brainfuck code 14:47:26 !bfjoust BeatYouMate (>------>+++++++)*4>([(+)*17[-]]>)*7([(-)*28[+]]>)*7 14:47:26 AndoDaan.BeatYouMate: points -19.62, score 13.75/100, rank 47/47 (change: -11) 14:48:19 !bfjoust BeatYouMate (>------>+++++++)*4>([(+)*6[-]]>)*21 14:50:23 !bfjoust BeatYouMate (>------>+++++++)*4>([(+)*17[-]]>)*21 14:50:24 AndoDaan.BeatYouMate: points -11.43, score 20.60/100, rank 46/47 (change: -10) 14:50:53 !bfjoust BeatYouMate (>------>+++++++)*4>([(+)*5[-]]>)*21 14:50:53 AndoDaan.BeatYouMate: points -9.10, score 22.09/100, rank 46/47 (change: --) 14:51:15 !bfjoust BeatYouMate (>------>+++++++)*4>([(+)*3[-]]>)*21 14:51:16 AndoDaan.BeatYouMate: points -12.74, score 18.13/100, rank 46/47 (change: --) 14:59:23 Melvar: yeah... 14:59:57 my 2d language is of higher priority anyway 15:00:17 -!- ais523 has quit (Read error: Connection reset by peer). 15:00:30 -!- ais523 has joined. 15:01:22 !bfjoust BeatYouMate (>------>+++++++)*4>(([(+)*6[-]]>)*3([(+)*6[-]]>)*1([(+)*6[-]]>)*3([(+)*6[-]]>)([(-)*6[+]]>)*3([(+)*6[-]]>))*7 15:01:23 AndoDaan.BeatYouMate: points -6.14, score 26.78/100, rank 34/47 (change: +12) 15:01:46 Is it allowed to steal someones bfjoust program and tweak it .? 15:02:09 mroman_: it's normally considered bad style to steal the entire program, but stealing ideas is fine 15:02:16 :H 15:02:17 Depends on who's stealing from who. 15:02:29 !bfjoust imp + 15:02:29 it is, however, considered legitimate to repost someone else's program that's fallen off the hill, if you credit them 15:02:29 mroman_.imp: points -34.71, score 4.14/100, rank 47/47 15:02:32 if you're wondering how it would do nowadays 15:02:59 !bfjoust imp ([+]-)*-1 15:03:00 mroman_.imp: points -23.52, score 4.96/100, rank 47/47 (change: --) 15:03:16 -!- shikhin has joined. 15:03:16 !bfjoust return_of_myndzi_slowrush >(+)*22>(-)*22(>++++++>------)*1>+>->->+(>[[-(+)*22[-]]+>[+(-)*22[+]]->]+)*21 15:03:18 ais523.return_of_myndzi_slowrush: points -10.81, score 21.18/100, rank 47/47 15:03:18 like that 15:03:22 !bfjoust imp (>[+]-)*-1 15:03:22 mroman_.imp: points -29.48, score 9.00/100, rank 47/47 15:03:45 !bfjoust imp (>)*3(>[+]-)*-1 15:03:46 mroman_.imp: points -26.55, score 10.70/100, rank 47/47 (change: --) 15:03:59 !bfjoust imp (>)*9(>[+]-)*-1 15:03:59 mroman_.imp: points -21.38, score 13.75/100, rank 47/47 (change: --) 15:04:29 the invention of the offset clear was revolutionary 15:04:37 !bfjoust imp (>)*9(>[+]-)*9 15:04:38 mroman_.imp: points -26.83, score 9.13/100, rank 47/47 (change: --) 15:04:43 oh, that reminds me, I put a new idea into growth 15:04:45 I start with an offset clear 15:04:49 !bfjoust imp (>)*9(>[+]-)*9([-]>)*-1 15:04:50 mroman_.imp: points -23.79, score 11.66/100, rank 47/47 (change: --) 15:04:58 but I turn /off/ the offset after 200 cycles 15:05:06 because at that point, it's unlikely to be useful 15:05:16 !bfjoust imp (>)*9+[](>[+]-)*-1 15:05:16 mroman_.imp: points -34.17, score 4.88/100, rank 47/47 (change: --) 15:05:22 !bfjoust imp (>)*9-[](>[+]-)*-1 15:05:24 mroman_.imp: points -34.02, score 4.94/100, rank 47/47 (change: --) 15:05:26 damn 15:05:43 !bfjoust imp (>)*9(-)*10[](>[+]-)*-1 15:05:45 mroman_.imp: points -33.38, score 5.13/100, rank 47/47 (change: --) 15:05:47 -!- drdanmaku has joined. 15:06:13 !bfjoust imp (>->+)*4(>[+]-)*-1 15:06:13 mroman_.imp: points -24.17, score 12.47/100, rank 47/47 (change: --) 15:06:20 !bfjoust imp (>->-)*4(>[+]-)*-1 15:06:21 mroman_.imp: points -23.98, score 12.58/100, rank 47/47 (change: --) 15:06:38