@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
$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?
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 ...
"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!
@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...
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.
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...
@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
"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." ...
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 :)
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"
@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 :)
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...
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...
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...