Cool square problem

Computer Science Level 1

square 3×3 In the above image A $\text{3×3}$ square we have.

What is least possible for move to reach from $\text{3}$ into $\text{8}$ ?

We can move $\text{(up-down-left-right)}$ but can't move diagonly.

Also we can pass each square once a time.

2 solutions

Matin Naseri
Feb 3, 2018

Exactly between $\text{ square with number 8}$ and $\text{ square with number 3}$ exist $\text{ 3 squares }$ .

$\text{least possible square between them + the last square}$ .

$\text{3+1=4}$

And what then? It is not interesting problem at all. And there is information which is useless.

Hasmik Garyaka - 2 years, 11 months ago

B D
Sep 1, 2018

Here are some least possible lays for move to reach 8 from 3 into.