Good heuristic for Tron

I have an assigment to do a tron game with AI. Me an my team almost made it but we're trying to find a good heuristic. We taught about Voronoi, but it's kinda slow : ``` for yloop = 0 to height-1 for xloop = 0 to width-1 // Generate maximal value closest_distance = width * height for point = 0 to number_of_points-1 // calls function to calc distance point_distance = distance(point, xloop, yloop) if point_distance < closest_distance closest_point = point end if next // place result in array of point types points[xloop, yloop] = point next next ``` We have 5 seconds to make a move and this algorithm doesn`t sound too good ! I don't need code ... we just need an ideea ! Thank you ! Later edit : Should we try Delaunay Triangulations ?