Although, since I've done some research in the AI Field, I also recognize the distinction and the two. There is a controversy, even in AI circles, over what constitutes AI. So I'm not going to debate with you the merits of Strong AI vs Weak AI.
It is sufficient enough for me to just inform you... this controversy exists and is real.
---------------------------
http://www.i-programmer.info/babbages-bag/297-artificial-int...
>>> This is the curse of strong AI. Whenever you make something work, you know how it works and it no longer seems intelligent.
What's not disputed I guess, is the commonly (to CS-educated engineers) held notion that FCT is a high-profile math problem that was solved/proved by intensive automatic means rather than a human written proof, and that that raises questions regarding the meaning of "proof".
At least that's what I took home from it.
By way of contrast with the above described brute-force search, which also only works on a fixed size board, here's a proof that works on all NxN boards, where N is even.
We can construct a tour of the squares, visiting each exactly once, each time moving from a square to one of the squares with which it shares a side. Removing one black and one white divides this into two (or possibly only one) segments. Each can easily be shown to be of even length, and therefore each is coverable by dominoes. QED.
If you simply enumerate a very large number of possibilities, it doesn't feel like reasoning.