Download - Permainan n queen pada java
![Page 1: Permainan n queen pada java](https://reader035.vdocuments.net/reader035/viewer/2022062300/5563a5a6d8b42a2d538b55e1/html5/thumbnails/1.jpg)
KELOMPO
K 2
PE
MO
DE
LA
N N
- QU
EE
N P
AD
A P
RO
GR
AM
JA
VAPBO
![Page 2: Permainan n queen pada java](https://reader035.vdocuments.net/reader035/viewer/2022062300/5563a5a6d8b42a2d538b55e1/html5/thumbnails/2.jpg)
PENGENALAN
DESIGNPEMODELANDAN SIMULASI OUTPUTNYAPENERAPAN ALGORIMA KE
N-QUEEN
![Page 3: Permainan n queen pada java](https://reader035.vdocuments.net/reader035/viewer/2022062300/5563a5a6d8b42a2d538b55e1/html5/thumbnails/3.jpg)
DESIGN1
2 34
5
678
![Page 4: Permainan n queen pada java](https://reader035.vdocuments.net/reader035/viewer/2022062300/5563a5a6d8b42a2d538b55e1/html5/thumbnails/4.jpg)
PEMODELANPAPAN CATUR
QUEEN
SETQUEEN
REMOVEQUEEN
KOREKSI
![Page 5: Permainan n queen pada java](https://reader035.vdocuments.net/reader035/viewer/2022062300/5563a5a6d8b42a2d538b55e1/html5/thumbnails/5.jpg)
SIMULASI OUTPUTNYA
![Page 6: Permainan n queen pada java](https://reader035.vdocuments.net/reader035/viewer/2022062300/5563a5a6d8b42a2d538b55e1/html5/thumbnails/6.jpg)
public class Queens{ public static boolean isConsistent(int[] q, int n) { for (int i = 0; i < n; i++) { if (q[i] == q[n]) return false; // same column if ((q[i] - q[n]) == (n - i)) return false; // same major diagonal if ((q[n] - q[i]) == (n - i)) return false; // same minor diagonal } return true; }
![Page 7: Permainan n queen pada java](https://reader035.vdocuments.net/reader035/viewer/2022062300/5563a5a6d8b42a2d538b55e1/html5/thumbnails/7.jpg)
public static void printQueens(int[] q) { int N = q.length; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (q[i] == j) System.out.print("Q "); else System.out.print("* "); } System.out.println(); } System.out.println(); }
![Page 8: Permainan n queen pada java](https://reader035.vdocuments.net/reader035/viewer/2022062300/5563a5a6d8b42a2d538b55e1/html5/thumbnails/8.jpg)
public static void enumerate(int N) { int[] a = new int[N]; enumerate(a, 0); } public static void main(String args[]) { Scanner S=new Scanner(System.in); System.out.print("Enter no. of Queens: "); int N = S.nextInt(); enumerate(N); }}