I'm not sure what you mean by this?
BTW are you aware that despite it has only one type of stone and simpler rules, checkers is in fact the more complex game, to write an AI for?
The usual caveat with checkers is that you are probably not good at it. Even if it is simpler and smaller than chess, being a good chess player gives you no advantage and the game is still sufficiently complex that you can't quickly brute force it without years of practice. A chess master will get their ass handed to them by a skilled yokel.
Much harder to program an AI for than chess, certainly. The computer never managed to beat the world champion in a match last year.
I'm almost certain that's false. Checkers is weakly solved (There are AI's that will never lose, only win or draw)
I assume you meant Go, not checkers. And that's mainly harder for AI because the board is 5 times bigger.
Edit: I meant chess is harder to write an AI for of course, not checkers. Fixed.