CR Weekend Challenge

rolfl

12:04 AM

OK, this has been really nice diversion, but I need to get more work done.

2

On the other hand, I got two badges today ... scholar and student

Malachi

12:24 AM

@retailcoder BattleShip would be a lot of fun but that would be longer than a weekend for me. plus I have people coming to my house for that weekend, and then two weeks after that is christmas and stuff

retailcoder

$10 next Thursday's CR newsletter is going to feature all of our RPSLS questions!

@Malachi I guess we'll break for the Holidays anyway, and yeah Battleship is a little more complicated than our little RPSLS game... doesn't have to be a game anyway, any code can be a challenge right?

(I'm not taking a Fibonacci challenge)

Malachi

@retailcoder Fibonacci is too overplayed

@retailcoder how about prime numbers?

retailcoder

over-rated

Malachi

@SimonAndréForsberg I am playing this thing I am 11-5-3 right now

Simon André Forsberg

@retailcoder I gotta subscribe to this CR newsletter, how can I do that?

@Malachi Well done. Apparently I suck at that (Or I just play too fast). I ended up about 24 - 12 - 30 :)

retailcoder

12:31 AM

@SimonAndréForsberg check out the "Preferences" link in your profile

Malachi

did you put the ties in the middle?

Simon André Forsberg

yes

win - ties - loss

retailcoder

@Malachi damn you rock! you took the advanced AI right?

Simon André Forsberg

@Malachi How about solving P vs. NP for a challenge?

Malachi

I posted my score with the ties at the end

W-L-T

Simon André Forsberg

12:32 AM

@retailcoder Are you sure that he doesn't scissors?

retailcoder

lol

Malachi

I did novice and was letting it try to figure me out

retailcoder

P versus NP problem

Diagram of complexity classes provided that P [[≠ NP. The existence of problems within NP but outside both P and NP-complete, under that assumption, was established by Ladner's theorem.]] The P versus NP problem is a major unsolved problem in computer science. Informally, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer. It was introduced in 1971 by Stephen Cook in his seminal paper "The complexity of theorem proving procedures" and is considered by many to be the most important open problem in the field. It ...

Malachi

W-T-L I am at 14-8-12 now

back to coding my game

retailcoder

@SimonAndréForsberg uh, major unsolved problem? (still reading)

Simon André Forsberg

12:34 AM

@Malachi It's a lot harder if you play vs advanced. Unless you don't play like all other humans

retailcoder

"It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US$1,000,000 prize for the first correct solution." @SimonAndréForsberg yeah, right. not my league!

Simon André Forsberg

@retailcoder Mine neither :) Although I actually have thought about it sometimes... but realized that I'm still miles from even considering perhaps being maybe somewhat close to an attempt at a real solution...

retailcoder

@SimonAndréForsberg way to hit the rep cap! - no, post your non-working code on StackOverflow!

Simon André Forsberg

@retailcoder What rep cap?

@retailcoder What are you talking about? Non-working code? Rep cap? SO?

totally confused

retailcoder

lol! I mean, if you posted your working code on CR, votes/day would probably be > 40 which beats the rep cap... nevermind

@rolfl your original java RPSLS was viewed 66 times; @SimonAndréForsberg's java was viewed 104 times - my c# version was viewed 229 times - @rolfl's and mine were posted like 15 minutes apart.

My conclusion: c# has more eyes on

And @SimonAndréForsberg has more eyes on than @rolfl :p

Simon André Forsberg

12:48 AM

@retailcoder And yet his question has more votes than mine!

we

need

rooms?

retailcoder

lol

Well it keeps the RPSLS and "gaming" stuff here...

@SimonAndréForsberg (ding!)

rolfl

@SimonAndréForsberg I have more votes.... but, I was up there for 12 hours more than you, and I did vote your's up ....

Simon André Forsberg

@rolfl I voted your up too. But that's right, your question has been there a lot longer than mine has. I wonder then why mine has more views?

rolfl

Also, I feel that the worse your code, the more the votes ... (i.e. if your code sucks, you get lots of upvotes.... case in point:

12

Q: How Can I make This Mess of Java For Loops Faster?

I'm trying to find all the 3, 4, 5, and 6 letter words given 6 letters. I am finding them by comparing every combination of the 6 letters to an ArrayList of words called sortedDictionary. I have worked on the code a good bit to get it to this point. I tested how many six letter words are check...

Since your code was better than mine, you get fewer votes.

Simon André Forsberg

@rolfl Yup, I've actually also thought about that.. horrible code = more upvotes. I don't think your code was bad enough to be upvoted for that reason though

retailcoder

12:55 AM

@rolfl horrible code?

9

Q: Rock-Paper-Scissors-Lizard-Spock Challenge

"Scissors cuts paper, paper covers rock, rock crushes lizard, lizard poisons Spock, Spock smashes scissors, scissors decapitate lizard, lizard eats paper, paper disproves Spock, Spock vaporizes rock. And as it always has, rock crushes scissors." ...

c# game dependency-injection

rolfl

And I don't understand how you got 17 upvotes on your answer.... did not know there were that many people (18 now that I upvoted yours).

retailcoder

@rolfl well I'm guilty of upvoting both of your answers there..

I mean yours and @SimonAndréForsberg's

Simon André Forsberg

I've upvoted your answer too, @rolfl. I'm quite surprised to see that many upvotes there, but if I get 5 more upvotes and the accepted answer gets six more upvotes, I will get a shiny new "Populist" badge :)

rolfl

Well, now only 4 for the accepted....

Is this nepotism?

retailcoder

lol

rolfl

1:03 AM

can't help any more now.

You all chipped in on my cobol necromancer.....

retailcoder

Populist is among the hardest ones to get - check out how the only one awarded was awarded: codereview.stackexchange.com/questions/13217/…

rolfl

@retailcoder huh ... one awarded was awarded

That's worse than any emptional feeling.

retailcoder

@rolfl uh, what would be the correct wording to say that?

rolfl

one badge was awarded ?

Simon André Forsberg

"how the only one awarded was awarded" still makes sense IMO though

retailcoder

1:09 AM

right, an awarded badge was obviously awarded, I can see the redundancy, but it looks like all that's missing is a comma: "check out how the only one awarded, was awarded"

I guess it's a wrap

Simon André Forsberg

codereview.stackexchange has suddenly become english.stackexchange

retailcoder

@SimonAndréForsberg my thoughts exactly!

Malachi

@retailcoder, I forgot to upvote your question....

retailcoder

@Malachi nice! you just got me another [badge:nice-question]!!

Malachi

1:25 AM

@retailcoder lol you are welcome

the only way that I can think of to do mine right now is a bunch of nested if statements?

retailcoder

@Malachi whatever works! just get it to work, and if you can't think of (or perform) any more tweaking, post it! - I know I'll review it, and other people will review it too, you might learn a trick or two :)

rolfl

@Malachi we were jsut saying, it appears that the worse your code looks the more your question gets upvoted

2

retailcoder

@Malachi you beat me in LW's rankings! stackexchange.com/leagues/86/week/codereview

And @rolfl you beat @SimonAndréForsberg's what-I-thought-was-a-record-for-a-single-week!

@SimonAndréForsberg you're going to review @rolfl's revised RPSLS?

Simon André Forsberg

@retailcoder Yes, I will probably look into that tomorrow (unless someone else writes a review that brings up the things I'd like to say)

retailcoder

I'm looking at it now, but I'm not really (at all) comfortable with java, I'd only have nitpicks which I'd rather leave to real reviewers

Simon André Forsberg

1:39 AM

I read the question earlier, I noticed that there were major improvements compared to the last version. In general, very well done @rolfl!

For now I have to sleep. Night folks

retailcoder

Cheers!

I have to agree, @rolfl that version is much better :)

Stack Exchange

3:50 AM

retailcoder has made a change to the feeds posted into this room

5

Q: Revisited IsTypeSafe method implementation for "type-safe" List

Following up on List<T> implementation for VB6/VBA, I'd like some thoughts about the revisited IsTypeSafe function, below. The previous version pretty much implemented VB.net's Option Strict setting, by only allowing widening numeric type conversions, and preventing implicit conversion between n...

vba type-safety vb6 follow-up

5

Q: Rock-Paper-Scissors-Lizard-Spock Challenge, take 2

This post is following-up on Rock-Paper-Scissors-Lizard-Spock Challenge I had a gut feeling that I was somehow abusing IComparable<T>, @svick's answer confirmed that. As @dreza was posting his answer I was in the process of proceeding with exactly that refactoring: stuffing the SelectionBase c...

c# game dependency-injection follow-up

4

Q: Rock Paper Scissors Lizard Spock Revisited

Continuing the spirit of the recent Weekend Challenge, here is a revised version of the RPSLS game. This is a follow up to my previous submission: Rock Paper Scissors Lizard Spock as a code-style and challenge This version is revised to accommodate the following suggestions: Model revised to...