/*recursive function to find best move for computer returns the evaluation and sets bestmovewhich ranges from to and indicates the best square to occupy possible evaluations satisfy comp_loss draw comp_win complementary function findhumanmove is figure *int tictactoe::findcompmoveint bestmove int iresponsevalueint dc/dc means don' careits value is unused int valueiffullboardvalue drawelse ifimmediatecompwinbestmove return comp_win/bestmove will be set by immediatecompwin else value comp_lossbestmove fori < ++ /try each square ifisemptyi placeicomp )responsevalue findhumanmovedc )unplacei )/restore board ifresponsevalue value /update best move value responsevaluebestmove ireturn valuefigure minimax tic-tac-toe algorithmcomputer selection