Skip to content

Latest commit

 

History

History
50 lines (35 loc) · 1.89 KB

File metadata and controls

50 lines (35 loc) · 1.89 KB

Turing Machine Solver

This is a solver for the board game "Turing Machine".

Credits/links:

Building

CLI Build

Just run make in the root directory. Then you can run the binary ./a.out.

WASM Build

The WASM build requires a working emscripten toolchain.

Afterwards, you can run make wasm to build.

Frontend

Run npm install in the frontend directory. Then, you can run npm run start to build and serve the frontend on your local machine.

Tests

Run make doctest in the root directory. Then you can run the binary ./test.out.

Progress

  • Initial deductions before the game
  • Basic CLI usage
  • Deductions based on machine answers
  • Implement all cards and verifiers
  • Use the Turing Machine Interactive Sheet as frontend with this solver as WASM module
  • Implement letter checkboxes in the frontend
  • Implement classic and extreme mode
  • Check letter combinations
  • Use web workers to not block the main thread
  • Deploy on github pages
  • Implement comment list of all possible codes in the frontend
  • Check comment list of all possible codes
  • Verify queries (warn if no code is possible)
  • Add tests based on known puzzles + solutions
  • Implement puzzle generation
  • Use service workers for an offline experience
  • Algorithm documentation