$2.$ Minimize enemies to kill $[$Hard$]$

Given a $2$D grid of characters with values $\text{'}0\text{'},\text{'}1\text{'},\text{'}$X$\text{'}.$ and two special characters A and B$.$

Find minimum number of enemies to kill such that we can get both special characters and get out of the Grid.

$3.0$ means there is no wall.

$4.1$ means wall or blocked path.

$5.$ X represents Enemies $**($once killed can be converted to $0)**$

Example $1$: