Agora Games is a video game development company that works with game developers to build online features and web-based communities for video games. It has worked with publishers such as Activision, Konami, RedOctane, and Nintendo, and with game studios such as Vicarious Visions, Neversoft, Splash Damage, id Software, Vicious Cycle Software, 1st Playable Productions, and Gas Powered Games. Major League Gaming acquired Agora Games on August 18, 2009.
== Projects ==
Call of Duty: World at War [1]
Guitar Hero World Tour [2]
Guitar Hero: Aerosmith [3]
Dance Dance Revolution [4]
Guitar Hero III: Legends...
huh
> The topic of this article may not meet Wikipedia's general notability guideline.
@Dennis btw on my alternative TIO client thing I fixed the things you mentioned such as now allowing multiline input for args, and a lot better responsiveness on mobile
@Downgoat The CLA doesn't work at all for me. As soon as I enter more than one character, everything gets truncated. Also, how do I add additional CLAs?
In Harry Potter and the Chamber of Secrets we see that
Tom Marvolo Riddle
is an anagram for I am Lord Voldemort.
Task
Write a function that the user can pass 2 string arguments to as inputs: the first name (e.g. Tom) and the pseudonym (e.g. Voldemort), such that the output is an actual English w...
@El'endiaStarman What was the job responsibility? Congratulations!You The economy deserves it, it's not like the job market for developers isn't lacking people.
@Downgoat browserstack; they set up a real VM with the real OS to test on browsers; all in browser. Keep signing up and using the 30 minute trial. (only counts time when you are actually testing)
Problem
The goal is as the title says to find the nth prime such that the prime - 1 is divisible by n.
Explanation
Here is an example so you understand the question, this is not necessarily the way it ought to be solved. It merely as a way to explain the question
given 3 as an input we would...
new challenge idea: write code that outputs the date you joined stackexchange. the catch: it must correctly output the date of the user running the code
3) Shouldn't the D6 entry in commands.txt say "D6 (╓): pop f,n: push first n values where f(x) is truthy, starting with f(0) (the function is called each time with a stack only containing x)"
Inspired by a question in chat from a new user, I thought it would be a good idea to have a tag for challenges where the output is a truthy value if the input meets certain criteria, and falsey otherwise. decision-problem would make a good tag name - it's precisely what these types of problems ar...
First (and last) time I soldered something, I had a lot of coffee but no breakfast, so I was trying to hold these micro processors in tweezers while my hand was shaking.
I'd like some feedback on an idea for a new type of challenge that I have, namely Abstract Syntax Tree golfing.
Code Golfing is a lot of fun. But many of the tricks that get used in a given language are the same for every challenge. I'd like to ask a challenge which, instead of counting bytes, c...
I've seen my share of code that has redundant, useless comments that are basically a slightly reworded version of what the code says. I'd bet you could write an "auto-commenter" that does that
Don't know how you can cheese your way out of tests though
> 1. A clear specification of what constitutes a correct submission, so that it is possible to indisputably decide whether an entry is valid or not. Test cases are highly encouraged. 2. An objective primary winning criterion, so that it is possible to indisputably decide which entry should win.
@LuisMendo I created a repo for a bunch of my Bernoulli Factory code: github.com/PhiNotPi/BernoulliFactory I've slowly been accumulating a bunch of classes for a bunch of different operations/formulas.
for example, I define x/(x+y) by means of a recursive algorithm: new Or(new Mult(new Neg(y), new OverSumMinusProd(x, y)), new Mult(x, new Neg(this)))
Geobits: That's exactly why. 9h prevents 10 high heart straight.... and therefore, very slightly increases your chance of winning; say, instead of 9h, they happened to get 9c and thus a 10 high straight non-flush. Then you win.
These are really tiny things but possible
9c doesn't rule out anything along those lines; I think it's just better because of odds, since you have 2 diamonds and only 1 club, of simple flush
(better than 9d that is)
Okay, leaving again... got to watch this cat and then get sleep
Egads... the logic's right but I mixed up the cards... 9s prevents 10 high spades; 9c prevents 9 high clubs, 9h doesn't really prevent anything but flushes. There, now the chat record's fixed despite my brain being fuzzy
(Still, "prevent 10 high spades" includes having 10 high straight non-flushes, etc)
Right, but 5c 6c 7c 8c 9x does not beat you, when x is s, h, or d. More specifically, 5c 6c 7c 8c 9x cannot beat you, unless x is c. 3 of the 9's lose, one wins. You don't want that one win...
There is no symmetric scenario with hearts., where you get this specific preference.
Briefing:
You are a bot, in a 2D grid that extends infinitely in all four directions, north, south, east and west. When given a number, you must move the bot so that you get to the target number.
Here's how the grid works:
You can move in 4 directions: north, south, east or west. Once you move...
I don't think that takes 4000 satellites. Sat internet can already provide up to 50 Mbps (for consumers). Seeing how the technology improved since the satellites launched that power the current one, we might need fewer, but beefier ones for Gigabit. Still, there is absolutely nothing you can do about the horrible latency.
@Geobits Final analysis... you're right! 9h blocks King high heart straight... that was my missing symmetry. Exactly as many straight flushes are possible to beat that hand decorated with 9h versus 9c.
Is it a stochastic matrix?
A stochastic matrix is a matrix of probabilities used in the context of Markov chains.
A right stochastic matrix is a matrix where each row sums to 1.
A left stochastic matrix is a matrix where each column sums to 1.
A doubly stochastic matrix is a matrix where each...
Introduction:
I think we all know it, and it has probably been translated in loads of different languages: the "Head, Shoulders, Knees and Toes" children song:
Head, shoulders, knees and toes, knees and toes
Head, shoulders, knees and toes, knees and toes
And eyes and ears and mouth and ...
A local radio station was announcing that it was moving to a different channel yesterday. It did that by playing pre-recorded messages between songs (with no regular advertising or DJ chatter). Well, between song - the only song they played all day was Closing Time by Semisonic. Over and over.
Anonymous
@El'endiaStarman Congrats!
Anonymous
@Sherlock9 Good job! I don't know why I didn't think of that.
NB: This question was motivated by a "real-world" programming problem, and in fact, I originally intended to post it on StackOverflow. What made me post it here instead is the requirement to solve the problem with a single "repetition free" regular expression, which is somewhat gratuitous from a...
@ArtOfCode The goat was having really weird problems with ChatExchange authenticating. If you could take a peek at the errors in the transcript that would be great
@Lembik Would that be equivalent to the partial sums of a series of non-negative integers? Would you want the jumps to be arbitrarily large or chosen from a defined range?
@Geobits I was really stressing out, because I couldn't think of a way to shorten the code any, until I came into work this morning and said to myself "Why don't I just generate 'em all and check membership?" Lo and behold, way shorter.
@trichoplax the idea is to specify a random 1... n and say that the list of k integers must be from 1..n and the list must be uniformly chosen from all non-decreasing lists of that length
@Geobits Yeah. It wasn't until this morning that I actually saw those other answers. On harder problems like this one, I generally try to avoid "spoilers" for myself to see what sort of solutions I can come up with independently.
@Lembik Generate all valid sequences and pick one at random? Or generate all sequences of length k (valid or not) and keep picking one at random until it's valid?
And in particular the second law: the entropy of an isolated system increases over time.
For this challenge,
An "isolated system" will be taken to be a program or function (abbreviated as "program" from now on);
The passing of "time" will correspond to iterated executions of the program's outp...