flat assembler
Message board for the users of flat assembler.

Index > Heap > formulate every problem and use tetris or 2048 to solve them

Author
Thread Post new topic Reply to topic
sleepsleep



Joined: 05 Oct 2006
Posts: 8903
Location: ˛                             ⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣Posts: 334455
sleepsleep
assume human are having fun when playing tetris or 2048,

but how to formulate every problems and use tetris or 2048 to solve?

what is the term for research like above?

eg. (5 + 4) x 30
how to convert the above math question into something that solvable using tetris or 2048?

eg. the quick brown fox jumps over the lazy dog, calculate string len, and return string reverse.

i am curious, if it is possible, and what are the changes required to above games in order to make it, capable to solve every problems by just playing it as usual
Post 10 Apr 2015, 16:58
View user's profile Send private message Reply with quote
tthsqe



Joined: 20 May 2009
Posts: 725
tthsqe
You have to make the playing size arbitrary large.
Post 10 Apr 2015, 19:41
View user's profile Send private message Reply with quote
Tyler



Joined: 19 Nov 2009
Posts: 1216
Location: NC, USA
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 poly-time 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.)
Post 11 Apr 2015, 03:53
View user's profile Send private message Reply with quote
sleepsleep



Joined: 05 Oct 2006
Posts: 8903
Location: ˛                             ⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣⁣Posts: 334455
sleepsleep
Quote:

You have to make the playing size arbitrary large.

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?
Post 11 Apr 2015, 10:17
View user's profile Send private message Reply with quote
tthsqe



Joined: 20 May 2009
Posts: 725
tthsqe
try to implement a utm in what ever game you like
http://en.wikipedia.org/wiki/Universal_Turing_machine
Post 11 Apr 2015, 16:39
View user's profile Send private message Reply with quote
Display posts from previous:
Post new topic Reply to topic

Jump to:  


< Last Thread | Next Thread >
Forum Rules:
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You can attach files in this forum
You can download files in this forum


Copyright © 1999-2020, Tomasz Grysztar. Also on YouTube, Twitter.

Website powered by rwasa.