Numaranızı isterseniz ekleyin.
Rules of Game:
- The initial and goal states will be given by user.
- The tiles can be moved up, down, right, or left.
- The game will begin by the move of Tile #1 (ifrequired) and go on with the moves of other tiles inorder.
For example:
- 1st step: move Tile #1
- 2nd step: move Tile #2
- 3th step: move Tile #3
- 4th step: move Tile #1
- 5th step: move Tile #2
- 6th step: move Tile #3
- Distance(cost) between two neighboring states will be measure based on the move costs as given below
Tile #1 | Tile #2 | Tile #3 |
---|---|---|
right or left move -> cost =2 | right or left move -> cost =1 | right or left move -> cost =3 |
up of down move -> cost =1 | up of down move -> cost =2 | up of down move -> cost =4 |
- User will choose one of the searching strategies: uniform cost and A* search (use Manhattan distance as heuristics).
- The expansion will go on till 20th expanded node. The program will print out each expanded state and compare it with given goal state.
- You are free to use any programming language for implementation.
- Assoc. Prof. Senem KUMOVA METİN
- Fidan ÇELENK
- Ercan ACAR
- Mustafa ALAN
- Ayşegül MERCAN
- Cem ÖZCAN