Thank you so much for posting this! It helped me actually solve it

You can translate it to Java if you want :]

This has been happening to me for the past week. I don't know what the problem/solution is.

Indeed take a look at the formula for points: points = numberOfDamagedShips * 0.5 + numberOfSunkShips - notTouchedShips

that's not a failling test but an exception that your code is raising when it's executed. Too much imbricated parenthesis (each parentheses pair is equivalent to a recurcive call, so you did saturate the heap space). You'll need to rewrite a bit your code. ;)

Same problem here. I had to translate to JavaScript to solve this kata (the same code passed all the tests there).

yes it should.

final class BinOp implements Ast {
  public BinOp(String op, Ast a, Ast b) {}

  @Override public String op() {}

  public Ast a() {}

  public Ast b() {}

  @Override
  public boolean equals(Object o) {}

  @Override
  public int hashCode() {}

  @Override
  public String toString() {}
}

final class UnOp implements Ast {
  public UnOp(String op, int n) {}

  @Override
  public String op() {}

  public int n() {}

  @Override
  public boolean equals(Object o) {}

  @Override
  public int hashCode() {}

  @Override
  public String toString() {}
}

CW servers troubles. Nothing to do except wait some time...

It's already implemented in the preloaded part.