Introduction - If you have any usage issues, please Google them yourself
haskell achieve classic guessing game, guess a four-digit number, each digit returns guess one A* B* denote digit number and location guessed guessed, this algorithm ensures that no more than 8 times, and do not use any of the screening mechanism (meaning the memory consumption is almost zero), tested by this machine, guess 0123-9876 (four numbers are not the same), naive algorithm is the fastest time for 10-20 minutes, this algorithm uses mathematical calculations, only 0.5 sec, uh, functional language design, uh, what you are looking for.