@ -21,6 +21,11 @@ return 0;
int wegsuchen(lab laby, int startx, int starty, int zielx, int ziely){
return 0;
if(startx == zielx && starty == ziely){
}
else{
return -1;
@ -50,6 +50,24 @@ void test_LabyrinthAmZiel(void){
TEST_ASSERT_EQUAL_INT(0, result);
void test_LabyrinthAmZiel2(void){
int result;
int input = 1;
int hoehe = 3;
int breite = 3;
lab laby = {
{'1', '2', '3'},
{'4', '5', '6'},
{'7', '8', '9'},
};
result = wegsuchen(laby, 1, 1, 0, 0);
TEST_ASSERT_EQUAL_INT(-1, result);
#endif // TEST