diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1226.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1226.java
new file mode 100644
index 0000000..69eace5
--- /dev/null
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1226.java
@@ -0,0 +1,96 @@
+package ssafy_avanced_study;
+
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.Queue;
+import java.util.LinkedList;
+
+public class no_1226 {
+	
+	public static void main(String[] args) throws Exception {
+		
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		int T;
+		T= Integer.parseInt(br.readLine());
+		/*
+		   여러 개의 테스트 케이스가 주어지므로, 각각을 처리합니다.
+		*/
+
+		for(int test_case = 1; test_case <= T; test_case++)
+		{
+			
+			int[][]map = new int[16][16];
+			
+			Queue<int []> q = new LinkedList<>();
+			
+			q.add(new int[] {0,0});
+			
+			for(int i=0;i<16;i++) {
+					String str =br.readLine();
+				for(int j=0;j<16;j++) {
+					map[i][j] = Integer.parseInt(""+str.charAt(j));
+				}
+			}
+			
+			int[][]temp = new int[16][16];
+			temp[0][0] = 0;
+			int [][] move = {{1,0},{0,1},{-1,0},{0,-1}};
+			
+			int answer = Integer.MAX_VALUE;
+			int answerI = 0;
+			int answerJ = 0;
+			
+			for(int i=0;i<16;i++) {
+				for(int j=0;j<16;j++) {
+					if(map[i][j]==2) {
+						temp[i][j] = 0;
+						q.add(new int[] {i,j});
+					}else if(map[i][j]==3) {
+						answerI = i;
+						answerJ = j;
+					}
+					
+				}
+			}
+			
+			System.out.println(q.poll()[0]);
+			System.out.println(q.poll()[1]);
+			
+			while(!q.isEmpty()) {
+				
+				int [] cur = q.poll();
+				int i = cur[0];
+				int j = cur[1];
+				
+				for(int d=0;d<4;d++) {
+					
+					int newI = i + move[d][0];
+					int newJ = j + move[d][1];
+					
+					
+					if(newI<0||newJ<0||15<newI||15<newJ) continue;
+					
+					if(map[newI][newJ]==0 && temp[newI][newJ]==0) {
+						temp[newI][newJ] = temp[i][j] + 1;
+						q.add(new int[] {newI,newJ});
+					}
+					
+					
+					
+					
+				}
+				
+				
+				
+			}
+			
+			if(temp[answerI][answerJ] !=0) answer = 1;
+			else answer = 0;
+			
+			System.out.println(answer);
+		}
+		
+		
+	}
+	
+}
\ No newline at end of file
diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1249.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1249.java
index 40bf1b7..d0a2606 100644
--- a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1249.java
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1249.java
@@ -1,14 +1,13 @@
 package ssafy_avanced_study;
 
-import java.util.Scanner;
-import java.util.Queue;
+
 import java.io.BufferedReader;
 import java.io.InputStreamReader;
+import java.util.Queue;
 import java.util.LinkedList;
 
 public class no_1249 {
 	
-	static int answer = Integer.MAX_VALUE;
 
 	public static void main(String[] args) throws Exception {
 		
@@ -23,60 +22,64 @@ public static void main(String[] args) throws Exception {
 			
 			int[][]map = new int[size][size];
 			
+			Queue<int []> q = new LinkedList<>();
+			
+			q.add(new int[] {0,0});
+			
 			for(int i=0;i<size;i++) {
-				
-				String str = br.readLine();
-				
+					String str =br.readLine();
 				for(int j=0;j<size;j++) {
 					map[i][j] = Integer.parseInt(""+str.charAt(j));
-					
 				}
-				
-				
 			}
-		
-			
-			int[][]move = {{1,0},{0,1},{-1,0},{0,-1}};
 			
-			boolean[][]visited = new boolean[size][size];
 		
-			dfs(size,0,0,move,map,visited,0);
 			
-			System.out.println(answer);
 			
-			answer = Integer.MAX_VALUE;
+			int[][]temp = new int[size][size];
+			temp[0][0] = 0;
+			int [][] move = {{1,0},{0,1},{-1,0},{0,-1}};
 			
-		}
-		
-	
-	}
-	
-	static void dfs(int size,int i,int j,int[][]move,int[][]map,boolean[][]visited,int now) {
-		
-		if(i>size-2 && j>size-2) {
+			int answer = Integer.MAX_VALUE;
 			
-			answer = Math.min(answer, now);
-			return;
-		}
-		
-		for(int d=0;d<4;d++) {
-			
-			int newI = i + move[d][0];
-			int newJ = j + move[d][1];
+			while(!q.isEmpty()) {
+				
+				int [] cur = q.poll();
+				int i = cur[0];
+				int j = cur[1];
+				
+				for(int d=0;d<4;d++) {
+					
+					int newI = i + move[d][0];
+					int newJ = j + move[d][1];
+					
+					
+					if(newI<0||newJ<0||size-1<newI||size-1<newJ) continue;
+					
+
+					temp[newI][newJ] = map[newI][newJ] + temp[i][j];
+					
+					q.add(new int[] {newI,newJ});
+					
+					if(newI==size-1 && newJ==size-1) {
+
+						answer = Math.min(answer, temp[newI][newJ]);
+					}
+					
+					
+					
+				}
+				
+				
+				
+			}
 			
-			if(newI<0||newJ<0||size-1<newI||size-1<newJ) continue;
 			
-			if(!visited[newI][newJ]) {
-				visited[newI][newJ] = true;
-				int newOne = now + map[newI][newJ];
-				dfs(size,newI,newJ,move,map,visited,newOne);
-				visited[newI][newJ] = false;
-			}
 			
+			System.out.println(answer);
 		}
 		
 		
-		
-		
 	}
+	
 }
\ No newline at end of file