You can solve it yourself from scratch in a few minutes by running my Fhourstones benchmark [1]. Other interesting connect-4 tidbits may be found on my connect-4 page [2].
If you tell the optimal algorithm to only think 3 moves ahead, it's too easy, and if you let it think 4 ahead it becomes very difficult (but not quite impossible).
[1] https://tromp.github.io/c4/fhour.html
[2] https://tromp.github.io/c4/c4.html