So far I have done a search for my agent. It returns the best move from a brute force search. However, I have absolutely no idea how to write heuristics for it. Can anyone give me an example (for this game, five-in-a-row or connect-5) of a heuristics function in LISP/CLISP?