Yes it is possible. But you have to tell your AI the rules of the game in advance (well, thatβs debatable, but itβs supposedly better if you do this - it will determine your search space a little better).
Now playing with a vanilla tick-wheelbarrow is too simple - a minmax search will be more than enough. Scaling the dimension or the size of the board makes the case of more advanced algorithms, but even in this case, the search space is quite simple (the algebraic nature of the increase in dimension leads to a small transformation of the search space, which should be amenable to simpler methods).
If you really want to throw heavy machine learning into a problem, take a second look at chess (Deep Blue really just rudely forced a suction cup). Arimaa is also interesting for this application. You can also consider searching (maybe start with some work done on AlphaGo)
What are my two cents worth
source share