Code and Bugs

Coding things

Tag: chess

Combinational Game AI

One day, spending my time browsing the internet I have found this web site about genetic programming. In fact, the following quote got my attention:

Getting machines to produce human-like results is the very reason for the existence of the fields of artificial intelligence and machine learning. However, it has always been very difficult to assess how much progress these fields have made towards their ultimate goal. Alan Turing understood that in order to avoid human biases when assessing machine intelligence, machine behaviour must be evaluated objectively. This led him to propose an imitation game, now known as the Turing test (Turing, 1950). Unfortunately, the Turing test is not usable in practice, and so, there is a need for more workable objective tests of machine intelligence.Read the rest of this entry »

Bits counting trick

During my chess AI project (named E85) my team run across the problem of counting the set bits from a long long constant. Of course, counting them in a loop was a solution but it was a slow solution and we wanted to see if there is something more rapid than this, preferably something without using ifs.

Read the rest of this entry »

Follow

Get every new post delivered to your Inbox.