←back to thread

1764 points fatihky | 1 comments | | HN request time: 0s | source
Show context
greyman ◴[] No.12702663[source]
I once coded chess playing algorithm for fun, and can confirm that the recruiter was correct on #9: you count bits by using a lookup table and then sum the results. It's the quickest way. But I am not sure if this is possible to figure out immediately without such experience...
replies(3): >>12702773 #>>12703527 #>>12708596 #
1. djmips ◴[] No.12702773[source]
can you really confirm that? I'd like to see your code.