






 TestingTuring 
      posted 12/16/2015 03:09          
I apologize if this question is out of the guidelines of this forum. If it is please let me know and i will abstain from requesting definitions and terminology.
Hello! I am currently writing a program to find the shortest path solution in a randomized rubix cube. There is a certain langauge/search based methodology that has caught my attention, and which i would like to apply to the solution, but I am unaware of what kind of terminology i should be looking up.
THE METHODOLOGY:
The methodology is one where different languages are developed to satisfy different aspects of the cubes solution. For instance we might find a language/grammar which appropriately describes/generates all transformations which move one block of the cube to some position we want it to be. We may then find another language which satisfies the movement of another block to some position we want it to be. The language which satisfies both of these languages is the one which generates transformations which will move BOTH blocks to where they are supposed to be.
WHAT I WOULD LIKE TO LEARN MORE ABOUT:
It is in this sense that I am interested in learning more about how languages can be tested against each other in order to CONSTRAIN the otherwise unweildly "search tree" that would be required to be derived and searched in order to find the solution.
At the same time i would like to build a symbolic vocabulary which would allow me to compare the different pertinent variables (runtime, memory size, etc.) of different tree search constraint methodologies, particularly language based methdods (as i have poorly defined them).
I am also particularly interested in the methodologies that can be used to detect patterns in the strings which are satisfying two seperate languages so that a third language which satisfies both can be developed.
Also, i would like to learn more about how we can show that one language is mutually exclusive to another language.
I am particularly interested in terminology so that i might do research on the internet, however i would also greatly appreciate any book recommendations. Thank You!
  
   keghn 
      posted 12/17/2015 03:02           The way i learn to do the Rubik's was make a small move away from
the original position of just one square and then to move it go bock
to were i started. Like at firs move one the back, thee move then back
then four move and then back and so on.
I did not try to solve it at first. Once i learn a instruction set of small
moves, i then could solve the cube.
I could see a program with movement instruction to solve the cube.
For language i recommend starting with Kolmogorov complexity:
https://en.wikipedia.org/wiki/Kolmogorov_complexity
   Kolmogorov complexity   
   rouncer 
      posted 12/17/2015 12:27           I dont know why you dont want to make the search tree!!!
thats a perfect (and general!) solution to alot of puzzle solving, to not repeat a mistake!
Thats actually the method im going to use for my AGI! I wonder if ill be successful or not.
  
   keghn 
  



