> reopen (4) delete (2)

Interesting numbers.

I can't see how it would avoid getting images in answers, the site design, etc

Anyone know where the default sublime-builds are stored?

(on windows, sublime text 3 64bit)

@feersum I can't get it to work at all, personally. I can't imagine I messed up copy/pasting it, but it doesn't save anything at all for me:

--2015-01-12 22:13:10--  codegolf.stackexchange.com/questions/43274/…
Resolving codegolf.stackexchange.com (codegolf.stackexchange.com)... 198.252.206.140
Connecting to codegolf.stackexchange.com (codegolf.stackexchange.com)|198.252.206.140|:80... connected.
HTTP request sent, awaiting response... 200 OK
Length: 96950 (95K) [text/html]
Saving to: ‘codegolf.stackexchange.com/questions/43274/computer-generated-textured-wall-paint’

100%[======================================>] 96,950      --.-K/s   in 0.1s

^ [status-reproduced]

Specifically, the

> Removing codegolf.stackexchange.com/questions/43274/computer-generated-textured-wall-pain‌​t since it should be rejected.

seems to be the problem.

rejects on file extension before recursing?

Ah, that would make sense.

I don't know what order it does the recursion in for sure, though.

nope, manual says ... .htm and .html files are always downloaded regardless of accept/reject rules, they should be removed after being downloaded and scanned for links, if they did match the accept/reject lists.

Hmm. Does it only recurse in that directory? Since images here are hosted on imgur... I don't wget much :P

Also, your doc says that htm and html are always downloaded. Unless there's more, that doesn't mean much for images I'd guess.

I mean, it seems unlikely that he posted it without testing at least once, but I dunno what else it could be.

I don't think it would be the first time someone posted without testing at least once...

Ha, me either. Sorry, my faith in humanity is showing. Let me fix that...

I'm so rusty in C omf

Sometimes I wish starmap was a builtin in Python :/

@Sp3000 nice job on kingdom builder!

I'm still trying to golf it as we speak :P

I'm just proud that I managed to get all four scores in the one triple nested for loop

@MartinBüttner I just noticed Kingdom Builder actually still says "I'll describe all 11 scores"

@Sp3000 thanks!

@MartinBüttner For the Kingdom Builder comment can you have four players, each with 1 settlement in the same quadrant on the same row, and only one of them next to something (e.g. castle)?

@Sp3000 in the actual game you mean?

Although I'd imagine in the original game the game wouldn't end that fast

yeah it's impossible in the actual game. you get at least 3 settlements each turn, which you have to place somewhere.

Maybe if the layout was somehow symmetrical amongst the four players, but one of them is next to an extra castle?

yeah that's most likely

although with the quadrants in the actual game even that could be hard to set up, but it might be possible

Ah, so there's set piece shapes or something?

yes, it's not like Settlers of Catan. the game comes with 8 quadrants, which you can piece together like you want

Ah k

(the game is a bit more interesting, because there, each quadrant actually has a different kind of Town, which grant you special actions

so you pick 3 scoring mechanisms and 4 towns to play with, and then you can put the quadrants together like you want. that makes for a lot of variation, although the rules are actually pretty simple.

Donald Vaccarino is a pretty clever guy :D

Heh, he's good on the replayability front I have to say

@NathanMerrill the FBHC qualification round is scored. funnily, my submission to the first challenge was wrong, but the other two were correct.

oh, right... I didn't swap the front digit with the least significant candidate

@PeterTaylor Concrete Mathematics just arrived ;)

@MartinBüttner I failed the first two XP

@NathanMerrill still qualified! :)

@MartinBüttner The only book out of the several I bought as an undergrad which I actually found useful. (The other book I found useful was one I already owned before starting uni).

@PeterTaylor which one was that?

(the other one)

CLR

ah yeah, I've had that one on my shelf for years

but I only looked into it a couple of times for Dijkstra and FFT I think

at the time I bought it, I found the Sedgewick much more helpful

I've read most of it more than once, although I haven't implemented much of it.

we've got a Maths for Physics textbook which is pretty solid

What does that cover? Calculus and group theory?

it's a lot of calculus, quite a lot of linear algebra, and then some group theory, representation theory, probability theory and stats

I almost freaked because I couldn't find Wolf, then I realized I uploaded the source to Google Drive

I have these random projects that I never finished like "BotsAndBoxes", "TetrisLib", "Battlefield"

hmmm... TetrisLib... that reminds me...

maybe next year...

Unfinished PPCG-related projects in my current workspace: CaptureTheFlag, DownPeriscope, HotPotatoMisereFlood, PunchBuggy

I'm looking forward to PunchBuggy

Yay procrastination :D

it's insane how close to completion my Tetris Tournament is and for how long it's been sitting in this state

the entire game according to spec is done, and all that's missing is process communication.

So you did the fun part and quit? Sounds familiar :P

portable process communication in C is the horror :(

(because "portable" means "implement it for both Windows and Unix")

Or just skip that pesky Windows thing ;)

@MartinBüttner So use a sane language

@PeterTaylor I don't mind C, as I'm using it for my job. I ended up using it for the controller, because the turn time limits will grow pretty short, so I wanted to make sure that any overhead on the side of the controller is minimal.

@Geobits You are doing a CTF?

That makes me decision easy. I just started work on Wolf 2.0 and I was deciding between CTF and Crazy King

I don't see the point of Rock Paper Scissors without the AI. Should I just settle all conflicts pseudo randomly? It would make the challenge simpler I think

That's been on the back burner for a loooong time. Don't take it as competition for yours, since I have no idea when/if it will be done.

why would you need a Wolf 2.0 when wolves are already perfect?

@Geobits I read that three times as "Don't take it as a competition" before I got past my mental block.

@Rainbolt you keep complaining that there's no incentive to fight in most KotHs... with pseudorandom outcomes, there is even less incentive (unless you can get some sort of modifier to your winning chance)

^ that

@MartinBüttner Have you ever played Capture the Flag or KotH?

go nuts and have packs which have to control territory

You aren't scored by kills, and yet I see a lot of fighting.

@Rainbolt sure, but that's because you think you have a >50% chance of winning the fight, right?

First of all, you can't score points on a contested hill. A hill has only one King.

So you roll the dice and hope you win the fight. Then you sit there and score points.

hm, fair enough... I think it's strategically more interesting if you make the king particularly vulnerable though

then you need your non-kings to defend the king

btw, if you make it an actual KotH, you should totally move away from wolves to lions ;)

If the objective is "sit on the hill the longest", what strategies can emerge with random fights? The most obvious method would be "attack the guy on the hill unless it's one of your own, in which case you surround him".

@MartinBüttner Halo had variants of King of the Hill in which the King had buffs. You earned the buffs the moment you were crowned, you kept the buffs while the hill was contested (although you wouldn't be scoring points), and you lost the buffs the instant you were dethroned.

I don't recall a King of the Hill ever being made weaker than everyone else. He would be a sad king

The idea was to provide benefit to the early bird rather than the guys who come in and sweep up the mess when everyone else is done fighting.

ah, fair enough

@Geobits I think that there are two components. 1) How fast can you reach the hill? and 2) How do you attack the hill? But I agree that with random fights the battle would be quite boring once you got there. I'm not really sure that anything other than "charge in" is best.

Which, in reality, is pretty much the same as a real-life KotH. It's just more fun when you're throwing people off an actual hill than watching letters on a screen :P

I have a dream that my challenge will evolve into 3D Stick figures which walk around casually punching each other in the face.

I'd +1 it

Maybe I'll get with my brother and make it happen

The problem is that there is a disconnect between what he knows and what I know

He is an artist who barely touched on Python for a Math class

Sounds like a good separation of concerns to me ;)

I'm a programmer who took intro to game design and played around with the Neverwinter toolkit

The upper level game design courses got into Projects I and Projects II, in which artist and programmer worked together to create a game.

I have an idea for a simple code golf. Let me know if you think it's too simple to be interesting to golf:

Imagine a cursor on the real line, starting at x = 0. You're given a list of real numbers. The cursor moves from one number on that list to the next, until the list is exhausted. You are to return the maximum number of times the cursor has traverse any point on the real line.

(It would need some clarification about how the endpoints themselves are counted)

the idea is, if you had (0, 5, 2, 5, 3, 7, 6, 8, 4) then the answer is 6, because the cursor traversed the [4,5] interval six times.

Why a list of real numbers? Just to bias it against GS?

With natural and a sane limit, it would be a bit easier to do (Plot lines for each interval and find the tallest stack, for instance). I assume reals is to make it more involved.

@PeterTaylor no, that's just how I'd pictured it in my head... I don't mind integers either.

(and I keep forgetting that GS doesn't have floats)

@Geobits well that's the thing. I don't want people to actually count traversals for each unit segment

so if it's natural numbers, I'll use a pretty big limit

T'was just the first thing that popped into my head when approaching it. Either a big limit or reals works to mitigate it, like you say.

with reals you'd actually have to subdivide segments, which I thought would be the interesting part of the challenge

but I guess with big integers and a memory or time limit you get the same effect

I like the idea in general, though. Seems like it would have some real-world application that you could wrap into fluff-text if desired, too.

right now I'm trying really hard to remember how I just came up with this problem

I think it's simplest if I just exclude both end points from the intervals. then they can't ever affect the result in a weird way

I think you could just exclude the start point of each interval (except the first) without problems.

Off-topic: I really want to play around with one of these.

@Geobits (0, 1, 0, 2, 1) ... with your definition the point 1 would have been visited 4 times (while (0,1) has been visited 3 times and (1,2) has been visited twice)

@Geobits I had to check the URL before clicking that :D

sounds fun though

@Geobits actually no, in that example it have been visited 3 times, like the (0,1) interval. hmmm..

Yea, three times seems right for that example.

I think excluding both points is easier to think about though

My brain hurts trying to rationalize why 1 would be traversed less than both 0.9 and 1.1 in that example, though.

hm, fair enough

Haha my coworker pronounces Yahoo as Yay-hoo

Zgarb is coming up with some pretty decent challenges

@PeterTaylor do you happen to know a convenient notation for half-open intervals which remains non-empty if I swap the ends? so basically it should be equal to [a,b) if a<b and (b,a] if b<a.

@MartinBüttner Thanks! :)

;)

Since I just implemented BFS in Ruby the other day, I might give your challenge a go

@MartinBüttner No.

k

@Geobits actually... even with real numbers, there isn't really a need for subdividing segments. just sort the end points to get a mapping to small integers.

(well, I could ask for O(N) solution, where N is the number of points in the input)

although I think that's not really possible either

meh

That's a good point. But then you're looking at golfing two very different methods, which might be a good angle.

yeah, I think that's not bad. the mapping to small integers will also cost bytes.

never mind...

@Geobits I'm having a really hard time coming up with a good fluff-text

all the things I can think of that I could remotely use for this would rather pose the question "how often was this point traversed?" rather than "what's the largest number of times any point has been traversed?"

@MartinBüttner Maybe write a story about a robot lawnmower; you don't want any patch of grass mowed too many times...

hm, that might be an idea

I was also considering about an equivalent formulation, where you zigzag between x values (with steadily increasing y at an arbitrary rate), and the question asks how many lines you can intersect with a single vertical line.

Hehe my stomach just made this awesome "pew" sound three times in a row with increasing volume while someone was reviewing my code

That's Mexican food for you...

@VisualMelon are you around?

@MartinBüttner I can be

lol

I was wondering... have you been following the weekly challenge this week?

genetic algorithms?

I have not, but I do like genetic algorithms

I also happen to have a load of exams at the moment :P

oh right

nevermind then :D

no no, go ahead

well, since it's going to be a single-player game, we're trying to provide controllers in as many languages as possible (so that in each supported language, you only need to write a single function instead of a program with I/O loop and everything). and we though we could use your C# expertise to add the .NET languages to the repertoire.

but that's asking a bit too much if you're currently busy with exams ;)

they are over on Monday, then I have a few days of nothing, will that work?

uhh, sure... the challenge will go live on Friday, but if it hasn't already died down completely by Monday, then it can't hurt to still add support for more languages.

but you can let me know if you can be bothered on Monday ;)

"few days of nothing" - I wish I had them.

well, I need to cook, have a meningitis vaccination, catch some trains

I don't seem to be able to sleep at the moment anyway, so that won't be a problem

@MartinBüttner I shall let you know at 13:00 UTC or so on Monday if I can be bothered

heh, okay. good luck with your exams!

@MartinBüttner That's something like what I was thinking. Maybe a bunch of railway segments along the x, and you're trying to find where to build a segment to cross the most of them.

I'll need it

Or a cable car track where each traversal of a segment wears it by some amount, and you want to find the most worn section to inspect.

Crap! Someone just conceded that I am right and apologized to me on Board and Card Games. What do I do now?!

Double down and insist they're mistaken.

can you delete SE accounts?

stackoverflow.com/help/deleting-account

that was meant to be an amusing answer to Rainbolt's dilemma, sorry you guys looked that up, thanks either way

That's probably a better answer, though.

You are too high level for me.

Speaking of dilemmas

I'm making this King of the Hill game, and I'm thinking that I might give players the option to not fight when they collide.

Cool. I like it when people don't fight back :D

I don't see any good reason to run in that case.

Yea, it's 50/50 if you run. It's 75/25 in your favor if you fight.

Running needs to have a benefit in order to make it a true prisoner's dilemma

Oh I know

The board is basically the same as Wolf, right? As in no overlapping players? If so, where do they "run" to?

The Wolf board is capable of holding multiple players in the same cell. It was collapsed after each iteration, but I didn't have to collapse it.

Gotcha. You should probably limit mating, then.

If two players collide and mate, they could constantly spawn by just not moving, right?

I dunno. Would you continue sleeping with a woman who could kill you at any moment?

(looking forward to names chosen for mate-heavy bots, though)

I'd consider that if she mated the first time, she's more likely to continue mating than fight.

And if not, I haven't lost anything. I spawned one on my last turn to replace myself. Any extras are bonus.

This is a terrible idea I have decided lol

Because of what you said about the names, I wanted so badly for it to be a good idea

I was absolutely going to build a sexbot for this.

futurama.wikia.com/wiki/Liubot

@Geobits In a way, LazyWolf would still be a fitting name.

True...

I love the "I Dated a Robot" video they had on Futurama :P

Fate Reforged (MTG expansion) Prerelease is this weekend. Anyone else here going to attend?

@PeterTaylor thanks for the 3D printer idea, that might work

Why on earth would (true).ToString() return "True" in C#? It's impossible to convert "True" back to a bool without calling ToLower() on it.