Skip to content

A one-person game that visualizes Buchberger's algorithm to find the reduced Gröbner basis of a set of binomials over ℤ₂[𝑥,𝑦]

License

Notifications You must be signed in to change notification settings

kovzol/groebner-solitaire

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

37 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Gröbner Solitaire

This is a one-person game that visualizes Buchberger's algorithm to find the reduced Gröbner basis of a set of binomials over ℤ₂[𝑥,𝑦].

Haley Dozier and John Perry published a paper Androids Armed With Poisoned Chocolate Squares: Ideal Nim and Its Relatives in Mathematics Magazine in December of 2017. This project is a visualization of the idea of Gröbner Nim, in a one-person mode. That is, the player needs to reach the reduced Gröbner basis of the initially given set of segments.

The implementation is written in HTML/JavaScript and uses GeoGebra for rendering the graphical objects. An installed version can be tried out. A video describes how a typical game flow looks like.

This project is a work-in-progress. At the moment Google Chrome, Chromium, Firefox, Opera and Edge are the known supported browsers. Currently only four game levels are included. The level can be selected by appending ?level=0 or ?level=1, and so on, to the URL.

Three languages are supported in the gameplay: English, German and Hungarian. Language selection is possible by appending e.g. &lang=German after the level selection. (See more on this at the description of query string and HTTP GET request.)

Author: Zoltán Kovács zoltan@geogebra.org

German translation: Benedek Kovács kovben2004@gmail.com

The author is grateful to Alexander Vujic for his help in bugfixing.

About

A one-person game that visualizes Buchberger's algorithm to find the reduced Gröbner basis of a set of binomials over ℤ₂[𝑥,𝑦]

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published