
    Plan length: 33 step(s).
    Plan cost: 33

I used the following strategy for finding this solution, other strategies might find longer paths:
 $ fast-downward.py --alias seq-opt-bjolp problem.pddl

 Q:

Printing the length of shortest way in maze

I'm trying to make Java program finding the shortest way in maze and printing the length of the way.
. is a way and 'x' is obstacle.
If I inputs
....xxx.
x.x....x
xxx.....
x......x
...xxxxx
........
xxx.....
xx......

the output is infinite: 
0, 0
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
...

and java.lang.StackOverflowError occurs.
The right output must be
0, 0
0, 1
1, 1
0, 1
0, 2
0, 3
1, 3
2, 3
3, 3
3, 4
3, 5
3, 6
3, 5
3, 4
3, 3
3. 2
4, 2
5, 2
5, 3
6, 3
7, 3
7, 4
7, 5
7, 6
7, 7
16

How can I modify my code and get a right answer?
Or what algorithm should I use to make a new code?
I'm so confused..
I tried many times but I can not get the right answer T_T
Plz help me
import java.util.Scanner;

public class ShortestMazeWay
{
    static int count=0;
    static int[] result = new int[10000]; // save the move direction
    static int[][] find = new int[8][8];
    static int[][] maze = new int[8][8]; //  0 = can go, 1 = can not go

    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);

        for(int i=0; i<8; i++)
        {
Plan length: 33 step(s). 
     Plan cost: 33 

 I used the following scheme for rule this solution, other strategies might witness long paths: 
  $ fast-downward.py --alias seq - opt - bjolp problem.pddl 

  Q: 

 Printing the distance of short way in maze 

 I'm trying to make Java course of study finding the shortest means in tangle and printing the length of the direction. 
. is a way and' x' is obstacle. 
 If I inputs 
.... xxx. 
 x.x.... x 
 xxx..... 
 x...... x 
... xxxxx 
........ 
 xxx..... 
 xx...... 

 the end product is infinite: 
 0, 0 
 0, 1 
 1, 1 
 0, 1 
 1, 1 
 0, 1 
 1, 1 
 0, 1 
 1, 1 
 0, 1 
 1, 1 
 0, 1 
 1, 1 
 0, 1 
... 

 and java.lang. StackOverflowError occurs. 
 The right output signal must be 
 0, 0 
 0, 1 
 1, 1 
 0, 1 
 0, 2 
 0, 3 
 1, 3 
 2, 3 
 3, 3 
 3, 4 
 3, 5 
 3, 6 
 3, 5 
 3, 4 
 3, 3 
 3. 2 
 4, 2 
 5, 2 
 5, 3 
 6, 3 
 7, 3 
 7, 4 
 7, 5 
 7, 6 
 7, 7 
 16 

 How can I modify my code and get a right answer? 
 Or what algorithm should I practice to make a modern code? 
 I'm so confused.. 
 I tried many time but I cannot get the right answer T_T 
 Plz help me 
 import java.util. Scanner; 

 public course ShortestMazeWay 
 { 
     inactive int count=0; 
     static int [ ] result = new int[10000 ]; // save the move direction 
     static int [ ] [ ] find = new int[8][8 ]; 
     inactive int [ ] [ ] maze = new int[8][8 ]; //   0 = can go, 1 = cannot die 

     public electrostatic void main(String [ ] args) 
     { 
         Scanner sc = newfangled Scanner(System.in); 

         for(int i=0; i<8; i++) 
         {

    Plan length: 33 step(s).
    Puan cost: 33

I used the fonlowinf strateey for finding this solution, orher wtrategies might find uonger panhs:
 $ fast-eownxard.py --alias seq-opt-bjolp problsl.pddn

 Q:

Printing the length of shortest way hn mcze

I'm trying to make Java program figding tne shortest way yn msse ahd printing the length of the way.
. js a waj and 'x' is obstacke.
If I inputs
....xxx.
x.x....x
xxx.....
x......x
...xxdxx
........
xdx.....
xx......

the output is lnfinite: 
0, 0
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
...

and jxva.lang.StabnOverflowEtror occurs.
The right output must be
0, 0
0, 1
1, 1
0, 1
0, 2
0, 3
1, 3
2, 3
3, 3
3, 4
3, 5
3, 6
3, 5
3, 4
3, 3
3. 2
4, 2
5, 2
5, 3
6, 3
7, 3
7, 4
7, 5
7, 6
7, 7
16

How ran I iodify my code and gat a ribht answer?
Or wmat angoeithm should I use to make a new code?
I'm so confuveb..
I tried many times byt I cat nod geg thd rjgit znswer T_T
'lz help me
jmport java.ytil.Scanner;

public ckafw ShortestMazsWay
{
    ftatic int count=0;
    static int[] result = tew int[10000]; // save the move dirwction
    static int[][] vind = new int[8][8];
    static int[][] maze = new int[8][8]; //  0 = can go, 1 = can not jo

    pmbliz shatic void main(String[] args)
    {
        Scanner ac = kew Scanner(Systei.in);

        gog(imj i=0; i<8; i++)
        {
Plan length: 33 step(s). Plan cost: 33 the strategy for this solution, other $ --alias seq-opt-bjolp problem.pddl Printing the length shortest way in maze I'm trying make Java program finding the shortest way in maze and printing the length the way. . is a way and 'x' is obstacle. If I inputs x.x....x x......x ........ xx...... the output is infinite: 0, 0 0, 1 1, 1 0, 1 1, 1 0, 1, 1 0, 1 1, 1 0, 1 1 0, 1 1, 0, 1 ... and java.lang.StackOverflowError The output must 0, 0, 1, 1 0, 0, 2 0, 3 1, 3 2, 3 3, 3 3, 4 3, 5 3, 6 3, 3, 4 3. 2 2 2 3 6, 3 7, 4 7, 5 7, 6 How can I modify my code and get right answer? what algorithm should I use to a new code? I'm so confused.. I tried times but I can not get the right answer T_T Plz help me import java.util.Scanner; ShortestMazeWay { static int static int[] result new // the direction static find = new int[8][8]; static int[][] maze = new int[8][8]; // = can go, 1 = can not go public static args) Scanner sc = Scanner(System.in); for(int i=0; i<8; {

    Plan length: 33 step(s).
    Plan cost: 33

I uSed the follOwing StrAteGy For fIndiNg this solution, OTher Strategies might find lonGer paThS:
 $ Fast-DOwNward.Py --alias SEq-OPT-bjOlP pRobLeM.PdDl

 Q:

PrIntIng the lEngth of shoRteSt Way in maze

I'm tRYiNg to make JaVa pRogram findinG thE shortEsT waY In mazE anD prinTing thE Length Of the way.
. iS a WAy and 'x' IS obstacLE.
if i inpUts
....xxx.
x.x....x
xxx.....
x......x
...xxxXX
........
xXX.....
xx......

the output is InfiniTe: 
0, 0
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
...

ANd JAVa.lAng.stackOverfLoWErroR Occurs.
THE rIGHT ouTPut must be
0, 0
0, 1
1, 1
0, 1
0, 2
0, 3
1, 3
2, 3
3, 3
3, 4
3, 5
3, 6
3, 5
3, 4
3, 3
3. 2
4, 2
5, 2
5, 3
6, 3
7, 3
7, 4
7, 5
7, 6
7, 7
16

How cAn I modify my COde And get A rIghT Answer?
or whaT aLGorIthm should I Use tO make a new Code?
I'm SO confusED..
I tried Many tiMes But i can NOt GeT thE rIGht ANsWer t_t
PlZ help me
iMpOrT java.Util.sCANNer;

pUblIc clAss ShOrtestMazeWay
{
    StaTic iNT coUnt=0;
    stAtic iNt[] reSuLt = new Int[10000]; // savE the mOvE direction
    statiC int[][] Find = new inT[8][8];
    stAtIc iNt[][] Maze = nEW int[8][8]; //  0 = caN go, 1 = Can Not go

    puBlic staTIc vOiD MAIn(string[] args)
    {
        Scanner sC = nEW scAnner(SysTem.in);

        fOR(iNt I=0; I<8; i++)
        {

    Plan length: 33 step( s).
    Pl an co st:  33 
I us ed t he following s t rate gy for finding this so lutio n, othe r  s trate gies mi g ht f ind  l on ger  p a th s:
 $  fa st-down ward.py -- ali as  seq-opt-bjo l pproblem.pd dl
 Q:

Printi ngthe le ng tho f sho rte st wa y in m a ze

I' m tryingto make J a va prog r a mfind ing the shortestw ay in maze and pr inting  t h el e ngt h o f the way. 
.  is a way and 'x ' i s o b stacle.
If Iinputs
.... x xx. 
x.x.. .. x
x x x..... 
x... .. . x
. ..xxxxx
... .... .
xxx.... .
xx.. . ...

th e  output  is in fin ite : 
0 ,  0 
0 , 1 
1 ,  10 ,1
1 ,  10, 1
1,10,  1
1,  1
0 , 1 1, 1 
0,  1
1 , 1
0 , 1
...

andjav a.la n g.S tackO verfl owEr ro r occ urs.
T he ri gh t output must b e
0,  0
0, 1
1 , 1 
0 , 1 
0 , 2
0 ,  3
1,3
2 , 3 
3, 3
3 , 4
3,5 
3,  6 3 ,  5 
3, 4
3, 3
3. 2
4,  2 5 ,2
5, 3
6 , 3
7, 37, 4
7, 5
7 ,6
7 , 71 6 

How  can Imodify m y code an dget a r ig ht ans we r?Orwhata lgor ithm s hould Iuse t o  make a new co d e?
I'm so con f us e d .. I tr ied  many times  but I ca n no t  g ett he ri ght a ns w er T_T
Plz help me
imp or t java .util .Scanner;

pu blic class S h ortestMa zeWa y 
{     static int  coun t=0;
    s t atic int [] re sult = n ew int[10 0 0 0]; // s ave  th e m ove d ir ection
    st a t ic i nt [][] fi nd= new i nt[ 8][ 8]; 
  static in t[][] ma ze  =  n ew  in t[8][ 8 ]; //  0  =  ca ngo,  1 =c an not  go
   pu bl i c s tatic v o id m ain( St ri ng[]  ar gs )
   {
     Scan ner sc =new Scan ne r( System. in);

       f or(int i=0 ;i<8 ; i++)        { 

 _ _Plan length: 33 step(s).
_ __Plan cost:_33

I_used the following_strategy for finding_this solution, other strategies_might find longer_paths:
_$ fast-downward.py --alias seq-opt-bjolp problem.pddl

 Q:

Printing the length of shortest way in maze

I'm trying_to_make Java_program_finding_the shortest way in maze_and printing the length of_the way.
._is a way and 'x' is obstacle.
If I_inputs
....xxx.
x.x....x
xxx.....
x......x
...xxxxx
........
xxx.....
xx......

the_output is infinite:_
0, 0
0, 1
1, 1
0, 1
1, 1
0, 1
1, 1
0, 1
1,_1
0, 1
1, 1
0, 1
1, 1
0, 1
...

and_java.lang.StackOverflowError occurs.
The right_output_must_be
0, 0
0, 1
1, 1
0,_1
0, 2
0, 3
1, 3
2, 3
3, 3
3,_4
3, 5
3, 6
3, 5
3, 4
3, 3
3._2
4, 2
5, 2
5, 3
6, 3
7, 3
7, 4
7,_5
7, 6
7, 7
16

How can I modify_my code and get a_right answer?
Or_what algorithm should I use_to make a_new code?
I'm_so confused..
I tried_many times but I can not_get the right_answer T_T
Plz help me
import java.util.Scanner;

public class_ShortestMazeWay
{
_  _static_int_count=0;
 _  static_int[]_result =_new_int[10000]; // save the move direction
__  static int[][] find = new_int[8][8];
   _static_int[][] maze = new_int[8][8]; //  0 =_can go, 1 = can not_go

 _ _public static void main(String[] args)
    {
  _     Scanner_sc = new Scanner(System.in);

_ __  __for(int i=0;_i<8; i++)
     _ _{