Hi, I have a problem that is seemingly just solvable by enumerating all possible solutions and then finding the best. In order to do so, I devised a backtracking algorithm that enumerates and stores the best solution if found. It works fine so far. Now, I wanted to port this algorithm to CUDA. Therefore, I created a procedure that gene...
Say I have the following piece of code: edge(a, b). edge(a, c). edge(a, d). Now when I do neighbors(V, N) :- edge(V, N), writeln(N), fail. I can get a list of the neighbors printed out to the console. But how can I get it as a result list? Something like neighbors(V, Vs) :- edge(V, N), not(member(N, Vs)), neighbor...
i want to build a sorting method to sort array "4,2,7,5,1" into "1,2,4,5,7" my current code is public static Node<Integer> sort_it(int[] arr, int fst, int last, Node<Integer> part_soln) { if (fst>last) return part_soln; // return a sorted list else { for (int row=0; row<=last; row++) { if ...
Possible Duplicate: Java backtracking problem This problem must be used by backtracking method. I want to sort an input such as "4 2 5 1" which will convert into an array to become " 1 2 4 5" some codes are like below, i tried to build the logic, but it failed to work. public static Node<Integer> sort_it(int[] arr, int fst, i...