# UGCNET-June2016-III: 74

1.9k views

Consider a 3-puzzle where, like in the usual 8-puzzle game, a tile can only move to an adjacent empty space. Given the initial state

 1 2 3

which of the following state cannot be reached?

 A 3 1 2
 B 3 2 1
 C 1 3 2
 D 2 1 3
in Others
recategorized

ans will be C

selected
It will move clock wise or anticlockwise.
So ans should be C.

edited by

## Related questions

1
1.3k views
How does randomized Hill climbing choose the next move each time? It generates a random move from moveset and accepts this move It generates random move from whole state space, and accepts this move It generates a random move from moveset and accepts this move ... function It generates a random move from whole state space, and accepts this move only if this move improves the evaluation function
Consider the following game tree in which root is a maximizing node and children are visited left to right. What nodes will be pruned by the alpha-beta pruning? $I$ $HI$ $CHI$ $GHI$