Commit cd52508e authored by Ant Man's avatar Ant Man

new level

parent ccf8c667
......@@ -11,27 +11,31 @@ out 0 0 255
construct 0 0 0
inconstructible 255 0 234
# Player info
argent 2000
argent 3000
# Construction Data
laser 1 1 2 2 0 200 100 1
missile 2 1 1 1 0 300 150 2
radar 0 0 0 1 2 200 100
armement 1 0 0 0 2 400 200
centrale 0 1 0 2 2 400 200 10
munition 0 0 1 0 2 400 200
centrale 0 1 0 2 2 200 200 10
munition 0 0 1 0 2 800 200
# Monster Data
solder 1.0 1.0 1.0 1.0
huge_solder 2.0 2.0 2.0 2.0
gereral 3.0 1.0 1.0 1.0
boss 4.0 1.0 1.0 1.0
# Data characterized by a keyword can be placed in any order
infosNodes 4
0 1 3.5 1.5 1 3
1 1 3.5 4.5 0 2
2 2 5.5 4.5 1
3 3 1.5 1.5 0
infosNodes 8
0 1 2.5 2.5 1 3
1 1 9.5 2.5 0 4
2 3 1.5 3.5 3
3 1 2.5 3.5 0 2 6
4 1 9.5 3.5 1 5 7
5 2 10.5 3.5 4
6 1 2.5 5.5 3 7
7 1 9.5 5.5 4 6
waves 4
1 2 2 0.5 0 6 0 0
2 1 2 0.5 4 1 0 0
3 2 2 0.5 2 3 0 0
1 2 2 0.5 2 3 2 1
2 1 2 0.5 1 4 2 2
3 2 2 0.5 2 3 1 1
4 3 2 0.5 0 2 1 1
No preview for this file type
@ITD 1
# This is a sample ITD file
# Comments can be placed on any line using '#" sign as the first char
carte OLIVIER.ppm
energie 20
# A random comment
chemin 255 255 255
noeud 255 0 0
in 0 255 0
out 0 0 255
construct 0 0 0
inconstructible 255 0 234
# Player info
argent 2000
# Construction Data
laser 1 1 2 2 0 200 100 1
missile 2 1 1 1 0 300 150 2
radar 0 0 0 1 2 200 100
armement 1 0 0 0 2 400 200
centrale 0 1 0 2 2 400 200 10
munition 0 0 1 0 2 400 200
# Monster Data
solder 1.0 1.0 1.0 1.0
huge_solder 2.0 2.0 2.0 2.0
gereral 3.0 1.0 1.0 1.0
boss 4.0 1.0 1.0 1.0
# Data characterized by a keyword can be placed in any order
infosNodes 4
0 1 3.5 1.5 1 3
1 1 3.5 4.5 0 2
2 2 5.5 4.5 1
3 3 1.5 1.5 0
waves 4
1 2 2 0.5 0 6 0 0
2 1 2 0.5 4 1 0 0
3 2 2 0.5 2 3 0 0
4 3 2 0.5 0 2 1 1
......@@ -417,6 +417,10 @@ int itd_getImageFilePath(FILE* file)
currentChar = fgetc(file);
filePath[i] = currentChar;
}
printf("%c\n", i-3);
printf("%c\n", i-2);
printf("%c\n", i-1);
printf("%c\n", i);
filePath[i] = '\0';
mapData->mapFile = filePath;
return CHK_SUCCESS;
......
......@@ -287,10 +287,10 @@ int itineraire_checkValidChemin(Node* node_in, Node* node_out) {
}
if(x1 != x2 || y1 != y2) {
int cas = case_getCaseIndex(x1, y1);
if(mapData->cases[cas] != CHEMIN) {
if(mapData->cases[cas] != CHEMIN && mapData->cases[cas] != NOEUD) {
return 1;
}
}
}
return 0;
}
\ No newline at end of file
}
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment