int find$\_$path$($const char stage$[][$MAX$\_$NUM$\_$FLOOR$][$MAX$\_$ENCOUNTER$\_$LENGTH$],$ int num$\_$tower, int current$\_$tower,

int num$\_$floor, int explored$\_$floor$\_$count, int explored$\_$floor$[],$

int strength, int floor$\_$path$[],$ int stage$\_$path$[][$MAX$\_$NUM$\_$FLOOR$])\{$

$//$ TODO Base case $1$: If the current tower is out of bounds, return the strength

if $($current$\_$tower $>=$ num$\_$tower$)$

return strength;

$//$ End of TODO

$//$ TODO Base case $2$: If all floors have been explored, write the explored floor to floor path $($backtracking$),$ then return the strength

if $($explored$\_$floor$\_$count $==$ num$\_$floor$)$

$\{$

copy$\_$floor $($floor$\_$path,explored$\_$floor$)$;

return strength;

$\}$

$//$ End of TODO

$//$ Recursive case

int highest$\_$strength $=-1$;

int best$\_$floor$\_$path$[$MAX$\_$NUM$\_$FLOOR$]$;

$//$ Try every unexplored floor in the current tower.

for $($int i$=0$; i highest$\_$strength$)\{$

highest$\_$strength $=$ recursion$\_$result;

copy$\_$floor$($best$\_$floor$\_$path, recursion$\_$floor$\_$path$)$;

$\}$

$\}$

$//$ If the current tower is fully explored, backtrack the best path for the current floor and call the recursive function for the next tower

if $($explored$\_$floor$\_$count $==0)\{$

$//$ TODO: Backtrack the best path for the current tower using a line of code $($Use copy$\_$floor$())$

copy$\_$floor$($stage$\_$path$[$current$\_$tower$],$best$\_$floor$\_$path$)$; $//$copy the current explored result to best path array

$//$ End of TODO

int floor$\_$explored$[$MAX$\_$NUM$\_$FLOOR$]$;

int floor$\_$path$[$MAX$\_$NUM$\_$FLOOR$]$;

$//$ TODO: Complete the recursive function call to move to the next tower

find$\_$path$($stage$,$num$\_$tower,current$\_$tower $+1,$num$\_$floor, $0,$floor$\_$explored,strength,floor$\_$path,stage$\_$path$)$; $//$current tower $+1$ to next tower, explored floor count change to $0$ in new tower

$//$ End of TODO

$\}$

$//$ TODO: Backtrack the best path for the current floor selection using a line of code $($Use copy$\_$floor$())$

copy$\_$floor$($floor$\_$path,best$\_$floor$\_$path$)$;

$//$ End of TODO

return highest$\_$strength;

$\}$