I still haven't got round to changing it - it was just an experiment to see if I could use the chat refresh to give 2 frame animation. I decided changing avatar took too long to do any more testing so I abandoned the idea, but it should flash a pattern of lower frequency (thicker) lines every so often in the avatar bar to the top right. For me it's about every 10 seconds
(They all do it, I just tried to emphasise it. Yours goes from smooth to speckled alias patterned)
Yes - I put in a variety of frequencies hoping that the result would let me understand how to design a specific shape, but the scaling doesn't seem to line up an integer number of times with the full size profile avatar so I don't know how to extract the relevant numbers without trial and error, which takes forever with a slow avatar upload
I was hoping it would be a nice simple ratio and might make the basis of a challenge, but I don't think so anymore
@trichoplax Speaking of images: I find your stack snippet a little confusing. I had to look into the source code to figure out how to make it calculate the score. Accepting Enter (or preferably, adding a button) would make it a little more intuitive, I think.
All I know is that if you have stripes and scale them down until they are narrower than a pixel, they can't be represented so unless they are smoothed the ones in between the pixels get missed out, resulting in much wider stripes
@Dennis Ah good point - thank you. I suppose a dummy button would work as it still counts as the input losing focus - so it should be a very quick change
As long as that doesn't cause problems if someone clicks on it while it's in progress.
It will still work if they've updated the input, and if not I suppose it doesn't make a difference.
When I was writing this I ran into a bug due to only checking the lengths for a new pixel against all the existing lengths, neglecting to also check if the new lengths might be duplicates of each other
@Dennis I've realised that if it doesn't show any output after 10 seconds or so then SE kills it. So whereas in jsfiddle it would just hang until finished, in a stack snippet it will fail silently and make the user think it is still calculating. So I'm working on that as a priority...
Cool, thanks. Working on that "counting double letters" thing. I hope assuming that the input is ASCII is fine. Don't think I will come very close to Pyth anyway. regex functionality helps for this one.
I have something fairly elegant in CJam for the basic part of finding the character with the most duplicates. But now I have to exclude non-letters (should not be too bad), and list all of them when there is a tie (which could be painful).
Common Lisp - (golfing in progress)
A recursive implementation, totally not golfed for the moment.
(defun spiral (n &optional (d 0) )
(flet ((prefix ()
(format t "~4d~4d | " n d)
(dotimes (i d)
(princ "* ")))
(dotimes (i d)
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
This is The Question and i have tried to figure it out and it's answer given is "266333" i want to know is it...
NetHack is a roguelike game where a player must retrieve the Amulet of Yendor from the lowest level of the dungeon. Commonly played via telnet, the entire game is represented with ASCII graphics. The game is extremely challenging and requires knowledge of many game mechanics in order to succeed.
Modified Game of Risk
In this game, players use their armies to capture territories, fight other players' armies, and become the last man standing. Each turn, players receive a base number of armies to use at their disposal. By capturing territories in certai...
Just wanted to let everyone know, I'll be travelling for almost three weeks (until the 19th), with only sporadic internet access (and probably other worries than checking the PPCG flag queue first), so don't expect to see me around a lot. Doorknob knows and I'm sure he'll handle the mod duties just fine. :)
Recently, I made my very first contribution to OEIS by extending and adding a b-file to sequence A049064. The sequence starts with 0, and then the next values are derived from giving a "binary description" of the last item.
For example, the second element would be 10, bec...