Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

8
  • \$\begingroup\$ Can confirm it works so far, but by far the slowest but one of the best so far I think. Needs 134 seconds for 100 games against RandCat while doing a total of only 4406 moves! I think I'm gonna have to let my pc run overnight in one of the next days... Can you tell us a bit mor on how it works? \$\endgroup\$ Commented Jun 2, 2015 at 21:44
  • \$\begingroup\$ @flawr Added a description. \$\endgroup\$ Commented Jun 2, 2015 at 23:15
  • \$\begingroup\$ Still doesn't work for me. Gives me one error: error: cannot infer type arguments for PriorityQueue<> on this line PriorityQueue<int[]> open = new PriorityQueue<>(new Comparator<int[]>() {. \$\endgroup\$ Commented Jun 3, 2015 at 5:57
  • \$\begingroup\$ @CoolGuy Are you using java 6? I think you need to update your JDK. \$\endgroup\$ Commented Jun 3, 2015 at 15:04
  • \$\begingroup\$ @CoolGuy You can also put an int[] between the two empty diamonds after PriorityQueue. \$\endgroup\$ Commented Jun 3, 2015 at 16:03