public int$[]$ minimax$($char player$)\{$

int$[]$ bestMove $=\{-1,-1\}$;

int bestScore $=($player $==\text{'}$O$\text{'})?$ Integer.MIN$\_$VALUE : Integer.MAX$\_$VALUE;

for $($int i $=0$; i $<3$; i$++)\{$

for $($int j $=0$; j $<3$; j$++)\{$

if $($a$[$i$][$j$].$value $==\text{'}\text{'})\{$

a$[$i$][$j$].$value $=$ player;

int score $=$ minimaxScore$($false$)$;

a$[$i$][$j$].$value $=\text{'}\text{'}$;

if $(($player $==\text{'}$O$\text{'}$ && score $>=$ bestScore$)||($player $==\text{'}$X$\text{'}$ && score $<=$ bestScore$))\{$

bestScore $=$ score;

bestMove$[0]=$ i;

bestMove$[1]=$ j;

$\}$

$\}$

$\}$

$\}$

return bestMove;

$\}$ in this code it doesn't give me the shortest path for win $,$ Modify it