Comparing Characters Of A Word To Puzzle Board - Diagonal Search Algorithm
Feb 7, 2015
Coding (must follow pseudocode algorithm provided) for comparing characters of a word to a puzzle board char[][].
I've gotten the horizontal and vertical searches to work, but I'm having a difficult time figuring out how to search diagonally.
Here's the search algorithm format I have to use:
for each guess word
for each letter of the puzzle
for each letter of the guess word
check for diagonal match
if found, add word to list, break to next guess
I'm assuming there should be a +1 horizontal offset after I find the first letter, but every index I've bumped has caused me to screw up my array bounds. I'm missing something.
Here's the algorithm I'm using for diagonal search. This same algorithm worked for vertical search (minus the offset of course)
//diagonal search
for(String word : guessWords) {//for each guess word
int letterCount = 0;
int index = 0;
for(int j=0; j<grid[index].length; j++) {//for each puzzle letter
I have been working on a program that takes in a 2d array (there is a method to convert to 1d as necessary) and uses it as an 8 puzzle, which the program then solves (if it is solvable) using the A* Search algorithm, outputting each solution move. It needs error checkers/traps/exception handlers, and be able to create an 8 puzzle from user input, create an 8 puzzle from file input, and create an 8 puzzle from file input and then output to another file the solution move sequence. I have gotten nearly everything done except for implement the algorithm itself and the methods for handling input from files or output to files (the input/output file methods are a minor problem that I can probably solve fairly easily, I just want to be able to test the a* with the puzzle created from user input first.
I have taken several cracks at it, but I am not really good with Java in this type of situation and this is hurting me a lot. I have put in a method to determine if a puzzle is solvable, but the A* algorithm still eludes me. I understand the concept of the algorithm, you have a heuristic function, a cost function (each move equals 1 in this case), and you add the two together to get f(n), choosing the move that will get you the closest to your goal (best first search basically). here is what I have so far that works:
import java.io.File; import java.io.IOException; import java.util.Queue; import java.util.Scanner; public class Puzzle { public static void main(String[] args) throws IOException {
[Code] ....
I have it outputting things to make sure all that works already, I have all the error handlers, but I think that before I can even implement the A*search algorithm, there may be something else I need. Conceptually, I understand I need Nodes, States and Stacks, and Queues (I think, I am not sure about this), but with the way my code has been made so far, I am not sure how to implement those and then implement them with the A* algorithm. What I should do next? I have looked at the code of other uses of A* algorithm(that is how I found out I might need Java data structures like queue and stack and list), but I am not sure exactly where to go to from where I am.
I have a simple Word Program here called PuzzleGame.java. It works perfectly but I wanted to add some bells and whistles to it. So I want to be able that if the user selects the same letter more than once a message comes up letting the user know that "That letter has already been selected, try another letter."
I am certain that if would go in the 'else' of the 'if( )' that I am providing.
import java.util.Scanner; public class PuzzleGame { public static void main(String[] args){ String secretPhrase = "BIG JAVA"; String guesses = " ";
[Code] .....
I am thinking maybe after the else in this if statement.
if(guesses.indexOf(secretLetter)== -1) { System.out.print("-"); notDone = true; } else { //something here. I am not sure how to go about it. System.out.print(secretLetter); }
package bin; import java.util.Scanner; public class AppletMain{ public static void main(String[] args){ Scanner oneinput = new Scanner(System.in); String one;
[Code] ....
I am trying to get it to compare the word I type in to the set word in the object 'secretword'. I have tried everything from equal to == to compareTo, I even created a two hundred line program to do this SIMPLE problem.
I post the code I'm developing for a tetris-based characters. The problem I have is that I can't print the piece within the board. I haven't any error.
Class Piezas
Java Code:
public class Piezas {
public Piezas() {} //atributos private int i; private int j; private char m[][]; private int formaPieza;
I am trying to make a program that compares the 3 different search algorithms(sequential/binary/hashing). I have already made the sequential search algorithm, binary and hashing part of the code.My program OPENS a data file, and then OPENS a key data file. and then searches through them using both. How to go about the binary and hashing search algorithm (in the driver program).
*I have included a zip file with: -base program -driver program -data file -key data file
I am using what is known as a Depth First Search to solve a maze using my own Stack created class for an assignment. The reason I believe I am getting this error is because my program is never meeting the `finishSpot` condition. I have used the debugger and it looks like it is infinitely stuck at the Point before the `finishSpot`. My logic seems to be mostly correct except until the point where my maze solver tries to finish the maze.
This is a sample maze:
***** *s* * * * * * f* *****
Here is my Main which uses my created Stack class.
//Creates a Stack and determines the start and endpoints. public static void solveDFS( char [][] maze ){ LinkedStack stack = new LinkedStack(); Point currentSpot = findPoint( maze,'s' ); Point finishSpot = findPoint( maze, 'f' ); findPath( maze,currentSpot, finishSpot,stack );
I am using what is known as a Depth First Search to solve a maze using my own Stack created class for an assignment. The reason I believe I am getting this error is because my program is never meeting the `finishSpot` condition. I have used the debugger and it looks like it is infinitely stuck at the Point before the `finishSpot`. My logic seems to be mostly correct except until the point where my maze solver tries to finish the maze, so i just need meeting that last condition that is causing my program to crash.
This is a sample maze:
***** *s* * * * * * f* *****
Here is my Main which uses my created Stack class.
//Creates a Stack and determines the start and endpoints. public static void solveDFS( char [][] maze ){ LinkedStack stack = new LinkedStack(); Point currentSpot = findPoint( maze,'s' ); Point finishSpot = findPoint( maze, 'f' ); findPath( maze,currentSpot, finishSpot,stack );
[Code] ....
I made a mistake it says my program is crashing which it is not, but simply not meeting the condition.
This was my initial question: I am confused as to why this won't return the desired value. I keep running into an infinite loop or data is returned that I searched.
I still need to work on whether a user enters a search that doesn't exist......that is where I am stuck....
code has been updated......
int low = 0; int high = subArray.length; while (low < high) { System.out.println("You have entered the while loop"); int mid = (low + high) / 2;
Is there a way that I can save a binary search algorithm to a text file or something, so that it will always contain more information? The reason why I ask this is because I have BST like project which is supposed to act the game Twenty Questions, were it asks a person 20 Q's until it guess the answer. However, although my project does not require you to save stuff to a file, I find it rather very useful and cool if I could do that.So for example it would start out something like this:
Think of an animal and I will guess it. Does it have legs? YES Is it a cat? YES I win! Continue? YES
Think of an animal and I will guess it. Does it have legs? NO Is it a snake? YES I win! Continue? YES
Think of an animal and I will guess it. Does it have legs? NO Is it a snake? NO I give up. What is it? EARTHWORM Please type a question whose answer is yes for an earthworm and no for a snake. DOES IT LIVE UNDERGROUND? Continue? YES
Think of an animal and I will guess it. Does it have legs? NO Does it live underground? NO Is it a snake? NO I give up. What is it? FISH Please type a question whose answer is yes for an earthworm and no for a snake. DOES IT LIVE IN WATER? Continue? NO Good-bye.
However, if the user exits the program then everything will be lost and go to waste. So once again, is there a way that I can save all of these inputs to a file or something and then read it in again?
Okay, so the assignment was creating a word search for the given array. I've created all the code necessary, but I've ran into trouble. This problem occurs with the Up-Forward, Up-Backward, Down-Forward, and Down-Backward sections. If I only set one of these to run, it works. But if I have all 4 set at the same time, it errors out on the first one that runs.
public class P_WordSearch { public static void main(String[] args) { char[][] puzzle = { {'B','O','O','G','S','R','O','W','I','N','G'}, {'E','B','L','G','N','I','M','M','I','W','S'}, {'L','C','E','A','T','I','P','U','P','I','S'}, {'C','M','I','N','C','A','X','Y','O','S','N'},
I need a java code to search a certain word from the text file. the word that i want to search is in other text file. and finally the output will print the result in the new text file. for the example the text file name data.txt and the word list in the wordlist.txt and the output will print filter.txt.
Is there a method to search a single word or a phrase in an web page? And maybe when it have found the word it say me the line and the number of the character where the word or the phrase begin.
Consider in a Document if a String " Hello" is Encoded and stored as "XYZAB"
I want to search the text on document for a word "Hello" and Replace the word with "HelloWorld"
The Program will encrypt the word "Hello" and Search the file then return the encrypted code as "XYZAB" Found
Now i have to replace the word "Hello" with "HelloWorld" in encrypted form so that the Letter "XYZABEFGHI" is replace in the place of Hello where "World" is encoded as "EFGHI"
Now the Problem is If there is more number of occurrence of the word "Helloworld" exist in the file... How can i Replace only one particular occurrence What can be done to select the particular occurrence.
I have attached my java program for Encryption along with this mail for your ease of use.
I am just trying to move a rectangle in a diagonal line. When the applet pops up, the rectangle is there but doesn't move. If I drag the sides of the applet to make it bigger or smaller the rectangle will redraw itself and move, but I want it to move without touching the window.
I am trying to make a puzzle game in java.I have made it successfully.But the problem is,when it starts its already solved.I want it to start unsolved so the user can solve it.My code is:
I need to make a program that does stripes, checkerboard, and double diagonal. I can not get the stripes to work?
import java.util.Scanner; public class AsciiArt { public static void main(String[] args){ int pattern; Scanner input=new Scanner(System.in); System.out.println("Choose one of the following patterns by pressing the corresponding number"); System.out.println("1) Stripes");
The area of a square is stored in a double variable named area . Write an expression whose value is length of the diagonal of the square. Do I use math.sqrt?
When I add the first car only, it puts it in the correct spot and I can move it correctly. However when I attempt to add another car, the image of the second car repaint itself onto the first one, and the second car is not functioning at all (not moving)...
I have built a binary tree, from a file. In each node, I am storing each word as a string, and an int frequency for each time the word occurs. For the assignment, I need to find how many words occur only once in the file. I wrote the program, but for some reason I am getting a number different from what my professor is expecting.
As far as I know, this file has loaded into the tree correctly, because all of my other answers in the assignment are correct. What am I doing wrong?
public void findUnique() { System.out.println("There are " + findUniqueWords(root, 0) + " unique words."); } private int findUniqueWords(Node subTree, int uniqueCount) { // Base Case: At the end of the branch if(subTree == null){ return uniqueCount;
The intentions of this program is to prompt a user to enter a file name, and then reads the file. The program will prompt the user to enter a word that needs to be corrected. So lets say I have a text file containing "My name is OP and I Like goind to the Park!" I want to change "goind" to "going",
Now, my second method "isSimilar" executes a similar word with more than one same letter and same length, but I dont know how to execute that whole thing in my third method "correctThisLine" . How I can call that isSimilar method and read in that text file and change that word into that?
import java.util.*; import java.io.File; import java.io.FileNotFoundException; import java.util.Scanner; public class WahidMuhammadA3Q2{ String fileName = "AutoCorrectMe.txt"; public static void main (String [] args){
I am looking for java codes to generate a word document based on a word template, basically, I have a word template created and in my local path, the template has a proper format with some fields which will be filled in after java codes ran. The java codes will fetch one record from a table, and open the word template and then fill the fields in the word template, and created a new word document and save it in another folder.
I found this example: [URL] which is similar except it uses xml template instead of word template, how to make it work to change the template from xml to word (docx) template?
import java.io.*; import java.util.Random; import java.util.Scanner; public class WordGame { public static void main(String[] args) throws IOException { final int RANDOM_LETTERS_COUNT = 10; final int TRIALS = 10; int score = 0;
