Permalink
Cannot retrieve contributors at this time
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
CheckersAI/src/Move3.java
Go to fileThis commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
103 lines (89 sloc)
2.4 KB
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class Move3 implements Move{ | |
int src, dest; | |
String[] steps; | |
int[] kills; | |
String check; | |
public Move3(String steps){ | |
String[] s = steps.split(","); | |
this.steps = s; | |
this.src = Integer.parseInt(s[0]); | |
this.dest = Integer.parseInt(s[s.length - 1]); | |
kills = calculate_kills(s); | |
} | |
public int[] calculate_kills(String[] steps){ | |
int diff = this.src - this.dest; | |
if(Math.abs(diff) == 4 || Math.abs(diff) == 5){ | |
return null; | |
} | |
int[] k = new int[steps.length - 1]; | |
for(int i = 0; i < steps.length - 1; i++){ | |
k[i] = (Integer.parseInt(steps[i]) + Integer.parseInt(steps[i+1]))/2; | |
} | |
return k; | |
} | |
public int source(){ | |
return src; | |
} | |
public int destination(){ | |
return dest; | |
} | |
public int[] captures(){ | |
return kills; | |
} | |
public boolean isJump(){ | |
return this.kills != null; | |
} | |
// private String convert(int pos){ | |
// int x; | |
// int y; | |
// if(pos < 8){ | |
// int x = 2 * p + 1; | |
// int y = pos / 4; | |
// } | |
// else if(pos < 17){ | |
// int x = | |
// | |
private String convert(int position) { | |
// Converts a position to the correct String | |
int row = position / 4; | |
int col = (position % 4) * 2; | |
if(row % 2 == 0){ | |
col++; | |
} | |
return "("+(7-row)+":"+col+")"; | |
} | |
private int shift(int position){ | |
int row, column; | |
int new_pos = position; | |
if(position >= 27){ | |
return (position - 3); | |
} | |
else if(position >= 18){ | |
return (position - 2); | |
} | |
else if(position >= 9){ | |
return (position - 1); | |
} | |
else{ | |
return position; | |
} | |
} | |
// public String toString(){ | |
// String move = "(" + this.steps[0] + ":" + this.steps[1] + ")"; | |
// if(this.steps.length > 2){ | |
// for(int i = 1; i < this.steps.length - 1; i++){ | |
// move += ":(" + this.steps[i] + ":" + this.steps[i+1] + ")"; | |
// } | |
// } | |
// return move; | |
// } | |
// | |
public String toString() { | |
String output = ""; | |
for(int i = 0; i<steps.length; i++) { | |
output += i!=0 ? ":" : ""; | |
output += convert(shift(Integer.parseInt(steps[i]))); | |
} | |
return output; | |
} | |
} |