Skip to content

dejanberic/PolyKiteFun

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

PolyKiteFun

This is a project which explores all possible polykites and their corresponding Heesch numbers.

Polykites are usually defined by taking one sixth of a hexagon from a grid of hexagons, and if you increase the number of kites which are next to each other, you get a polykite.

By creating polykites in this way you are constrained to that hexagon grid, and thus you get for n kites m ways of arranging them in that grid.

The numbers of polykites with n=1, 2, ... components are 1, 2, 4, 10, 27, 85, 262, ... OEIS A057786

But, this project explores polykites which are not constrained by the hexagon grid, but instead they are bound by them selves, i.e. their edges of the same length has to match.

When doing things this way the numbers of polykites with n=1, 2, ... components are 1, 4, 14, 86, 524, 3661, 25637, 185374, ...

Examples where n is 2:

Polykites-2

n is 3:

Polykites-3

n is 4:

Polykites-4

Examples of found combinations and their Heesch numbers

You can find examples of up to Heesch number 3 for n 2,3 and 4 in combinations folder of this repository.

Because the number of combinations and their Heesch number solutions grow rapidly, the solutions for n 5,6,7, and 8 are located here.

One interesting thing you can find there for n = 8, is that the solution number 181053 is the Einstein tile

Usage

This .NET 9.0 project is tested only on Windows but it should be cross platfom. You can find the binary for windows in the releases page here in github.

When you start the program, it will ask you how many kites are you willing to combine in a single tile, this represents the polykite of number n.

Then it will ask you up to which Heesch number are you willing to explore those tiles/polykites.

Once all of the combinations for n kites are found you can pick one solution to explore or you can process all of those polykites.

Found solutions are saved in the json file so you do not need to find those polykites again, for example combinations_2.json is a json file which saves all of the information for polykites where n = 2.

The folder structure of found polykites and their corresponding Heesch numbers is this: combinations/{images of polykites}/{HeeschNumber 1,2,3...}

Contributing

Create PRs and I might look at it :)

License

This project, including all code and images in this repository and those hosted at Mega.nz folder, is licensed under the MIT License. See the LICENSE file for details.

About

Program which explores all possible n-kites, their shapes and their Heesch numbers.

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages