D16492: Rewrite current bargame algorithm to use a generalized version of nim agorithm

Johnny Jazeix noreply at phabricator.kde.org
Mon Oct 29 18:12:46 GMT 2018

jjazeix added a comment.

  the aim was to have something easier, this algo seems more difficult to understand.
  Maybe I'm wrong, but for me, you can win as long as there is (n +/- m) % something else (depending on how much balls you can remove min/max and total balls number).
  Basically, on easier mode: 1-4 balls to remove and 15 total balls number.
  As long as there is 11, then 6 balls to find, you win. So there is a way to generalize this formula to find if you can win or not.

  R2 GCompris


To: AkshayCHD, #gcompris_improvements
Cc: jjazeix, kde-edu, #gcompris_improvements, harrymecwan, ganeshredcobra, nityanandkumar, echarruau, rahulyadav, narvaez, scagarwal, apol, timotheegiet, hkaelberer, bcoudoin
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.kde.org/pipermail/kde-edu/attachments/20181029/065f02e5/attachment.html>

More information about the kde-edu mailing list