« first day (1679 days earlier)      last day (3163 days later) » 

1:36 AM
@kirbyfan64sos I posted a question on yours :)
 
2:04 AM
1
A: Share answer/comment URL is genius. How does it work?

Chris Jester-Young/q/$postid[/$userid] and /a/$postid[/$userid] are actual routes in our system, with an actual controller action attached (both of those routes go to the same action—questions and answers both live in the Posts table, just with different PostTypeIds). Depending on whether the post is a question o...

@ProgramFOX ^ Special for you.
 
shortest way to get [1, 1] in Pyth?
shorter than ,1 1 pl0x
jT9
I'm a god
 
0
A: Lookalike shapes

DoorknobSnowman 1.0.2, 61 chars }vgvgaC"[0-9]+"sM:10sB;aM2aG:AsO:nD;aF;aM0AAgaA*|:#eQ;AsItSsP Pure gibberish (unless you happen to know Snowman), a.k.a. exactly in line with the language's design goal of being as confusing as possible. Input format is same as in the post, output format is also the sa...

I'm particularly proud of this Snowman answer :D
 
2:30 AM
@ChrisJester-Young I'm hardly an expert when it comes to FPA. Is it possible that a / b != c /d when a * d == b * c and all four numbers can be represented exactly?
 
@Dennis Even if a, b, c, d can all be exact, a / b and c / d are not necessarily exact.
I'm not an FP expert either, so it's hard for me to construct a counterexample.
But, let's say b == 3 and d == 5, and see where we can run with this.
So for the a * d == b * c to hold, I guess we can make a == 3 and c == 5.
Hmm, that's just 3 / 3 == 5 / 5. I guess that's true.
 
@Calvin'sHobbies The card-in-sleeve was a suggestion of Martin.
 
What about a := 1, b := 3? Then c == n * a, d == n * b for some n. I guess I could try by brute force if that fails for some n.
 
There's gotta be a better way than brute force, but I don't know a way.
 
2:57 AM
@isaacg .[R doesn't work
 
3:18 AM
@Doorknob At least it's not reverse indentation. :P
 
 
1 hour later…
4:42 AM
Hm, I wonder if you can make an avatar transparent.
 
4:56 AM
-1
Q: iam using net beans glassfish server wat to do this error

user44608i'am using net beans Glass fish server what to do this error glass Fish Server 4.1, deploy, null, false BUILD FAILED (total time: 1 second)

 
@NewMainPosts You are incredibly slow today.
Safe! \o/
4
A: The Programming Language Quiz

DennisWake, 17 bytes ":"Hello, World!" According to the offial website, Wake is a programming language which has the essences of Makefile, regular expressions, and pattern matches of functional programming languages. Wake was created by shinh and can be tested on his golf server Anarchy Golf. ...

 
 
2 hours later…
7:07 AM
0
Q: Solve a traffic intersection

VoitcusThe task Write a program or function that takes a traffic intersection structure and outputs the sequence, in which vehicles will pass. The input can have any structure you like, the only requirement it must be human readable (so please do not use any bitmasks, arrays of numbers which say nothi...

 
0
Q: What is the way linebreaks and formatting is counted for lowest bytes challanges?

ZaibisThe title pretty much says it. if I use tabs/spaces for making the code more readable do I have to count them? and are linebreaks counted as 1 cahracter(\n) or as 2(\r\n)?

 
8:03 AM
Some people on twitter are golfing the new Google logo in SVG.
 
@Mauris I love this logo <3
 
@Dennis new avatar threw me off so much
 
Hey what do you think about creating a new tag for "Hello, World!", Is this Number a Prime? and 1, 2, Fizz, 4, Buzz?
That's probably the most that there'll be, but it would be a good reference point
 
is a thingy
Not sure about the others
 
I mean like or something
 
8:26 AM
@BetaDecay I'm not sure how these challenges are actually substantially different from a normal code golf. And just a tag "standard programming task golf" sounds like a meta tag where we'd just get a lot of debate and/or rollback wars about other challenges
 
@MartinBüttner Right, I see :)
 
 
2 hours later…
10:14 AM
@orlp Fixed
 
10:54 AM
@Doorknob Sure. Optimizer is the main account.
 
 
2 hours later…
12:26 PM
0
Q: Decrypt Brainfuck

timmy VlogtI wanna say Sorry in advice, because this is my first Code Golf (Correct me in comments): My Code Golf is for you to decrypt this Brainfuck Code (3 times) with the shortest Programm possible in any Language: [-]>[-]++++[-<++++++++>]<>>[-]>[-]++++++++++[-<++++++++++>]<---<<>>------.<<+++++++++++++.

 
12:44 PM
0
Q: How is system specific or undefined behaving code treat, if not explicite stated?

ZaibisI'm asking this especially after I stumbled on this question my self when I got asked some minutes ago in a comment, if the include in my C code is really neccessary. I answered that it is, since I need printf which would be implicite declared if I wouldn't include the stdio.h what results in un...

 
12:54 PM
0
Q: Cardinals and ordinals, 1 to 100

LukeHere's a simple one to stretch your compression muscles. Your code (a complete program) must output the spelled-out English representation of all the cardinal numbers from 1 to 100, and then all the ordinal numbers from 1 to 100. The numerals in each list should be delimited by commas and spaces ...

 
 
1 hour later…
2:06 PM
If a question has the "kolmogorov-complexity" tag and the outpout should be for example "abcdefg" and my code just echo's this string hardcoded, does this violate any rules?
 
It doesn't.
Unless the string is actually abcdefg or something similarly ungolfable, it's a rather boring answer though.
Relevant meta discussions:
8
Q: Should answers to fixed-output challenges be written in a programming language?

Martin BüttnerWe have a definition of what we consider a valid programming language for answers on PPCG. (If you disagree with this definition, please do so on that other post, and not here.) The one type of challenge where people regularly tend to ignore this is for challenges with fixed output, i.e. mostly ...

 
@Dennis Thank you!
 
81
A: Loopholes that are forbidden by default

Peter TaylorHard-coding the output Unless the question is an obvious exception (the primary exception being those tagged kolmogorov-complexity), your program is expected to do work, not just print a pre-calculated result. If the question doesn't require input and so a solution which just prints the answer w...

Note that the loophole explicitly excludes kolmogorov-complexity.
 
@Dennis thanks! I guess that's okay because a hardcoded output will probably never win a kolmogorov-complexity / code-golf challenge
 
I'd argue that all output in kolmogorov-complexity is hardcoded. ;)
 
2:20 PM
I could post my 2451 byte solution to codegolf.stackexchange.com/questions/57053/… though
;)
 
And yes, the echo ... solution is rarely the shortest. Look here for a long list of counterexamples:
94
Q: "Hello, World!"

Martin BüttnerSo... uh... this is a bit embarrassing. But we don't have a plain "Hello, World!" challenge yet (despite having 35 variants tagged with hello-world, and counting). While this is not the most interesting code golf in the common languages, finding the shortest solution in certain esolangs can be a ...

@jrenk That's technically allowed (especially if it is the shortest solution in your language), but I'm not a big fan. Once somebody posts a low-effort answer, they start to pile on.
 
For my recent count the trees challenge:
11
Q: Count the trees

isaacgA tree is a connected, undirected graph with no cycles. Your task is to count how many distinct trees there are with a given number of vertices. Two trees are considered distinct if they are not isomorphic. Two graphs are isomorphic if their respective vertices can be paired up in such a way tha...

I've got a solution in Pyth that is both significantly shorter than the current only answer
and actually generates trees and checks for isomorphicness
would it be appropriate to post it?
If not yet, when?
 
@Dennis That's why I asked. But I will not post this answer because it's no fun at all...
 
@isaacg Yes, I don't see people rushing to answer that question.
 
Bad news guys, we won't be graduating in November after all. Because the world is going to end on Sep 24th.
This article is shockingly absurd.
 
2:27 PM
I'm impressed that checking isomorphism is so golfable: I hadn't even seriously thought about how to golf it, because I expected it to be too ugly.
 
@isaacg I've been there a few times. Consensus seems to be that winning your own challenge is perfectly acceptable. Personally, I'd wait at least a week to give others a chance to find a similar solution.
 
@Geobits Someday I can tell my children ... I survived the apocalypse ... three times
 
OK, I asked because it's only been a couple of days
@PeterTaylor The isomorphism checking routine is essentially just doing all possible vertex label -> vertex label transformations.
 
@isaacg I've currently got the same problem. my BF to MarioLANG conversion challenge has only one submission, and according to the author, it's not even correct
 
@Geobits You know, I actually believed you once and thought I'd lose most of my privileges. :P
 
2:31 PM
Well, at least my questions only submission works
 
Soo it's not as bad as it could be
 
@Dennis Well, either the world will end or we'll master stargates. He seems a bit confused on that point:
> In this way, CERN is being used as a stargate so that human scientists will be able to go to and from currently unknown, perhaps very hostile, non-physical worlds and dimensions located and currently unseen, outside our physical universe.
 
@isaacg at least your only submission was written by Peter ;)
 
Exactly.
 
2:34 PM
I visited CERN and I didn't get to see a Stargate :(
 
@MartinBüttner Right, that one's still on my to do list. It's what you get for posting "normal" challenges while the PLQ and HW are still going. :P
 
Yea, the PR tour doesn't show you the stargates.
 
@Dennis :D I'm glad it is on your to do list ;)
I'm considering trying Retina
 
2:54 PM
@ChrisJester-Young Nice, thanks!
 
@BetaDecay I think the reception such posts get is welcoming enough that anyone not actively looking to be offended can learn from it and go on to post well received challenges later.
 
@trichoplax Yeah I agree. At least s/he knows about the Sandbox now
 
Chat spawned a question:
0
Q: What's the worst that could happen to CERN?

Beta DecayIt's been said many times that CERN is going to destroy the Universe and everybody in it, but most educated people know that this absolute hocum. It seems being the biggest supercollider therefore increases the chances that it's going to break by a near infinite margin. However, if something wer...

 
:D
Do you frequent Worldbuilding or were you looking for CERN stuff?
 
@BetaDecay Yes maybe they will go on to post good questions later - sometimes such attitudes are just short term due to the perception of being attacked. It might pass once they see how other questions are treated in general
 
3:09 PM
I peruse... and offer comments now and then: worldbuilding.stackexchange.com/questions/23982/…
 
I see. I use it as a place to ask any random question which comes into my heaf
 
I don't have a heaf. I should get one
 
You have to replace the filters regularly which gets annoying
 
That's one of the problems I see with that site. It's so broad in scope that almost any random idea can be squeezed into "on topic-ish".
 
3:12 PM
I have a world in which a demon created this really hard math problem and said "If you fail to solve my really hard math problem, I will destroy your world!" How would my citizens go about solving it?
 
^ By writing the shortest code possible
 
You guys don't even know, but I won the class competition for best Wolf
Homework problems are on topic everywhere. It's all about how good your English is
 
Calvin is basically teaching his class at this point
Then we have guys like Dennis who are probably professors who enjoy solving puzzles as a pasttime. They have no clue that they are doing all of the homework
 
Haha all you need to do is buy a CS book and copy all of the example questions, asking for the shortest code
 
3:16 PM
copy rewrite
 
If only my automatic plagiarism challenge had got off the ground ;)
 
@Rainbolt Take everyone who's good at mathematics, and put them all together in a small number of university-like environments, and have them work on it together. Give them lots of computing and stuff.
 
^ That's far too sensical boring for a Worldbuilding answer, though.
 
hmmm, I really want to write HW in Monkeys, but in addition to being a really hard-to-program-in language, the reference implementation seems to contradict the spec in several ways :/
 
Hahahahha this is awesome
 
3:56 PM
@MartinBüttner Well I'll be a monkey's uncle. It appears that whomever made the reference implementation for Monkeys was monkeying around.
 
It was produced by monkeys at typewriters. Lots of them. This was the closest they got to a "correct" one before funding ran out.
 
Oh, btw, I think I beat @Dennis to PPCG's first non-code-golf silver tag badge by a few days :)
 
@Dennis You can, but you have to set the transparent image as your Gravatar (IIRC).
@MartinBüttner Nice! Which badge?
 
I clicked there and was met with disappointment.
 
@AlexA. Yea, mine is transparent through Gravatar.
 
@Dennis ^
 
@Alex ^
 
4:07 PM
@Geo ^
 
@Ale <
 
@Ge >
 
@@
 
@+-<
 
@randomra Can we call you Randy?
 
4:09 PM
I think I put in my value for PPCG for the week.
 
It will go down in history
 
@AlexA. I don't get that. :<
 
Randy is a common nickname (at least in the US) for people named Randall. Your username, randomra, begins with "rand," so the thought of referring to you as Randy amused me.
 
Ardor Man is better :)
 
@Geobits I get it. :> It's an anagram.
 
4:12 PM
Umm... it's an anagram.
 
Rad Roman
 
Damn Roar
 
Radarmon
 
I imagine that like a Jamaican dude who operates a submarine.
 
Oh, see I was thinking a bat-like pokemon that uses light instead of sound.
 
4:15 PM
I was thinking of a Digimon
 
Digimon < Pokemon
 
I know
 
Oh I had forgotten about Digimon!
 
but Pokemon doesn't use *mon as a Pokemon name as often.
So I kinda associate this lame naming scheme with Digimon more than Pokemon.
 
True. Probably has something to do with why it's better ;)
 
4:17 PM
Hahaha an anagram of my full name is "Nasal Relax"
 
@AlexA. Sounds like a laxative for nasal demons.
4
 
Hahaha what are nasal demons?
 
XD
Speaking of laxatives (unfortunately), another anagram of my name is Arsenal Lax.
 
Trait Number Ten is good if we can use 'ue' instead of 'ü'.
@AlexA. Even more unfortunately, Ser Anal Lax.
 
4:22 PM
Good lord
 
I'll just go ahead and add that to the meta list... :P
 
ಠ_ಠ
 
@Geobits I insist on ue.
 
@orlp We just talked about this=) youtube.com/watch?v=uA9mxq3gneE
 
@Geobits Even better is Near Butter Mint.
 
4:27 PM
Inert Burnt Meat
 
@flawr that's not the singularity
singularity != 'self-improving AI becoming better than humans'
the singularity is when a process can turn energy into unbounded self-improvement as long as it can acquire more energy, ad infinitum
 
Seems close enough to eachotehr=)
 
no
there's an absolutely crucial difference
one is an exponential increase in intelligence
one is just a set value of intelligence
I personally do not believe in an exponential increase in intelligence ad infinitum, but many (very intelligent) people seem to implicitly assume its existence when talking about this.
 
The idea is more exponential increase up to physical limits, I think
 
@isaacg yes, I do not believe that
 
4:32 PM
OK
 
in fact, I wouldn't be surprised it's sublinear
 
@Geobits Errant Bunt Item
 
I would be very surprised if that were the case
 
once you've figured out the low hanging fruit for self-improvement, improving yourself becomes exponentially more difficult, while you only gained a linear increase in intelligence
 
@AlexA. IBM: Return at Ten
 
4:33 PM
So far I've only been able to exponentially decrease my own intelligent.
 
You need to get a heaf
 
@orlp Then I must have misunderstood a few things. I agree that an increase in intelligence ad infinitum is never gonna happen.
 
@flawr ad infinitum within physical restrictions (energy, time, space)
 
How is intelligence defined here?
 
4:34 PM
arbitrarily
 
><
 
consider this
 
I will not
 
let's say a CPU is improving its own clock speed
 
Its
Errant apostrophes make me sad
 
4:35 PM
it's because "its" is a silly exception and because I'm Dutch, where everything is flipped
either way
let's say it takes 100 units of time to improve the CPU by 10% in terms of clock speed
 
Eithe'r way
 
the believers in an exponential intelligence increase (the singularity) would now argue it would find the next self-improvement 10% faster, leading to an exponential increase in intelligence
I think it's simply ridiculous to assume that the next self-improvement won't be harder to find, and might take vastly more than 100 time units
 
I think you mean cycles, not time units
 
I think it's silly to claim to know for certain either way ;)
 
@Geobits I'm not certain, of course
 
4:39 PM
Is anyone certain of anything?
 
By the time this kind of runaway intelligence is even possible, we (humans) won't be able to understand it all anyway.
 
If intelligence runs away, then we won't have to worry about it because it'll be gone
 
@BetaDecay I'm certain that 1+1=2
 
@BetaDecay I'm certain of my dog's name. I named her.
 
@BetaDecay yes
all of proven maths in certain
it might not be relevant or interesting, but it is certain
 
4:41 PM
@isaacg Not in the integers modulo 2. There, 1+1=0.
 
because all of maths is "if X then Y"
 
@BetaDecay I'm certain your question wasn't thought out for very long :P
 
and "X" might be false, but that does not matter
 
@orlp Who says our logic is right?
 
@flawr Me
 
4:41 PM
@flawr whether it's right doesn't matter
it's consistent
 
@BetaDecay "Two things are infinite: the universe and human stupidity; and I’m not sure about th’universe!"
 
@AlexA. Ah, but then 2 = 0, so I was right anyways
 
@orlp we think it is consistent
 
@AlexA. That's name you assigned to you dog. What's your dog's actual name?
 
@flawr no, we have proven it is consistent
 
4:42 PM
A memory pointer if you wish
 
@BetaDecay Are you sure it is a dog at all?
 
@flawr in turn, we have proven we can't prove everything in our logic
 
@BetaDecay I meant the name I assigned to her.
She knows who I'm referring to when I say her name.
 
@flawr but we do know that that which we have proven is valid
Gödel's incompleteness theorems are two theorems of mathematical logic that establish inherent limitations of all but the most trivial axiomatic systems capable of doing arithmetic. The theorems, proven by Kurt Gödel in 1931, are important both in mathematical logic and in the philosophy of mathematics. The two results are widely, but not universally, interpreted as showing that Hilbert's program to find a complete and consistent set of axioms for all mathematics is impossible, giving a negative answer to Hilbert's second problem. The first incompleteness theorem states that no consistent system...
 
@AlexA. I'm not certain
 
4:43 PM
@orlp perhaps there are errors in every proof we know so far, but nobody ever discovered them?
 
@BetaDecay You've never met my dog. ;)
 
@AlexA. Are you certain?
 
Uh... yeah.
 
@flawr I could employ the no true scotsman here :P
a proof with an error in it doesn't exist
 
@AlexA. Oh... I see a flaw in my theory ;)
 
4:44 PM
just like a blue ball that is red doesn't exist
(apart from funky coloring stuff we're going to ignore here :P)
 
A blue book can be read.
4
 
@Geobits touche
 
@orlp so we aren't even sure if any proof exists.
 
too lazy to spell e with /
 
@Geobits tushy
 
4:45 PM
Touch
 
ouch
 
oh guys
 
This statement is true, or this statement is not true.
 
Yes, this is guys
 
4:46 PM
@Rainbolt liar!
 
add "start ChatJax " to your bookmarks
and click on it on this page
 
@orlp ZF hasn't been proven consitent, just so you know.
 
$1^n - 3$
 
x = x == False
I wonder if there's anything that will parse that?
 
Yeah, if x is defined
 
4:47 PM
@BetaDecay Parse in what way?
 
If x can be a boolean value it should.
 
@isaacg sorry I got confused
we proved peano arithmetic consistent in ZFC
not ZFC in ?
 
I'm always confused.
 
Right.
 
@AlexA. do not worry, my grandmother is always confused too...
 
4:48 PM
@BetaDecay I'd flag that and say it should be x = !x
 
@flawr That's not particularly comforting. :P
 
Or in pyth, =!x
 
x=x==false?true:false; :P
 
#define TRUE FALSE
 
4:49 PM
dinner is ready, cu guys
 
Bye! Have a good food
 
the incompleteness theorem is probably the most frustrating proof ever
 
@isaacg What... How does that work?
 
@Geobits Fired. :-P
 
@BetaDecay I can explain
Pyth is a prefix language
 
4:50 PM
It's not what it looks like, I swear! I can explain!
 
@BetaDecay Putting an = before a function assigns its result to its first argument's variable
 
@ChrisJester-Young It's beautiful code, though! None of these cheap shortcuts ;)
 
so when you'd say =!x and = is a binary operator it would normally look like this in infix: ! = x
 
#define TRUE = PROBABLY
#define FALSE = !PROBABLY
 
@isaacg Well that's handy :D
 
4:50 PM
obviously, ! can never be on the left hand side of an equals sign legally
so we can assign a different meaning to that
 
At least it isn't legal in the US
We're petitioning though
 
You'd be surprised what counts as lvalues in C++.
You can define an operator! such that its return value can be an lvalue.
 
so we made =<OPERATOR><VAR><ARGS> into <VAR> = <VAR> <OPERATOR> <ARGS>
 
You mean <VAR> = <OPERATOR><VAR><ARGS>
 
@ChrisJester-Young I would probably be more surprised if I knew what an lvalue was. :P
 
@isaacg I switched to infix on the RHS
 
Something which can go on the left side of an equals
 
@AlexA. Casually, an lvalue is something that can appear on the left-hand-side of an assignment.
 
Sure
 
you can also see an lvalue as something that has an address in memory, so you can store something in it
to explain it a bit more logically
 
4:53 PM
@ChrisJester-Young That seems like a great way to make unreadable code
 
Sure does
 
For example, a conditional operator expression where both branches are reference types can be lvalues. e.g., (foo ? x : y) = 42 can work if x and y are both lvalues.
 
int& f() { static int i = 0; return i; } and f() = 5;
 
@ChrisJester-Young So you either define x or y to be 42 depending on foo?
 
4:54 PM
And if instead of f you have operator!, then you can have !x = 42 too. ;-)
 
fun fact
the address of a global variable is constexpr
 
@AlexA. Exactly.
<3 C++
 
So it's just like if (foo) x = 42 else y = 42
 
That sounds great for golfing
 
4:56 PM
int a = 0; template<int* p> void f() { *p = 5; } void main() { f<&a>(); std::cout << a << "\n"; }
@ChrisJester-Young almost everyone would think that's illegal C++
 
@orlp Wow, that's amazing.
 
I don't get it
 
So does that mean you can specialise it too?
e.g., template <> void f<&a>() ...?
 
@MartinBüttner Must fight urge to post 9 low-qualilty answers to questions. :P
 
well now you don't need to rush it :P
 
4:59 PM
Your profile shows as your next tag badge. How many string answers do you have?
@AlexA. White background it is then.
 
80 or 81 I guess?
 
@Dennis :P
 
@MartinBüttner Oh, you already have the badge. I misunderstood.
No need to rush it then. :P
 
He has the badge
 
5:03 PM
@MartinBüttner Race you to Legendary?
 
@Dennis how many do you have?
 
74 days. And you?
 
Not much of a race then. :P
 
well you've been catching up on my rep as well, so who knows :P
 
5:05 PM
It's harder to catch up on days though. :P
 
well I'm not rep capping every day (normally)
 
@orlp Oh, very nice.
 
@ChrisJester-Young but 90% of C++ programmers would at first sight say it wouldn't compile :P
@ChrisJester-Young the crux is that global variables' addresses are constexpr
 
@AlexA. ^ There, learn something new. :-P
@orlp Yeah, it doesn't "look" very constant.
 
although tbh
making that code compile sounds like linker hell to me
 
5:07 PM
@ChrisJester-Young Okay, will do
 
@orlp Luckily, not your problem.
 
5:37 PM
0
A: Sandbox for Proposed Challenges

mattnewportSomething from (almost) nothing kolmogorov-complexity code-golf In The Bible, Genesis tells the story of how God created the world from nothing. Since that would be a little out of scope for PCG, your challenge is to create the text of Genesis 1-2 from the smallest amount of program source you...

 
5:48 PM
@Geobits @AlexA. It's nice we're all agreeing on not handicapping esoteric languages on purpose. :-D
(Yes, I was one of the downvoters. :-P)
 
Me too
"Leveling the playing field" is something that a lot of newer users seem to want to do, but I think that's missing the point. The point is to write code in your language of choice and have fun. Chances are, unless your language is Pyth or CJam, you aren't going to win anyway.
4
 
Pretty much, though GolfScript had it good for a while. ;-)
(I should rewrite the Trello challenge in Pyth or CJam for a laugh, though, in my copious free time.)
 
Once upon a time. :P
 
Also, ugh. Another Kolmogorov wave recently.
 
Aw no
I was going to post my kolmogorov for a special occasion :P
 
5:53 PM
@Geobits See, some kinds of compression are worthwhile: daeken.com/superpacking-js-demos. But yeah, many ones are just banal.
 
I don't mind kolmo-questions. It's the basic "reproduce this exact (probably long) text" ones that suck IMO.
Once you've encoded one book, aren't others just dupes?
 
Pretty much.
 
Oh good. And I agree, such long inputs don't have interesting answers
 
All the more reasons for downvote (even without handicap). Sorry Matt Newport. ;-)
 
Hmm. I knew a guy who did python stuff named Matt Newport some years ago. Can't be the same guy, though. I'm pretty sure he's not living in Canada.
 
5:59 PM
Did he work for EA?
 

« first day (1679 days earlier)      last day (3163 days later) »