I am a CS pupil and I am making an attempt to know the looking out algorithms utilized in AI.
My drawback is that I do not actually perceive how one can deal with an issue like a search drawback. I do not know which might be the first steps for fixing it and the way shall I select the precise algorithm for that.
For instance, I’ve an issue like that:
n autos occupy squares (1, 1) via (n, 1) (i.e., the underside row) of
an n×n n grid. The autos should be moved to the highest row however in reverse
order; so the automobile i that begins in (i, 1) should find yourself in (n−i+ 1, n). On
every time step, each one of many n autos can transfer one sq. up, down,
left, or proper, or keep put; but when a automobile stays put, one different adjoining
automobile (however not a couple of) can jump over it. Two autos can not
occupy the identical sq..
I understood that the beginning state of every automotive is the underside row,
every automotive has at most 5 doable strikes from any place and if every automotive has
a 3×3 grid of empty area round it, then all 5 strikes are doable.
My concept is that I ought to deal with the automotive route like a tree the place every node is a place of the automotive at a time, however I do not understand how appropriate is it.
Which might be my first steps relating to this drawback to resolve it like a search drawback?
I might be very grateful for any recommendation!