https://github.com/ttsiodras/flip

Automatically solving Simon Tatham's Flip puzzle
https://github.com/ttsiodras/flip

Last synced: 4 days ago
JSON representation

Automatically solving Simon Tatham's Flip puzzle

• Host: GitHub
• URL: https://github.com/ttsiodras/flip
• Owner: ttsiodras
• License: lgpl-3.0
• Created: 2013-07-04T14:42:39.000Z (over 11 years ago)
• Default Branch: master
• Last Pushed: 2013-10-28T13:14:08.000Z (about 11 years ago)
• Last Synced: 2023-03-10T22:52:53.855Z (almost 2 years ago)
• Language: C++
• Homepage:
• Size: 176 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
Flip

====

Automatically solving Simon Tatham's Flip puzzle (Breath-First-Search, optimizing memory use).

I implemented my first attempt in OCaml, and when I realized memory usage is an issue,

I switched to C++ 11 - where I lessened memory use by almost 2 orders of magnitude

via bitsets - and got a 10x speedup.

I then realized I can do the same via bit-level handling in OCaml, and proceeded to do so.

The two are now within 15% - execution time-wise. Memory wise, C++ is still king: in the

sample board used to test, it only needed 280MB, whereas OCaml needed 595MB.

To run and see it solve a board, just "make test".

Have any questions? Just mail me...

Thanassis Tsiodras, Dr.-Ing.

[email protected]