Interesting Problem/Puzzle

[dukerox7593]

ok here is the game:
your opponent has a secret number that is 4 digits long. the digits are 0-9 and no digit can be repeated in the number (in other words all 4 numbers are different)
examples: 1234, 1948, 4950
you have to guess the number
when you guess a number: your opponent gives you back 2 numbers (x,y)
number x is the amount of numbers in the right place
number y is the amount of numbers right but in the wrong place
anyone have an algorithm to solve this problem using the 2 numbers given back?

[|read|]

It's mastermind! From the original board-and-pegs to the anthropomorphized flash version, this game remains a classic.

http://www.newgrounds.com/portal/view/427859

(Just keep a mental list of all the possible configurations given what you do know, then cross them off as you learn more. It helps to first look at what you know and figure out what to guess in order to get back the most information.)

[vicdan]

Solution

[|read|]

Gah! Out of nowhere, the genie of the IP packet. But is this the real Victor, or a v-zombie? I shall attempt a Turing test. How are you, man?

[vicdan]

Does not compute. :D