say we have a game of checkers, what kind of heuristic function would the ai need to make an easy computerised opponent as opposed a heuristic that would make a difficult opponent?

You could use very greedy heuristics that encourage the computer to make jumps even when they lead him into an obvious trap, or just decrease the search depth if you are doing a minimax type thing.