Mark Gritter (markgritter) wrote,
Mark Gritter
markgritter

More KadoKado math

Still trying to think of ways to improve my Xian-Xiang solver. There must be better ways to prune the search tree.

I figured out the scoring for Kaskade 2. A group of 2 is worth 100. Each group of size N is worth (N-1)*100 + the score of the next-smallest group. So it goes 100, 300, 600, 1000, ...

S(2) = 100
S(n+1) = S(n) + n*100
so I guess S(n) = (n^2-n)*50

Check: S(n+1) = ((n+1)^2-(n+1))*50 = (n^2+2n+1-n-1)*50 = (n^2+n)*50 = (n^2-n)*50+(2n)*50 = S(n)+n*100

To get a top score you need to average a group of 16 every click (or a group of 23 every two clicks.)
Tags: games, geek, math
Subscribe
  • Post a new comment

    Error

    default userpic

    Your reply will be screened

    Your IP address will be recorded 

    When you submit the form an invisible reCAPTCHA check will be performed.
    You must follow the Privacy Policy and Google Terms of use.
  • 0 comments