String to compare to is "110010010"
Strings being compared are:
	"11011001110"
	"0001010011"
	"011010111001"
	"00110101011"
	"0010101011010101"
	"001001110101"
	"0010100110101"
	"0010101010"
	"1100110010"
Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	0	8	1
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (0,0) to (0,1) in string "1100110010"
Calculating the detour for going from (0,0) to (1,0) in string "1100110010"
Calculating the detour for going from (0,0) to (1,1) in string "1100110010"
	Comparing 1 in "110010010" with 1 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	1	8	1
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (1,1) to (1,2) in string "1100110010"
	Comparing 1 in "110010010" with 1 in "1100110010"
Calculating the detour for going from (1,1) to (2,1) in string "1100110010"
	Comparing 1 in "110010010" with 1 in "1100110010"
Calculating the detour for going from (1,1) to (2,2) in string "1100110010"
	Comparing 1 in "110010010" with 1 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	2	8	0
	2	2	8	1
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
	2	1	8	2
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (2,2) to (2,3) in string "1100110010"
	Comparing 1 in "110010010" with 0 in "1100110010"
Calculating the detour for going from (2,2) to (3,2) in string "1100110010"
	Comparing 0 in "110010010" with 1 in "1100110010"
Calculating the detour for going from (2,2) to (3,3) in string "1100110010"
	Comparing 0 in "110010010" with 0 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	2	8	0
	3	3	8	1
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
	2	3	8	1
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
	2	1	8	2
	3	2	8	2
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (3,3) to (3,4) in string "1100110010"
	Comparing 0 in "110010010" with 0 in "1100110010"
Calculating the detour for going from (3,3) to (4,3) in string "1100110010"
	Comparing 0 in "110010010" with 0 in "1100110010"
Calculating the detour for going from (3,3) to (4,4) in string "1100110010"
	Comparing 0 in "110010010" with 0 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	2	8	0
	4	4	8	1
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
	2	3	8	1
	3	4	8	1
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
	2	1	8	2
	3	2	8	2
	4	3	8	2
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (4,4) to (4,5) in string "1100110010"
	Comparing 0 in "110010010" with 1 in "1100110010"
Calculating the detour for going from (4,4) to (5,4) in string "1100110010"
	Comparing 1 in "110010010" with 0 in "1100110010"
Calculating the detour for going from (4,4) to (5,5) in string "1100110010"
	Comparing 1 in "110010010" with 1 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	2	8	0
	4	5	8	0
	5	5	8	1
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
	2	3	8	1
	3	4	8	1
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
	2	1	8	2
	3	2	8	2
	4	3	8	2
	5	4	8	2
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (5,5) to (5,6) in string "1100110010"
	Comparing 1 in "110010010" with 1 in "1100110010"
Calculating the detour for going from (5,5) to (6,5) in string "1100110010"
	Comparing 0 in "110010010" with 1 in "1100110010"
Calculating the detour for going from (5,5) to (6,6) in string "1100110010"
	Comparing 0 in "110010010" with 1 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	2	8	0
	4	5	8	0
	5	6	8	0
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
	2	3	8	1
	3	4	8	1
	6	6	8	1
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
	2	1	8	2
	3	2	8	2
	4	3	8	2
	5	4	8	2
	6	5	8	2
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (5,6) to (5,7) in string "1100110010"
	Comparing 1 in "110010010" with 0 in "1100110010"
Calculating the detour for going from (5,6) to (6,6) in string "1100110010"
	Comparing 0 in "110010010" with 1 in "1100110010"
Calculating the detour for going from (5,6) to (6,7) in string "1100110010"
	Comparing 0 in "110010010" with 0 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	2	8	0
	4	5	8	0
	6	7	8	0
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
	2	3	8	1
	3	4	8	1
	6	6	8	1
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
	2	1	8	2
	3	2	8	2
	4	3	8	2
	5	4	8	2
	6	5	8	2
	5	7	8	1
	6	6	8	1
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (6,7) to (6,8) in string "1100110010"
	Comparing 0 in "110010010" with 0 in "1100110010"
Calculating the detour for going from (6,7) to (7,7) in string "1100110010"
	Comparing 0 in "110010010" with 0 in "1100110010"
Calculating the detour for going from (6,7) to (7,8) in string "1100110010"
	Comparing 0 in "110010010" with 0 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	2	8	0
	4	5	8	0
	7	8	8	0
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
	2	3	8	1
	3	4	8	1
	6	6	8	1
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
	2	1	8	2
	3	2	8	2
	4	3	8	2
	5	4	8	2
	6	5	8	2
	5	7	8	1
	6	6	8	1
	6	8	8	1
	7	7	8	1
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (7,8) to (7,9) in string "1100110010"
	Comparing 0 in "110010010" with 1 in "1100110010"
Calculating the detour for going from (7,8) to (8,8) in string "1100110010"
	Comparing 1 in "110010010" with 0 in "1100110010"
Calculating the detour for going from (7,8) to (8,9) in string "1100110010"
	Comparing 1 in "110010010" with 1 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	2	8	0
	4	5	8	0
	8	9	8	0
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
	2	3	8	1
	3	4	8	1
	6	6	8	1
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
	2	1	8	2
	3	2	8	2
	4	3	8	2
	5	4	8	2
	6	5	8	2
	5	7	8	1
	6	6	8	1
	6	8	8	1
	7	7	8	1
	7	9	8	1
	8	8	8	1
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.

Calculating the detour for going from (8,9) to (8,10) in string "1100110010"
	Comparing 1 in "110010010" with 0 in "1100110010"
Calculating the detour for going from (8,9) to (9,9) in string "1100110010"
	Comparing 0 in "110010010" with 1 in "1100110010"
Calculating the detour for going from (8,9) to (9,10) in string "1100110010"
	Comparing 0 in "110010010" with 0 in "1100110010"

Stack [0]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	1	1
	0	0	7	1
	0	1	8	0
	1	2	8	0
	4	5	8	0
	9	10	8	0
Stack [1]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	3	2
	2	3	8	1
	3	4	8	1
	6	6	8	1
Stack [2]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	0	3
	0	0	2	3
	0	0	5	3
	1	0	8	2
	2	1	8	2
	3	2	8	2
	4	3	8	2
	5	4	8	2
	6	5	8	2
	5	7	8	1
	6	6	8	1
	6	8	8	1
	7	7	8	1
	7	9	8	1
	8	8	8	1
	8	10	8	1
	9	9	8	1
Stack [3]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	6	4
Stack [4]: Stack is empty.
Stack [5]: Stack is empty.
Stack [6]: States in the stack are:
	From 	To 	Id 	Bound
	0	0	4	7
Stack [7]: Stack is empty.
Stack [8]: Stack is empty.
Stack [9]: Stack is empty.
Stack [10]: Stack is empty.
Stack [11]: Stack is empty.
Stack [12]: Stack is empty.
Stack [13]: Stack is empty.
Stack [14]: Stack is empty.
Stack [15]: Stack is empty.


The closest string to 110010010 is 1100110010