Programming java<\/p>\n
see the pdf file<\/p>\n
also need to write one page paper on it.<\/p>\n
Project 1<\/p>\n
CSC 2053 – Platform Based Computing<\/p>\n
Grading: 150 points<\/p>\n
Due Date: Oct. 3, 2018<\/p>\n
Part 1 – Solve Puzzle using Breadth First Search (100 points)<\/p>\n
Graphs and trees have can represent a multitude of problems. We will create a game tree that<\/p>\n
solves the \u201csliding block\u201d problem and traverse this tree using a breadth-first search. This project<\/p>\n
is meant to reinforce the basic data structures, variables, and methods that you have learned as<\/p>\n
well as complex notions of queues, trees, graphs, and lists. Use the following template code below<\/p>\n
as a starting point.<\/p>\n
File: Play.java<\/p>\n
import java.util.*;<\/p>\n
public class Play{<\/p>\n
public static List<GameState> explored; \/\/explored stores our marked vertices<\/p>\n
public static Deque<GameState> frontier; \/\/frontier is our queue for BFS<\/p>\n
public static void main(String[] args) {<\/p>\n
int[][] tArr = {{1,5,2},{3,4,0},{6,8,7}}; \/\/start state, i.e. tree root<\/p>\n
GameState start = new GameState(tArr,null); \/\/ state with tArr state, null parent<\/p>\n
explored = new ArrayList<GameState>();<\/p>\n
frontier = new ArrayDeque<GameState>();<\/p>\n
\/\/Perform a Breadth First Search here<\/p>\n
\/\/Note: We will not create the graph or enumerate the edges<\/p>\n
\/\/The graph is too large to store in memory<\/p>\n
\/\/We will create the vertices of the graph and edge connections on the fly<\/p>\n
}<\/p>\n
}<\/p>\n
File: GameState.java<\/p>\n
import java.util.*;<\/p>\n
public class GameState{<\/p>\n
public int[][] state; \/\/state of the puzzle<\/p>\n
public GameState parent; \/\/parent in the game tree<\/p>\n
public GameState() {<\/p>\n
\/\/initialize state to zeros, parent to null<\/p>\n
}<\/p>\n
public GameState(int[][] state) {<\/p>\n
\/\/initialize this.state to state, parent to null<\/p>\n
}<\/p>\n
public GameState(int[][] state, GameState parent) {<\/p>\n
\/\/initialize this.state to state, this.parent to parent<\/p>\n
}<\/p>\n
public GameState swapRight(GameState s, int row, int col) {<\/p>\n
\/\/helper function to swap blank space with right block<\/p>\n
}<\/p>\n
public GameState swapLeft(GameState s, int row, int col) {<\/p>\n
\/\/helper function to swap blank space with left block<\/p>\n
}<\/p>\n
public GameState swapUp(GameState s, int row, int col) {<\/p>\n
\/\/helper function to swap blank space with up block<\/p>\n
}<\/p>\n
public GameState swapDown(GameState s, int row, int col) {<\/p>\n
\/\/helper function to swap blank space with down block<\/p>\n
}<\/p>\n
public boolean isEnd() {<\/p>\n
\/\/helper function to check if the GameState is the end state e.g.<\/p>\n
\/\/0 1 2<\/p>\n
\/\/3 4 5<\/p>\n
\/\/6 7 8<\/p>\n
}<\/p>\n
public ArrayList<GameState> getAdjacent() {<\/p>\n
\/\/Use the swap functions to generate the new vertices of the tree<\/p>\n
\/\/Beware of the boundary conditions, i.e. don\u2019t swap left when you are<\/p>\n
\/\/already on the left edge<\/p>\n
}<\/p>\n
@Override<\/p>\n
public boolean equals(Object o) {<\/p>\n
\/\/test that 2 GameStates are equal<\/p>\n
}<\/p>\n
@Override<\/p>\n
public String toString() {<\/p>\n
\/\/ print out the int[][] array in a 3×3 block e.g.<\/p>\n
\/\/0 1 2<\/p>\n
\/\/3 4 5<\/p>\n
\/\/6 7 8<\/p>\n
}<\/p>\n
Part 2 – PDF write up (50 points) Create a 1-2 page write up that summarizes the interesting<\/p>\n
parts of your program. Include any problems or insights that you encountered.<\/p>\n
Sample solution of the given problem. Your program should output the solution in a similar<\/p>\n
fashion.<\/p>\n
0 1 2<\/p>\n
3 4 5<\/p>\n
6 7 8<\/p>\n
3 1 2<\/p>\n
0 4 5<\/p>\n
6 7 8<\/p>\n
3 1 2<\/p>\n
6 4 5<\/p>\n
0 7 8<\/p>\n
3 1 2<\/p>\n
6 4 5<\/p>\n
7 0 8<\/p>\n
3 1 2<\/p>\n
6 0 5<\/p>\n
7 4 8<\/p>\n
3 1 2<\/p>\n
6 5 0<\/p>\n
7 4 8<\/p>\n
3 1 2<\/p>\n
6 5 8<\/p>\n
7 4 0<\/p>\n
3 1 2<\/p>\n
6 5 8<\/p>\n
7 0 4<\/p>\n
3 1 2<\/p>\n
6 5 8<\/p>\n
0 7 4<\/p>\n
3 1 2<\/p>\n
0 5 8<\/p>\n
6 7 4<\/p>\n
0 1 2<\/p>\n
3 5 8<\/p>\n
6 7 4<\/p>\n
1 0 2<\/p>\n
3 5 8<\/p>\n
6 7 4<\/p>\n
1 5 2<\/p>\n
3 0 8<\/p>\n
6 7 4<\/p>\n
1 5 2<\/p>\n
3 8 0<\/p>\n
6 7 4<\/p>\n
1 5 2<\/p>\n
3 8 4<\/p>\n
6 7 0<\/p>\n
1 5 2<\/p>\n
3 8 4<\/p>\n
6 0 7<\/p>\n
1 5 2<\/p>\n
3 0 4<\/p>\n
6 8 7<\/p>\n
1 5 2<\/p>\n
3 4 0<\/p>\n
6 8 7<\/p>\n
Deliverables: Submit on Blackboard.<\/p>\n","protected":false},"excerpt":{"rendered":"
Programming java see the pdf file also need to write one page paper on it. Project 1 CSC 2053 – Platform Based Computing Grading: 150 points Due Date: Oct. 3, 2018 Part 1 – Solve Puzzle using Breadth First Search Read More …<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-427257","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/427257","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/comments?post=427257"}],"version-history":[{"count":0,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/427257\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/media?parent=427257"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/categories?post=427257"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/tags?post=427257"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}