What is the minimum number of
unshaded boxes to be crossed for
covering the shortest path from 'A' to 'B'
(both exclusive) without retracing the
path and without diagonal movement?
Answers
Answered by
0
Answer:
I THINK THAT IT WAS THE 'B'
Similar questions