The window size is apparently fixed and does not update when the next world has a different size. You can download it to play in a different size at least.
@davmac: Any chance that the window size here on the site could update every time Greenfoot.setWorld is called?
I just noticed that I copied the Highscore table which shows the best three results instead of only the best one from my other scenario without changing how the scores are saved, so only the best one is showing. Doesn't matter too much since it doesn't run online anyway I guess...
I think it is a two player game. Player A creates a new pattern and memorizes it. Player B clicks on one square while Player A is not watching. The square's color inverts. Player A then tries to find out which square was changed and clicks it.
I am not exactly sure what causes it, but you are making it harder than it is.
If your Body/Head extend Snake, you should not have fields with the same name as in the Snake class.
How I just made it work:
Remove all "direction" variables, the "go" and "calcV" methods, simply turn the actor in the direction it should move and move it with the move method. Then when adding a new body part, you can add it to the world with the same rotation as the last one and move it back one cell.
Save the "prevdir" at the beginning of the act method of Body/Head.
Oh, it is also not really needed that the calculation is done every act-cycle. You only need to execute it once (or once every time something changed).
I just saw this image here https://i.gyazo.com/a5aeacfa6056d5a15af753f781274b06.png and noticed that something had to be wrong with the calculation of the shortest distance.
You distance method should be "return Math.hypot(x1-x2, y1-y2);". To test that your method doesn't work, execute this line:
System.out.println(2^2);
It prints 0 and that's not what you want to do. ^ is the XOR in Java, not the for powering a number. To calculate 2^2, you would need to use Math.pow(2, 2). The hypot method is a shortcut for Euclidian distances (= square-root of the sum of squared distances in each direction).
2019/6/5
Pac-Man
2019/5/28
SPIKXX
2019/5/22
HELP
2019/4/24
Zaubermatrix
2018/10/12
Can't figure out why its not working
2018/8/14
Pac Man
2018/8/14
Almost a solution to the Traveling Salesman Problem
2018/8/14
Almost a solution to the Traveling Salesman Problem
2018/8/14
Almost a solution to the Traveling Salesman Problem