An elementary navigation simulated in Java

An Elementary Navigation Simulated in Java Presented by Jinho D. Choi

Artificial Intelligence ,[object Object],[object Object],[object Object]

Solving a maze ,[object Object],[object Object],[object Object],[object Object],[object Object]

boolean solveMaze(var maze, var location) { if (reach the goal) return true; else { // moving to an empty cell if ((down-cell is empty) || (right-cell is empty) || (up-cell is empty) || (left-cell is empty)) { maze[location] = ‘X’; // mark the location if (down-cell is empty) return solveMaze(maze, down-cell); else if (right-cell is empty) return solveMaze(maze, right-cell); else if (up-cell is empty) return solveMaze(maze, up-cell); else if (left-cell is empty) return solveMaze(maze, left-cell); } // backtracking else if ((down-cell is marked) || (right-cell is marked) || (up-cell is marked) || (left-cell is marked)) { maze[location] = ‘#’; // block the location if (down-cell is marked) return solveMaze(maze, down-cell); else if (right-cell is marked) return solveMaze(maze, right-cell); else if (up-cell is marked) return solveMaze(maze, up-cell); else if (left-cell is marked) return solveMaze(maze, left-cell); else return false; // path does not exist } } }

Solving a maze with the fixed entry and exit ,[object Object],[object Object],.***... ..**.** *....** **.*.** .*.*.** ****... ******.

boolean solveMaze(int r, int c) { if (r == MAX-1 && c == MAX-1) return true; // reaches the exit else if (maze[r+1][c]=='.') || (maze[r-1][c]=='.') || (maze[r][c+1]=='.') || (maze[r][c-1]=='.')) { maze[r][c] = '+'; // moves to an empty cell if (maze[r+1][c] == '.') r++; else if (maze[r][c+1] == '.') c++; else if (maze[r-1][c] == '.') r--; else if (maze[r][c-1] == '.') c--; } else { maze[r][c] = '-'; // backtracks if (maze[r+1][c] == '+') r++; else if (maze[r][c+1] == '+') c++; else if (maze[r-1][c] == '+') r--; else if (maze[r][c-1] == '+') c--; else return false; // no path exists } return solveMaze(r, c); } Examples 1.1

Solving a maze with the unfixed entry and exit ,[object Object],[object Object]

Finding the best path through a maze ,[object Object],[object Object],[object Object],[object Object],Example 1.5

Driving on a street I (A single car) ,[object Object],[object Object]

Speed limits ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Visiting a place ,[object Object],[object Object],[object Object],[object Object],[object Object],int iMap[][] = {{0, 0, 4, 1, 0, 0, 2, 0, 0}, {0, 1, 4, 1, 4, 2, 2, 1, 0}, {5, 5, 4, 5, 5, 5, 5, 5, 5}, {3, 3, 4, 3, 3, 3, 2, 3, 3}, {0, 5, 4, 0, 0, 0, 2, 1, 1}, {0, 3, 4, 0, 0, 0, 2, 5, 0}, {1, 1, 4, 0, 0, 0, 2, 3, 0}, {0, 0, 4, 2, 4, 1, 2, 0, 0}, {0, 0, 3, 3, 3, 3, 2, 1, 0}};

Stop signs ,[object Object],[object Object],[object Object],[object Object]

Traffic signals ,[object Object],[object Object],[object Object],[object Object]

Driving on a street II (Multiple cars) ,[object Object],[object Object],[object Object]

Three moving objects ,[object Object],[object Object],[object Object],[object Object]

Visiting a place against 3 other objects ,[object Object],[object Object],[object Object]

Day and night situations ,[object Object],[object Object],[object Object]

Appendix Blackjack Chess 4 / 4 Puzzle Elephant Spinout

Thanks for coming to my presentation http://www.public.coe.edu/organizations/ComputerClub/

An elementary navigation simulated in Java

Empfohlen

Empfohlen

Weitere ähnliche Inhalte

Andere mochten auch

Andere mochten auch (14)

Ähnlich wie An elementary navigation simulated in Java

Ähnlich wie An elementary navigation simulated in Java (8)

Mehr von Jinho Choi

Mehr von Jinho Choi (20)

Kürzlich hochgeladen

Kürzlich hochgeladen (20)

An elementary navigation simulated in Java