flat assembler
Message board for the users of flat assembler.
Index
> Heap > formulate every problem and use tetris or 2048 to solve them 
Author 

tthsqe
You have to make the playing size arbitrary large.


10 Apr 2015, 19:41 

Tyler
First it has to be proven that the initial conditions and solutions of those games have a bijective mapping to the initial conditions and solutions of the problem in question. And that would have to be done on a case by case basis.
It's sorta similar to showing that all the NP problems are equivalent. Generally, to do that, they show that, if you have a way to solve one of them fast, then you can formulate another in terms of the fast one and get a fast result. Sorta like nested algorithms (i.e. functions). Given a polynomial time algo for one of them, I can use that algo as a function inside another polytime algo and solve another problem. E.g. if you can solve boolean algebra problems in P, then you can reverse SHA, since there is a P algo that takes the input of an SHA hash, uses the P algo for boolean algebra, and outputs a text that will hash to the input. (But they had to formally prove that to know it's true.) 

11 Apr 2015, 03:53 

sleepsleep
Quote:
maybe, but how is that to translate the problem into solvable situation by tetris or 2048? do both games capable to solve (5 + 4) x 30 through normal game playing? how to present this problem and make use the matching game play to solve it? 

11 Apr 2015, 10:17 

tthsqe
try to implement a utm in what ever game you like
http://en.wikipedia.org/wiki/Universal_Turing_machine 

11 Apr 2015, 16:39 

< Last Thread  Next Thread > 
Forum Rules:

Copyright © 19992020, Tomasz Grysztar. Also on YouTube, Twitter.
Website powered by rwasa.