You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I want to use your code to implement a way to find a solution for F2L. I have decided to use corner representation and edge representation for the heuristics which will be in 2 separate files. The corner heuristic will only contain one corner, the F2L pair corner. The heuristic will contain the information about the corners location (One of 8 possible places) and the orientation(one of 3 possible orientations). The edge heuristic will be a bit larger as it will contain information of the cross edges and the corresponding edge piece for the F2L pair.
I have calculated that I will have about 24 lines for the corner heuristic file and 190k for the edge heuristic.
My issue is that I have no idea on how to implement these heuristics in the IDA* algorithm. I know how to generate these states, but the idea of two separate heuristic files just baffles me. I thought maybe you could help me understand this idea and give some recommendations as I am very new at programming, still a student.
The text was updated successfully, but these errors were encountered:
I also read this paper and in it there is a section 3.3.3. where the author briefly mentions the creations of the heuristics how he will be using 3 tables. I don't know if this helps understand my problem or not, I just thought it might be relevant.
I want to use your code to implement a way to find a solution for F2L. I have decided to use corner representation and edge representation for the heuristics which will be in 2 separate files. The corner heuristic will only contain one corner, the F2L pair corner. The heuristic will contain the information about the corners location (One of 8 possible places) and the orientation(one of 3 possible orientations). The edge heuristic will be a bit larger as it will contain information of the cross edges and the corresponding edge piece for the F2L pair.
I have calculated that I will have about 24 lines for the corner heuristic file and 190k for the edge heuristic.
My issue is that I have no idea on how to implement these heuristics in the IDA* algorithm. I know how to generate these states, but the idea of two separate heuristic files just baffles me. I thought maybe you could help me understand this idea and give some recommendations as I am very new at programming, still a student.
The text was updated successfully, but these errors were encountered: