https://github.com/norpan/zjvoltis

Minimax search for the game of Zjvoltis
https://github.com/norpan/zjvoltis

minimax-algorithm rust-lang zjvoltis

Last synced: about 2 months ago
JSON representation

Minimax search for the game of Zjvoltis

• Host: GitHub
• URL: https://github.com/norpan/zjvoltis
• Owner: norpan
• Created: 2024-12-05T08:51:46.000Z (6 months ago)
• Default Branch: master
• Last Pushed: 2024-12-08T11:02:54.000Z (6 months ago)
• Last Synced: 2025-02-13T10:49:51.615Z (3 months ago)
• Topics: minimax-algorithm, rust-lang, zjvoltis
• Language: Rust
• Homepage: https://docs.google.com/document/d/1SJdlAXK7SexHW_NHt7-mNx-cuDniGP-sidiVCnrNftE/
• Size: 19.5 KB
• Stars: 0
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.txt

Awesome Lists containing this project

README

        
Zjvoltis minimax search implementation

Files:

main.rs - main file for the program, calls the iterative deepening function in a separate thread and then prints out the results as they come

minimax.rs - minimax search algorithm, iterate functions runs iterative deepening (searching first at 0 depth, then at 1 and so on)

zjvoltis.rs - contains the game data structure and logic

Game is represented as a 10x10 array with a u8 value for each square. For efficiency of evaluation it also keeps track of material count.

There is also conversion from a "FEN" variant of representing the board. It is similar to the chess FEN format. The initial position looks like this in Zjvoltis FEN:

"i1ll1jj1oo/i1zl1js1oo/izzltjssvv/iz1ttt1sv1/A/A/1VS1TTT1ZI/VVSSJTLZZI/OO1SJ1LZ1I/OO1JJ1LL1I w"

Enjoy!