2019/5/28
public void pressedNumber(Number number)
{
if (activeNumber == -1)
{ //when there is no active number currently
changeActive(number);
}
else if (number == numbers.get(activeNumber))
{ //active number was pressed again
//do nothing
}
else if (number.getValue() != numbers.get(activeNumber).getValue()
&& number.getValue() + numbers.get(activeNumber).getValue() != 10)
{ //when the numbers are not the same and the sum isn't 10
changeActive(number);
}
else
{ //both numbers "match" and could be removed
int[] n = {activeNumber, numbers.indexOf(number)};
boolean match = false;
if (n[0]%9 == n[1]%9)
{//both Numbers are in the same column
match = true; //matched unless it is prevented by an unsolved number in between
for (int i=n[0]/9; i != n[1]/9; i = i+(int)Math.signum(n[1]-n[0]))
{
if (i==n[0]/9) continue;
if (!numbers.get(i*9+n[0]%9).getSolved())
{ //unsolved number in between
changeActive(number);
match = false;
break;
}
}
}
if (!match)
{ //not matched yet – no need to check if a match was found with the columns already
match = true; //matched unless it is prevented by an unsolved number in between
for (int i=n[0]; i != n[1]; i = i+(int)Math.signum(n[1]-n[0]))
{
if (i==n[0]) continue;
if (!numbers.get(i).getSolved())
{ //unsolved number in between
changeActive(number);
match = false;
break;
}
}
}
if (match)
{//if nothing unsolved is between them
solve(number);
}
}
}public void act()
{
if (!Greenfoot.mouseClicked(this)) return; // do nothing if not clicked
if (first == null) { meFirst(); return; } // when this is first clicked
if (first == this) { notMe(); return; } // when this is clicked twice
if (isValid() && inLine()) { covers(); return; } // when matching
}/** when first to be clicked */
private void meFirst()
{
first = this; // save first in static field
getWorld().addObject(HILITE, getX(), getY()); // add highlight actor
}
/** when this is both first and second clicks */
private void notMe()
{
first = null; // allow new first click
getWorld().removeObject(HILITE); // remove highlight
}
/** check numbers */
private boolean isValid()
{
return first.number == number || first.number+number == 8; // internal numbers are 1 less each than that displayed
}
/** check placement */
private boolean inLine()
{
int n = getY()*9+getX(); // position in grid
// horizontal check
int dir = 1;
int dn = dir;
for (int i=0; i<2; i++)
{
dir = -dir; dn = dir; // so the two iterations go in opposite directions
while (!getWorld().getObjectsAt(((n+dn+108)%108)%9, ((n+dn+108)%108)/9, Cover.class).isEmpty()) dn += dir; // skip past any covers
if (!getWorld().getObjectsAt(((n+dn+108)%108)%9, ((n+dn+108)%108)/9, Number.class).contains(first)) continue; // check not first clicked
return true;
}
// vertical check
dir = 9;
for (int i=0; i<2; i++)
{
dir = -dir; dn = dir; // so the two iterations go in opposite directions
while (!getWorld().getObjectsAt(((n+dn+108)%108)%9, ((n+dn+108)%108)/9, Cover.class).isEmpty()) dn += dir; // skip past any covers
if (!getWorld().getObjectsAt(((n+dn+108)%108)%9, ((n+dn+108)%108)/9, Number.class).contains(first)) continue; // check not first clicked
return true;
}
return false;
}
/** for valid matches */
private void covers()
{
getWorld().addObject(new Cover(), getX(), getY()); // cover this
getWorld().addObject(new Cover(), first.getX(), first.getY()); // cover first clicked
getWorld().removeObject(HILITE); // remove highlight
first = null; // allow new first clicked
} public boolean possibleToRemoveNumbers()
{
for (int i=0; i<numbers.size(); i++)
{
if (numbers.get(i).getSolved()) continue; //solved field can't be matched again
for (int j=i+1; j<numbers.size(); j++) //only need to check numbers after this one
{
if (numbers.get(j).getSolved()) continue; //solved field doesn't matter
if (numbers.get(i).getValue() == numbers.get(j).getValue()
|| numbers.get(i).getValue() + numbers.get(j).getValue() == 10)
{ //found a match
return true;
}
else break; //wrong number found
}
for (int j=i+9; j<numbers.size(); j+=9) //only need to check numbers below this one
{
if (numbers.get(j).getSolved()) continue; //solved field doesn't matter
if (numbers.get(i).getValue() == numbers.get(j).getValue()
|| numbers.get(i).getValue() + numbers.get(j).getValue() == 10)
{ //found a match
return true;
}
else break; //wrong number found
}
}
return false; //nothing found
}
import greenfoot.*;
public class Number extends Actor
{
public static HiLite HILITE;
private static final Color[] COLORS =
{
Color.BLACK,
new Color(255, 161, 38),
new Color(163, 8, 3),
new Color(8, 204, 11),
new Color(37, 113, 234),
new Color(8, 204, 11),
new Color(163, 8, 3),
new Color(255, 161, 38),
Color.BLACK,
};
private static Number first;
public int number;
public Number[] pairs = new Number[4];
public boolean[] matching = new boolean[4];
private boolean hasMatch;
public Number(int num)
{
number = num;
GreenfootImage img = new GreenfootImage(45, 45);
GreenfootImage numImg = new GreenfootImage(""+(num+1), 36, COLORS[num], new Color(0, 0, 0, 0));
img.drawImage(numImg, 22-numImg.getWidth()/2, 22-numImg.getHeight()/2);
setImage(img);
}
/** Checks for clicks and act upon them */
public void act()
{
if (!Greenfoot.mouseClicked(this)) return;
if (first == null) { meFirst(); return; }
int index = java.util.Arrays.asList(pairs).indexOf(first);
if (index < 0 || !matching[index]) { clearFirst(); return; }
covers();
}
/** Sets first click number */
private void meFirst()
{
first = this;
getWorld().addObject(HILITE, getX(), getY());
}
/** Prepares for new first click */
private void clearFirst()
{
first = null;
getWorld().removeObject(HILITE);
}
/** Looks for number paired with along given direction */
public void testDir(int d) // R=0, D=1, L=2, U=3
{
pairs[d] = null;
matching[d] = false;
int n = getX()+9*getY();
int j = (d%2 == 0) ? 1 : 9;
int dn = (d%2 == 0 ? 1-d : 2-d);
// find next uncovered (even back to self)
for (int i=1; i<=108/j; i++)
{
if (getWorld().getObjectsAt((n+i*j*dn+108)%9, ((n+i*j*dn+108)%108)/9, Cover.class).isEmpty())
{
pairs[d] = (Number)getWorld().getObjectsAt((n+i*j*dn+108)%9, ((n+i*j*dn+108)%108)/9, Number.class).get(0);
break;
}
}
// determine match
if (pairs[d] != null && pairs[d] != this && (pairs[d].number == number || pairs[d].number+number == 8)) matching[d] = true;
// check if state of having a match changed
if (hasMatch != matchHeld())
{
hasMatch = !hasMatch;
MyWorld.playerCount += (hasMatch ? 1 : -1);
}
}
/** Returns current state of having a match */
private boolean matchHeld()
{
return matching[0] || matching[1] || matching[2] || matching[3];
}
/** Covers a matching pair and updates pairings */
private void covers()
{
getWorld().addObject(new Cover(), getX(), getY());
getWorld().addObject(new Cover(), first.getX(), first.getY());
MyWorld.playerCount -= 2;
for (int n=0; n<4; n++)
{
if (pairs[n] != first && pairs[n] != this) pairs[n].testDir((n+2)%4);
if (first.pairs[n] != this && first.pairs[n] != first) first.pairs[n].testDir((n+2)%4);
}
clearFirst();
}
}