I am working on the Knight’s Tour problem. In my program the user can select a number n equal to 3 or higher. The number will determine the table’s size by n*n in a two-dimensional array. Then the knight will start it’s tour based on the starting points given by the user as long as they are …
Tag: recursion
Recursive Java programming, Knight’s Tour driving me nuts
I’ve been working on a school project and can not figure out the problem. The problem that the knight jumps back where it was in the the last step when a dead end occurs. I’ve added the output for a 4×4 test and you can clarly see that the knight jumps back to turn number 11 when it sees that
How does the recursion of printNStars work?
I don’t understand the output of this recursion. Can someone please help me? (flowchart will definitely help me understand..) Output of the code above: Answer It works in the following way: which can be translated into: there is also an exit rule. If n is 1, don’t draw previous rows. Just print on…
How would I find the length of a linkedlist IN a linkedlist?
I’m trying to go through a linkedlist(which we can call the superlist) which has elements of linked lists(sublists) within it. The method that adds the elements into both linked lists is: Now I have to write methods to check if there are groups of 1, 2, 3, 4 elements in the sublists by traversing the su…
Java – Read files in a directory to a HashMap – recursive
Here below am trying to read fileNames from a nested folder structure into a hashmap, Structure is like HashMap contains “Sub FolderName” as Key & “FileNames”(ArrayList) as value. I’m trying to make a recursive call & save things into HashMap, but missing something in tha…
Coding Bat Recursion exercise (java)
How can I solve this problem recursively instead of using the replace method? I’m trying to get better a recursive methods. Given a string, compute recursively (no loops) a new string where all the lowercase ‘x’ chars have been changed to ‘y’ chars. I cheated and solved it this w…
Can someone help me with this knight’s tour code?
The code seems fine to me, but the output is too short and the answer is no when it should be yes (starting at a,0, the knight should be able to tour the entire board) By the way, the reason my positionsVisted array is [9][9] is because I wanted the values to be 1-8, to match the output. This is
Convert Decimal to Hex using Recursive method Java
I need to make a recursive method that converts a decimal into hexadecimal. I can’t use Integer.toHexString. EDIT:I tried this code but it doesn’t work properly Edit: Changed the default case and the if (n == 0) loop return statement and it works beautifully now. new code: Answer The problem is in…
Java – using recursion to create all substrings from a string
The following code in Java uses recursion to create all possible substrings from a string. I am wondering is there a better way of coding this? I want to use recursion. FAQ Q – Why do I want to do this using recursion? A – Because the CEO of StackOverflow says recursion is important http://www.joe…
Are recursive methods always better than iterative methods in Java? [closed]
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, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, …