need help creating a simulated annealing algorithm to solve the $8-$queens problem. Need to print figure of how to get to goal as well as final state. heres some of my code: import random

import math

def print$\_$board$($state$)$:

for row in range$($len$($state$))$:

print$("".$join$("$Q$"$ if col $==$ state$[$row$]$ else $"."$ for col in range$($len$($state$))))$

print$()$

def initial$\_$state$($size$)$:

return $[$random$.$randint$(0,$ size $-1)$ for $\_$ in range$($size$)]$

def cost$($state$)$:

return sum$($state$[$i$]==$ state$[$j$]$ or abs$($state$[$i$]-$ state$[$j$])==$ abs$($i $-$ j$)$ for i in range$($len$($state$))$ for j in range$($i $+1,$ len$($state$)))$