8*8 slide puzzle using hill climbing local search AI technique

can we solve an 8*8 slide puzzle using random-restart hill climbing technique (Steepest-Ascent)? if yes how much computing power will this need ? and what is the maximum n*n that can be solved normally? say with a google colab instance