https://github.com/ahmetkasif/kmaxit
Remake of Maxit Game using LibGDX (Outdated, will rebuild when i get some free-time)
https://github.com/ahmetkasif/kmaxit
artificial-intelligence game greedy-algorithms java libgdx
Last synced: 6 months ago
JSON representation
Remake of Maxit Game using LibGDX (Outdated, will rebuild when i get some free-time)
- Host: GitHub
- URL: https://github.com/ahmetkasif/kmaxit
- Owner: ahmetkasif
- License: mit
- Created: 2015-03-25T09:27:29.000Z (over 11 years ago)
- Default Branch: master
- Last Pushed: 2022-09-20T06:06:30.000Z (almost 4 years ago)
- Last Synced: 2024-05-28T15:07:36.103Z (about 2 years ago)
- Topics: artificial-intelligence, game, greedy-algorithms, java, libgdx
- Language: Java
- Homepage:
- Size: 137 MB
- Stars: 11
- Watchers: 11
- Forks: 2
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
# KittenMaxit - now using LibGDX
LibGDX kütüphanesi yardımıyla geliştirilen Maxit oyunu. Kaynak kodunu yerel makinanızda derlemek isterseniz, LibGDX'in konu hakkındaki şu yazısını okuyun : https://github.com/libgdx/libgdx/wiki/Gradle-on-the-Commandline#packaging-for-the-desktop.
Distributions klasöründen istediğiniz versiyona tıklayıp, ardından raw formatta göster demenizi takiben dosya inmeye başlayacaktır. Uygulamayı çalıştırabilmek için, 32bit Java sahibi olmanız gerekmektedir. İndirme konusunda sıkıntı yaşayanlar için indirme linki :
https://github.com/ahmetkasif/KittenMaxit/blob/master/distributions/kmaxit+%20v1.6.1.jar?raw=true
If you want to contribute, project is ready to be imported to eclipse. You have to have 32bit Java installed in order to use this application, 64 bit Java is not supperted.
Conributors
[Abdullah Öğük](https://github.com/abdullahoguk)
**Problem**
Writing a program to play MAXIT. The board is represented as an N-by-N grid of numbers randomly placed at the start of the game. One position is designated as the initial current
position. Two players alternate turns. At each turn, a player must select a grid element in the
current row or column. The value of the selected position is added to the player’s score, and
that position becomes the current position and cannot be selected again. Players alternate
until all grid elements in the current row and column are already selected, at which point the
game ends and the player with the higher score wins.
**Solution**
Solution solution is based on greedy approach. “A greedy algorithm is an algorithm that follows the problem solving heuristic of making the locally optimal choice at each stage with the hope of finding a global optimum. In many problems, a greedy strategy does not in general produce an optimal solution, but nonetheless a greedy heuristic may yield locally optimal solutions that approximate a global optimal solution in a reasonable time.”
**Algoritm**
```Java
for all i values starting from 0 to point of last chosen point on x axis,
if the previous number is less than current number,
assign current number
for all i values starting from the last chosen point to 5 on x axis,
if the previous number is less than current number,
assign current number
for all k values starting from 0 to point of last chosen point on y axis,
if the previous number is less than current number,
assign current number
for all k values starting from the last chosen point to 5 on y axis,
if the previous number is less than current number,
assign current number
```
#Screenshots
