I'm trying to understand the semicolon functionality. I have this code: del(X,[X|Rest],Rest). del(X,[Y|Tail],[Y|Rest]) :- del(X,Tail,Rest). permutation([],[]). permutation(L,[X|P]) :- del(X,L,L...

I am trying to implement a depth first iterative deepening search of a state space graph. I have a graph with three vertices and their are two activating edges and two inhibition edges. Each node h...

I want to write a function in Racket which takes an amount of money and a list of specific bill-values, and then returns a list with the amount of bills used of every type to make the given amount ...

I'm trying to understand backtracking but I'm stuck in this problem, here's the prompt: Given a set of distinct integers, return all possible subsets. Example input: [1,2,3] Example output: [[],...

I need to solve a crossword given the initial grid and the words (words can be used more than once or not at all). The initial grid looks like that: ++_+++ +____+ ___+__ +_++_+ +____+ ++_+++ He...

the reason why I am creating this new thread instead of just reading the answers to this particular question that have been given before is that I feel I just don't fully understand the whole idea ...

Example: sudoku solving with backtracking How do you backtrack without recursion - using loops? I only found solutions when you call backtrack() itself.