Dear FIFE community,
my name is Yary and I am a twenty-nine years old computer engineer from Italy.
I was working for my own sake on a java hexagonal map engine when I found this project. I really would like to share my knowledge and lend an hand to improve it if possible.
I took a look in the section "open positions" and I found that some help with path finding would be appreciated, and that's the field I could maybe work in.
I attached the NetBeans Java project I was working recently, if you want to have an idea on how i program and so on.
You can download it from sourceforge:
https://sourceforge.net/projects/javahexagonsmap/files/RealHexGen.tar.gz/downloadJust to have a look on the project:
- Download Java JDK and NetBeans
- Open the project and run it
- When the window shows up, click on "generate" button, if you want you can adjust the settings
- - rows and columns define the size of the grid
- - size decide the length of the edge of the hexagons
- All the cells are initialized in random fancy colors
- left click selects a cell (becomes white), if there is another cell selected, the program calculate a path (Dijkstra's algorithm) and show it in blue.
- right click on a cell make it unreachable (becomes red): see how paths change if the edges are separated by walls!
Looking forward to your reply,
Yary
