| |
|
NPuzzle Problem In Java, Lisp & Prolog
Title: NPuzzle Problem In Java, Lisp & Prolog
Category: Science & Technology / Computers and Cybernetics
Details: Words: 9015 | Pages: 38.4 (approximately 235 words/page)
NPuzzle Problem In Java, Lisp & Prolog
ABSTRACT
The well known N-puzzle problem consists of a square board containing N square tiles and an empty position called the "blank". Authorized operations like up, down, left and right slide any tile adjacent to the blank into the blank position. The task is to rearrange the tiles from some random initial configuration into a particular designed goal configuration. A* search is used to solve the N-puzzle in this paper. This application has been implemented …showed first 75 words of 9015 total…
You are viewing only a small portion of the paper.
Please login or register to access the full copy.
|
|
…showed last 75 words of 9015 total…gt;printResult(As).
printPuzzle([]):-
<Tab/>write('\n').
printPuzzle([A,B,C|D]):-
<Tab/>write(A),
<Tab/>write(B),
<Tab/>writeln(C),
<Tab/>printPuzzle(D).
replace([Old|L0], Old, New, [New|L0]).
replace([X|L0], Old, New, [X|L]) :-
<Tab/>replace(L0, Old, New, L),
<Tab/>X\=Old.
Need a custom written paper?
|
|
|
