/*same as beforebut perform alpha-beta pruning the main routine should make the call with alpha comp_loss and beta comp_win *int tictactoe::findcompmoveint bestmoveint alphaint beta 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 alphabestmove fori < &value beta++ /try each square ifisemptyi placeicomp )responsevalue findhumanmovedcvaluebeta )unplacei )/restore board ifresponsevalue value /update best move value responsevaluebestmove ireturn valuefigure minimax tic-tac-toe algorithm with pruningcomputer selection implementing - pruning requires surprisingly little code figure shows half of the - pruning scheme (minus type declarations)you should have no trouble coding the other half to take full advantage of - pruninggame programs usually try to apply the evaluation function to nonterminal nodes in an attempt to place the best moves early in the