Re: (Mastermind) puzzle (with 3 digits) (Posting On Python-List Prohibited)

Lawrence D'Oliveiro <ldo@nz.invalid> writes:

How about this as a more general Mastermind scoring function, then:

This works for me:

from collections import Counter as multiset
def msum(m: multiset) -> int: return sum(m.values())
def digits(n: int) -> int: return n//100, (n//10)%10, n%10

def score(answer: int,candidate: int) -> Tuple[int,int]:
    a = digits(answer)
    b = digits(candidate)
    well_placed = sum(x==y for x,y in zip(a,b))
    wrongly_placed = msum(multiset(a) & multiset(b)) - well_placed
    return well_placed, wrongly_placed

print (score(111,112))   # prints (2, 0)