What is the non-recursive stack based equivalent of this function?

Question

what is the non-recursive stack based equivalent of this function?
     static void _try (int n)
          int i; if (n==4) print(); else for (i=0; i<4; i++) if (is_free(i,n)) {
               x[n] = i;
               _try(n+1);
     }

Answer 1

It goes infinite no output. Thanks though.
public class CopyOfDamen { // x[i] = x coordinate of queen in row i.
     static int N = 4; static Stack stack = new Stack(); static int [] x = new int[8]; public static void main(String [] par) { _try(); }
     // prints field
     static void print ()
          int i,j;
          System.out.print ("+----------------+\n");
          for (i=0; i<8; i++) {
               System.out.print ("|");
               for (j=0; j<8; j++)
                    if (j==x) System.out.print ("<>"); else System.out.print (" ");
               System.out.print ("|\n");
          System.out.print ("+----------------+\n\n");
     // tests, whether (ix, iy) is beaten by queens 0...(iy-1)
     static boolean is_free (int ix, int iy)
          int i;
          for (i=0; i<iy; i++)
               if ((x[i]==ix) || (Math.abs(x[i]-ix)==Math.abs(i-iy))) return false;
          return true;
     // tries to place queen n on row n
     static void _try () {
          int i = 0, n = 0;
call:
          for(;;) { // forever
               if (n == N) {
                    print();
               } else {
                    for (;i < N; i++) {
                         if (is_free(i,n)) {
                              x[n] = i;
                              System.out.print(x[n] + " ");
                              n++;
                              stack.push(i);
                              i = 0;
                              continue call; // call _try (but first save state and initiate new state)
                    } System.out.println();
               // _try returns (check termination criterion and restore state)
               n--;
               if (n < 0) break; // terminate
               i = stack.pop();
} class Stack {
     int StackSize = 32, top = 0; int [] stack = new int[StackSize]; public Stack() {} void push(int x) { if (top < StackSize) stack[top++] = x; } int pop() { if (top >= 1) return stack[--top]; return -1; }