Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

[Chapter 6] MrNom maximum score #27

Closed
GoogleCodeExporter opened this issue Mar 6, 2016 · 2 comments
Closed

[Chapter 6] MrNom maximum score #27

GoogleCodeExporter opened this issue Mar 6, 2016 · 2 comments

Comments

@GoogleCodeExporter
Copy link

In the printed version of the book, in the sub-section "The World Class", 
chapter 6, page 257, Mr.Nom maximum score is wrong.

Ok, this has no effect with the game, nor with our learning process, but I love 
Mr.Nom and it can do better than 1000 points :)

The world is big 10x13 cells, and 3 of them are already occupied by the snake 
at the beginning of the game. So, the greatest lunch of Mr.Nom is (10 * 13) - 3 
 = 127 stains, which are equals to 1270 points. There is no need of parenthesis 
in this calculation, but in the book they aren't written, and bad priority with 
math operations has turned in wrong result.

Go Mr.Nom, beat your highscore!!

--- Alessandro Dal Bello ---

Original issue reported on code.google.com by alessand...@gmail.com on 25 Aug 2011 at 9:05

@GoogleCodeExporter
Copy link
Author

Good catch! Will change that in second edition. Thanks a bunch.

Original comment by badlogicgames on 27 Aug 2011 at 11:55

  • Changed title: [Chapter 6] MrNom maximum score

@GoogleCodeExporter
Copy link
Author

Fixed in second revision, thanks a bunch!

Original comment by badlogicgames on 6 Sep 2011 at 1:47

  • Changed state: Fixed

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant