The Nineteenth Byte

12:10 AM

@Doorknob冰 I thought -4?

@Sp3000 Just finished Runner 2... it's a lot better than the first part. And I love the simplicity of the design of the final boss. It's not a particularly hard level but it's right-to-left :D

New Sandboxed Posts

0

A: Sandbox for Proposed Challenges

Predict whether a Software Recommendations question will be closed popularity-contest Your task is to predict whether a given question on Software Recommendations will be closed. Here is a list of closed questions, and here is a list of not-closed questions. Highest scoring (by votes) answer by <

Optimizer

alright. got the hat ^.^

Martin Büttner

12:38 AM

@Optimizer saturday?

Optimizer

yup

Martin Büttner

nice job

Optimizer

finally got to get the magic spell checker done too. golfing tomorrow

T Abraham

1:52 AM

has a url shortener been made?

Sp3000

@TAbraham That would just effectively be hashing, no?

T Abraham

I don't think so.. but has hashing been done before?

Sp3000

Well you could also assign the first URL to /0, the second URL to /1, ... then once you go through 0-9A-Za-z you could start on /00...

feersum

that's not hashing...that's counting

T Abraham

I agree with @feersum .. but even then you also have to work on the redirecting part so that a shortened url redirects to the desired link..

feersum

2:05 AM

??? what does setting up a web server as a url shortener have to do with code golf at all

T Abraham

@feersum well, in some languages, it isn't hard to set up a web server, so most of the code would be about the url shortener.. I don't see why it isn't a good challenge on this website...

FryAmTheEggman

4:34 AM

Hey, do we have a meta post that says that versions of languages that are newer than the question aren't eligible for that question?

The closest I could find was this meta.codegolf.stackexchange.com/a/1071/31625

FryAmTheEggman

4:51 AM

Or this? meta.codegolf.stackexchange.com/a/10/31625

Optimizer

8:04 AM

Ughh. I hate people like these - they set a winning criteria, but then in the end, just randomly accept an answer. I can't even vote to close this one now.

9

Q: Sum of strings without converting

You have to take 2 string inputs and output the sum of these two strings without converting them to int or using any numeric data type. ex. string one = "123"; string two = "456"; string sum = "579"; Assume the strings won't be larger than 10 digits. This is code golf and shortest answe...

Sp3000

Maybe they just missed your solution when checking? (Optimistic)

Optimizer

not really. there is this also.

codegolf.stackexchange.com/questions/42284/tic-tac-toe-encoder-decoder/

Sp3000

Urgh. Okay that one's worse. Hopefully it's just that they don't get accept = for winner not most interesting solution...

Optimizer

brainfuck solution being interesting is soo 2010

feersum

8:27 AM

For a general codegolf, accept is not useful imo

each language is another competition

Optimizer

8:45 AM

it is. but no one is stopping you to use any language that has shorter syntax.

now if people use brainfuck or , lets say, Whitespace, they know that they are willingly choosing to not win

Optimizer

10:21 AM

@MartinBüttner Your power set also fails for strings :(

Optimizer

10:34 AM

naruto on SO :D

Martin Büttner

@Optimizer you mean the tip? example?

Optimizer

@MartinBüttner its super difficult here. I meant SO only :)

@MartinBüttner example - ["abc" "def" "ghi"]

Martin Büttner

right, well that's the same as nested arrays

Optimizer

got this : ]]l~{a1${1$+}%\;+}/{$_&}%_&

where input is stringified array

xnor

10:55 AM

@Optimizer Since you're so excited about my sandboxed bowling question and cared about when I posted my last one, I'll post it whatever day you want! It could even be on Christmas!

Optimizer

Heh, tomorrow ?

xnor

when is that?

i'm probably in a different time zone

how about in about 12 hours?

Optimizer

I'll be sleeping. how about 24 hours ?

xnor

i'll be sleeping :-)

18 hours?

Optimizer

ok

Sp3000

11:02 AM

@xnor Golden rule of ciphers: If you just invented a cipher, chances are someone has already invented it first ;)

Nice answer though

xnor

thanks!

i quite liked yours as well

the braille example is totally like some of the stuff that people post

Sp3000

(I was almost going to use one of A.E.'s many questions which fall under the same problem, but I thought it'd be better if I made up one)

But yeah I realise I didn't touch much upon non-standard ciphers

Martin Büttner

11:18 AM

puzzling.SE?

Sp3000

Yeah: meta.puzzling.stackexchange.com/questions/1717/…

Optimizer

wait, puzzling's chat room name is the green llama ?

Martin Büttner

yes

(although I have no clue why)

Optimizer

well, llama's are awesome for one.

people with llama profile pictures are even more awesome :D

Optimizer

11:57 AM

Hmm, I need to think on a new not-so-trivial-but-easy question

feersum

which program makes a hex dump in windows?

Sp3000

12:12 PM

@MartinBüttner You reckon any of the other Bit.Trips are worth it? I have BEAT and RUNNER1 but the bundle on Steam has a lot more than that

Lembik

hi @EricTressler

hi all

Sp3000

Hi Lembik "{-1, 0, 1} dot products" Lembik :D

feersum

(-1 is optional)

Optimizer

12:27 PM

@feersum there is no point in base encoding the magic spell checker

feersum

@Optimizer the point is that the source is full of unprintable characters

Optimizer

I meant that

all answers can base encode to get a ~600 nearby score like you

if not lesser (read CJam)

feersum

you mean zip encode?

Optimizer

ugh. yes. that in python and base encode in cjam

feersum

to make it shorter?

Optimizer

12:30 PM

yes'

feersum

sorry that wasn't supposed to be a question

Optimizer

I meant all current answers can make it shorter by using a pre-existing encoding technique.

and will get almost equivalent benefits

feersum

even Java? :P

Optimizer

Java was not even competing from the beginning :P

1600 !

feersum

your point is some kind of arms reduction treaty?

Optimizer

12:34 PM

what?

Optimizer

1:12 PM

FYI a mod replied to my saturday hat question and cleared that the 5 questions can spread across saturdays

he also changed the description of the hat

Optimizer

1:36 PM

71 seconds in hexagon!

Lembik

@Sp3000 :) How about Lembik "random hyperplane" Lembik ? :)

@Sp3000 which is my new obsession :)

@Sp3000 or maybe I will get many names? :)

Martin Büttner

@Optimizer I told you so ;) (about the Saturdays)

Optimizer

don't you "I told you so" me

it was totally ambiguous :P

Martin Büttner

@Sp3000 I've only played runner 1 and 2

Optimizer

what is your highest time in hexagon ?

Martin Büttner

1:48 PM

@Optimizer well yeah but you said it wasn't before you asked the question :P

I never played much beyond 60 seconds in any level

Optimizer

yeah, we both were taking one sides and it both sides were valid

@MartinBüttner so you will crash purposely ?

Martin Büttner

No, but twice I died because the achievement pop up made the game hang, and on some levels you enter a much harder mode. I think the furthest I got was 68 on one of the hyper levels. But what I meant is I never replayed any level after making it to 60 seconds.

Well I'll save my battery now to listen to some music on the plane, so ttyl

Sp3000

2:13 PM

@Lembik Lembik "Everything is faster than Python" Lembik

Lembik

@Sp3000 Lembik "4 orders of magnitude from Python" Lembik

@Sp3000 where would SE be without people with passions for particular topics? :)

Sp3000

I have a passion for not-too-hard-to-Piet questions but printable ASCII :P

Optimizer

3:47 PM

finally someone met the bounty requirements

1

A: Print a Binary Tree

CJam, 100 bytes q~_,2b,)2\#:Q1@{_2$<Q(S*:T*TQ2/:Q@ts[N+_,S*0@{@1$' >{2$_Q3*&2/^_4$>"\/"=t}*@)}/(NtU*o]o1:U$>\2*\}h]; Input must be a list of characters, without any ascii control characters. Empty nodes are denoted by a space. It also must be a complete binary tree with exactly 2n-1 nodes. Ex...

Peter Taylor

10:29 PM

@Geobits, are you there or do you just have an open browser tab?

Geobits

Here, but searching for a beagle puppy. It's hard going.

If you're going to ask about the sudoku thing, I saw your answer but haven't gotten around to adding it. My solution is on a sheet of paper at work ><

Peter Taylor

Ok, you do have one. I was hoping you'd put me out of my misery.

Even single configuration of 5s I try has an increasingly complicated obstruction.

Geobits

I found the template on a website searching for sudoku magic squares. It gave the outlines of the squares and two givens (beside the obvious 5s). It was a serious pain to fill it in.

Peter Taylor

To the point where to take my program any further I might as well just tweak a dancing links solver.

Geobits

You don't happen to have a beagle puppy available (and can meet in the US for delivery in the next few days...), do you? ;)

Peter Taylor

10:39 PM

Sorry, my parents are coming to visit tomorrow and staying for a week, so I can't go travelling to the US. Also, I don't have any dogs.

Geobits

Well, the week is flexible. Any time before Jan 3 would be fine for me. The "no dogs" thing is a deal breaker, though.

Peter Taylor

11:19 PM

@Geobits This one?

Geobits

11:51 PM

@PeterTaylor Yea, that's the one. Trying to rework it now.

Transcript for