I have been asked to solve a Cryptarithmetic Puzzle using Prolog: GIVE * ME ------ MONEY The above is the puzzle, I cannot figure out where is the problem, the result always returns false. Plus I
for example, if N is 2, it will create list following and set his value L =开发者_开发知识库 [S1,S2],
I am learning Prolog and difference lists are super new to me and looks like from hell, especially that I am definitely poor simple-minded C++ guy :)
hello everyone pls forgive any misuse of the language i need to create myPermutation(L1,L2). which given a list L1 (which has elements with many concecutive appearances)returns a list L2 which is L1
I\'m just trying to figure out constraint programming in SWI-Prolog, looking at this tutorial : http://en.wikibooks.org/wiki/Prolog/Constraint_Logic_Programming
How can I delete the first N elements from a list in Prolog? How can I get the first N elements from a list into another list?
I\'m doing a piece of university coursework, and I\'m stuck with some Prolog. The coursework is to make a really rudimentary Watson (the machine that answers questions on Jeapoardy).
What is the most efficient way to represent two dimensional arrays in prolog? I thought of one long list or list of lists, but they have linear access time which seems to be too slow for my problem. I
I want a function that will take two lists A and B and return lists Aout and Bout, such that elements from the beginning of A up to a given element (say the atom \'a\') have been removed and appended
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references,or expertise, but this question will likely solicit debate, a
加载中,请稍侯......