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

Akshay Kumar noreply at phabricator.kde.org
Tue Oct 30 18:05:50 GMT 2018

AkshayCHD added a comment.

  As per the documents and my opinion i think i should just check among the end moves if comp. can win. Ending moves would be random in initial levels and focused on winning in the last levels. Extending the algorithm to the entire pile would be an overhead as we cannot assume the user to play optimally in every move that would be.

  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/20181030/7a38c6a8/attachment.html>

More information about the kde-edu mailing list