The Nineteenth Byte

« first day (1520 days earlier) ← previous day next day → last day (3314 days later) »

8:23 AM

@Jakube I'm not really successful in creating a fast and minimal algorithm yet - it seems optimizing it is harder than I thought

4 hours later…

Martin Büttner

11:59 AM

@Peter that Sokoban challenge got me thinking... how well would a Sokoban challenge with limited vision would work (3x3 or 5x5). I guess you could try to explore as much as possible first, but in some levels you can't get everywhere without doing some pushing. I wonder if there are good strategies for this though or whether you're just bound by luck.

maybe 7x7 so you can estimate whether any push you make is reversible

VisualMelon

12:16 PM

what if you could go back in time?

so when you meet a dead end, you can backtrack with the new information

then you can "safely" explore at some cost

(with limited vision)

Optimizer

depends on what kind of time travel are we talking about

the one in which a parallel timeline starts, you can't really benefit from it

Peter Taylor

I think it's probably possible to design levels where you have to commit to a decision which could make the level insoluble, but I haven't done enough Sokoban level design to be certain. (The Sokoban-esque game I made was more inspired by Atomix, so it had additional constraints).

VisualMelon

12:46 PM

@Optimizer hehe, I was thinking rather just being able to "undo" goes

Optimizer

@VisualMelon hmm, so the butterfly effect one

Martin Büttner

1:29 PM

time travel is a very interesting idea for a challenge (independently of sokoban)

Optimizer

then again, which kind of time travel ?

terminater vs back to the future vs Butterfly effect/The flash

Nathan Merrill

2:32 PM

hey, I just finished my NetAttack controller. I'm looking for some more feedback on my sandbox post:

A: Sandbox for Proposed Challenges

NetAttack KotH The internet has failed. DDoS attacks are now rampant and widespread. It is up to you to take control and repair the internet. Each bot will control 20 nodes in this network. Every node is either active or safe, has an owner, and has a strength, which starts at 2. Every active...

Martin Büttner

@Optimizer prince of persia

3 hours later…

octatoan

5:24 PM

njohnston.ca/2014/08/…

^ Can we make a challenge out of this at least for n <= 5?

Optimizer

@MartinBüttner that means back to the future one. a new timeline once you go back in time.

Martin Büttner

yes except you can't skip back to the future, you can only rewind (and maybe stop/slow) time

Optimizer

oh, that is just limitations of the power

but if you can go to future, it will be the future of the newer timeline

Martin Büttner

@octatoan isn't that just De Bruijn sequences?

Optimizer

not the future from where you went to past

Martin Büttner

5:35 PM

ah no it asks for permutations only, not any strings made from the symbols

@Optimizer yes

Optimizer

cool. hit me up if there is something which can be cooked up .

off to sleep now.

Martin Büttner

@Optimizer not any time soon, but I might get back to this.

Optimizer

@aditsu sourceforge.net/p/cjam/tickets/49

would save 5 bytes

randomra

5:58 PM

Worked out the details and added evaluator program:

A: Sandbox for Proposed Challenges

Brainfuck subprograms with unique outputs code-challenge brainfuck You should write a 100-byte long brainfuck (BF) program. One character will removed from it in every possible way the resulting 100 new (99-byte long) programs. E.g. for the program ++.>. the 5 programs are +.>., +.>., ++>., +...