編集履歴

質問編集履歴

簡潔に

2017/06/29 16:23

投稿

退会済みユーザー

スコア0

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -17,241 +17,3 @@
 長々すみません…ぜひご回答お願いします！
-以下は、８パズルのプログラミングです。参考になるかわかりませんが、一応のせておきます。```
-#include <stdio.h>
-#include <string.h>
-#include <time.h>
-#define TRUE  1
-#define FALSE 0
-#define GOAL  2
-#define SIZE  9
-#define MAX_STATE 181440
-const char adjacent[SIZE][5] = {
-  1, 3,-1,-1,-1,
-  0, 4, 2,-1,-1,
-  1, 5,-1,-1,-1,
-  0, 4, 6,-1,-1,
-  1, 3, 5, 7,-1,
-  2, 4, 8,-1,-1,
-  3, 7,-1,-1,-1,
-  4, 6, 8,-1,-1,
-  5, 7,-1,-1,-1,
-};
-char state[MAX_STATE + 1][SIZE];
-char space_postion[MAX_STATE];
-int  prev_state[MAX_STATE];
-char check_table[MAX_STATE * 2];
-char init_state[SIZE] = {
-  8, 6, 7, 2, 5, 4, 3, 0, 1
-};
-char final_state[SIZE] = {
-  1, 2, 3, 4, 5, 6, 7, 8, 0
-};
-void print_answer( int n )
-{
-  int i, j;
-  if( n != 0 ) print_answer( prev_state[n] );
-  for( i = 0; i < 3; i++ ){
-    for( j = 0; j < 3; j++ ){
-      printf("%d ", state[n][i * 3 + j] );
-    }
-    printf("\n");
-  }
-  printf("\n");
-}
-int change_number( char *board )
-{
-  char work[SIZE];
-  static int fact_table[SIZE] = {
-    40320, 5040, 720, 120, 24, 6, 2, 1, 0,
-  };
-  int j, k, value = 0;
-  memcpy( work, board, SIZE );
-  for( j = 0; j < SIZE - 1; j++ ){
-    value += fact_table[j] * work[j];
-    for( k = j + 1; k < SIZE; k++ ){
-      if( work[j] < work[k] ) work[k]--;
-    }
-  }
-  return value;
-}
-void search( void )
-{
-  int front = 0, rear = 1;
-  memcpy( state[0], init_state, SIZE );
-  space_postion[0] = 7;
-  prev_state[0] = -1;
-  check_table[ change_number( init_state ) ] = TRUE;
-  check_table[ change_number( final_state ) ] = GOAL;
-  while( front < rear ){
-    int s = space_postion[front];
-    int i, k, n;
-    for( i = 0; (n = adjacent[s][i]) != -1; i++ ){
-      memcpy( state[rear], state[front], SIZE );
-      state[rear][s] = state[rear][n];
-      state[rear][n] = 0;
-      space_postion[rear] = n;
-      prev_state[rear] = front;
-      k = change_number( state[rear] );
-      if( check_table[k] == GOAL ){
-        print_answer( rear );
-        printf("状態数 %d 個\n", rear );
-        return;
-      } else if( !check_table[k] ){
-        check_table[k] = TRUE;
-	rear++;
-      }
-    }
-    front++;
-  }
-}
-int main()
-{
-  int start, end;
-  memset( check_table, 0 , MAX_STATE * 2 );
-  start = clock();
-  search();
-  end = clock();
-  printf("時間 %d \n", end - start );
-  return 0;
-}
-```

詳しくしました

2017/06/29 16:23

投稿

退会済みユーザー

スコア0

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -17,3 +17,241 @@
 長々すみません…ぜひご回答お願いします！
+以下は、８パズルのプログラミングです。参考になるかわかりませんが、一応のせておきます。```
+#include <stdio.h>
+#include <string.h>
+#include <time.h>
+#define TRUE  1
+#define FALSE 0
+#define GOAL  2
+#define SIZE  9
+#define MAX_STATE 181440
+const char adjacent[SIZE][5] = {
+  1, 3,-1,-1,-1,
+  0, 4, 2,-1,-1,
+  1, 5,-1,-1,-1,
+  0, 4, 6,-1,-1,
+  1, 3, 5, 7,-1,
+  2, 4, 8,-1,-1,
+  3, 7,-1,-1,-1,
+  4, 6, 8,-1,-1,
+  5, 7,-1,-1,-1,
+};
+char state[MAX_STATE + 1][SIZE];
+char space_postion[MAX_STATE];
+int  prev_state[MAX_STATE];
+char check_table[MAX_STATE * 2];
+char init_state[SIZE] = {
+  8, 6, 7, 2, 5, 4, 3, 0, 1
+};
+char final_state[SIZE] = {
+  1, 2, 3, 4, 5, 6, 7, 8, 0
+};
+void print_answer( int n )
+{
+  int i, j;
+  if( n != 0 ) print_answer( prev_state[n] );
+  for( i = 0; i < 3; i++ ){
+    for( j = 0; j < 3; j++ ){
+      printf("%d ", state[n][i * 3 + j] );
+    }
+    printf("\n");
+  }
+  printf("\n");
+}
+int change_number( char *board )
+{
+  char work[SIZE];
+  static int fact_table[SIZE] = {
+    40320, 5040, 720, 120, 24, 6, 2, 1, 0,
+  };
+  int j, k, value = 0;
+  memcpy( work, board, SIZE );
+  for( j = 0; j < SIZE - 1; j++ ){
+    value += fact_table[j] * work[j];
+    for( k = j + 1; k < SIZE; k++ ){
+      if( work[j] < work[k] ) work[k]--;
+    }
+  }
+  return value;
+}
+void search( void )
+{
+  int front = 0, rear = 1;
+  memcpy( state[0], init_state, SIZE );
+  space_postion[0] = 7;
+  prev_state[0] = -1;
+  check_table[ change_number( init_state ) ] = TRUE;
+  check_table[ change_number( final_state ) ] = GOAL;
+  while( front < rear ){
+    int s = space_postion[front];
+    int i, k, n;
+    for( i = 0; (n = adjacent[s][i]) != -1; i++ ){
+      memcpy( state[rear], state[front], SIZE );
+      state[rear][s] = state[rear][n];
+      state[rear][n] = 0;
+      space_postion[rear] = n;
+      prev_state[rear] = front;
+      k = change_number( state[rear] );
+      if( check_table[k] == GOAL ){
+        print_answer( rear );
+        printf("状態数 %d 個\n", rear );
+        return;
+      } else if( !check_table[k] ){
+        check_table[k] = TRUE;
+	rear++;
+      }
+    }
+    front++;
+  }
+}
+int main()
+{
+  int start, end;
+  memset( check_table, 0 , MAX_STATE * 2 );
+  start = clock();
+  search();
+  end = clock();
+  printf("時間 %d \n", end - start );
+  return 0;
+}
+```