jsp

build.gradle

@@ -1,21 +1,46 @@
+import org.gradle.nativeplatform.platform.internal.DefaultNativePlatform
+
 plugins {
     id 'java'
+    id 'application'
+    id 'com.github.johnrengelman.shadow' version '7.0.0'
 }
 
 group = 'fr.nabil'
 version = '1.0-SNAPSHOT'
+mainClassName = project.properties['main'] ?: 'Main'
 
 repositories {
     mavenCentral()
+//    maven {
+//        url "https://s01.oss.sonatype.org/content/repositories/staging/"
+//        metadataSources { artifact() }
+//    }
 }
 
 dependencies {
-    testImplementation platform('org.junit:junit-bom:5.10.0')
+    testImplementation 'org.junit.jupiter:junit-jupiter-api:5.7.0'
-    testImplementation 'org.junit.jupiter:junit-jupiter'
+    testRuntimeOnly 'org.junit.jupiter:junit-jupiter-engine:5.7.0'
-
     implementation 'uk.co.electronstudio.jaylib:jaylib:5.0.+'
 }
 
+application {
+    if(DefaultNativePlatform.currentOperatingSystem.isMacOsX()) {
+        applicationDefaultJvmArgs = ['-XstartOnFirstThread']
+    }
+}
+
 test {
     useJUnitPlatform()
+}
+
+
+distributions {
+    main {
+        contents {
+            into('resources'){
+                from 'resources'
+            }
+        }
+    }
 }

src/main/java/Main.java

@@ -0,0 +1,33 @@
+import logique.Maze;
+
+import static com.raylib.Raylib.*;
+import static com.raylib.Jaylib.BLACK;
+import static com.raylib.Jaylib.RAYWHITE;
+
+public class Main {
+
+    public static void main(String[] args) {
+        InitWindow(500, 500, "Labyrinthe");
+
+        SetTargetFPS(100);
+
+        while (!WindowShouldClose()) {
+            BeginDrawing();
+            ClearBackground(RAYWHITE);
+
+            for (int i = 0; i < Maze.MAZE[0].length; i++) {
+                for (int j = 0; j < Maze.MAZE.length; j++) {
+                    if (Maze.MAZE[j][i] == 1) {
+                        DrawRectangle(i * 50, j * 50, 50, 50, BLACK);
+                    }
+                }
+            }
+
+            DrawFPS(20, 20);
+            EndDrawing();
+        }
+
+        CloseWindow();
+    }
+
+}

src/main/java/fr/nabil/algogenetique/Main.java

@@ -1,11 +0,0 @@
-package fr.nabil.algogenetique;
-
-public class Main {
-
-    public static void main(String[] args) {
-
-
-
-    }
-
-}

src/main/java/fr/nabil/algogenetique/logique/Population.java

@@ -1,24 +0,0 @@
-package fr.nabil.algogenetique.logique;
-
-import java.util.BitSet;
-
-public class Population {
-
-    private BitSet chromosome;
-
-    public Population() {
-        this.chromosome = new BitSet();
-    }
-
-    public Population(BitSet chromosome) {
-        this.chromosome = chromosome;
-    }
-
-    public BitSet getChromosome() {
-        return chromosome;
-    }
-
-    public void setChromosome(BitSet chromosome) {
-        this.chromosome = chromosome;
-    }
-}

src/main/java/fr/nabil/algogenetique/logique/Simulation.java

@@ -1,7 +0,0 @@
-package fr.nabil.algogenetique.logique;
-
-public interface Simulation {
-
-    void evaluate();
-
-}

src/main/java/logique/Maze.java

@@ -1,11 +1,21 @@
-package fr.nabil.algogenetique.logique;
+package logique;
 
-public class Maze implements Simulation {
+import java.util.ArrayList;
+import java.util.List;
 
-    private int[][] maze = {
+public class Maze {
-            {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
-            {1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1},
 
+    public static int[][] MAZE = {
+            {1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
+            {1, 0, 0, 0, 1, 0, 1, 0, 0, 0},
+            {1, 0, 1, 0, 1, 0, 1, 0, 1, 1},
+            {1, 0, 1, 0, 0, 0, 1, 0, 0, 1},
+            {0, 0, 1, 1, 1, 0, 1, 1, 0, 1},
+            {1, 0, 0, 0, 0, 0, 0, 1, 0, 1},
+            {1, 1, 0, 1, 1, 1, 0, 1, 0, 1},
+            {1, 0, 0, 0, 0, 1, 0, 1, 0, 1},
+            {1, 0, 1, 1, 0, 1, 0, 0, 0, 1},
+            {1, 1, 1, 1, 1, 1, 1, 1, 1, 1}
     };
 
     private int populationSize;
@@ -15,12 +25,20 @@ public class Maze implements Simulation {
     private float crossover;
     private float elitism;
 
+    private List<Population> populationList;
+
     public Maze(int populationSize, int iterations, float mutation, float crossover, float elitism) {
         this.populationSize = populationSize;
         this.iterations = iterations;
         this.mutation = mutation;
         this.crossover = crossover;
         this.elitism = elitism;
+
+        this.populationList = new ArrayList<>();
+    }
+
+    public void init() {
+
     }
 
     public void evaluate() {

src/main/java/logique/Population.java

@@ -0,0 +1,52 @@
+package logique;
+
+import utils.Pair;
+
+import java.util.BitSet;
+
+public class Population {
+
+    private BitSet chromosome;
+    private int posX;
+    private int posY;
+
+    public Population() {
+        this.chromosome = new BitSet();
+    }
+
+    public Population(BitSet chromosome) {
+        this.chromosome = chromosome;
+    }
+
+    public void move(int type) {
+        switch (type) {
+            case 0: // UP
+
+                break;
+            case 1: // DOWN
+                break;
+            case 2: // L
+                break;
+            case 3: // R
+                break;
+        }
+    }
+
+    private boolean isCoordinateValid(int x, int y) {
+        if (x > Maze.MAZE[0].length || x < 0) return false;
+        if (y > Maze.MAZE.length || y < 0) return false;
+        return Maze.MAZE[x][y] != 1;
+    }
+
+    public Pair<Integer, Integer> getCoordinates() {
+        return new Pair<>(posX, posY);
+    }
+
+    public BitSet getChromosome() {
+        return chromosome;
+    }
+
+    public void setChromosome(BitSet chromosome) {
+        this.chromosome = chromosome;
+    }
+}

src/main/java/utils/Pair.java

@@ -0,0 +1,28 @@
+package utils;
+
+public class Pair<T, S> {
+
+    private T first;
+    private S second;
+
+    public Pair(T first, S second) {
+        this.first = first;
+        this.second = second;
+    }
+
+    public void setFirst(T first) {
+        this.first = first;
+    }
+
+    public void setSecond(S second) {
+        this.second = second;
+    }
+
+    public T getFirst() {
+        return first;
+    }
+
+    public S getSecond() {
+        return second;
+    }
+}