Solved

algorithm to unlock this problem...

Posted on 2003-11-16
9
296 Views
Last Modified: 2012-05-04
imagine a 4x4 matrix filled with letters, how can i make an algorithm that will give me every possible word ,with four letters, made with the letters of the matrix, knowing that each letter may only associate with ones next to it (imagine mine sweeper) the return values should be in the form of a string per word... preferably a linked list of objects with a string inside or a string array...
if someone could make me the class that would do the job i would be very grateful
(ps: i think its with a Heap, but i cant imagine how)
0
Comment
Question by:omega-t-k
  • 6
  • 3
9 Comments
 
LVL 15

Expert Comment

by:JakobA
Comment Utility
not a class or algorithm, but a bit of logic:

with a 4*4 matrix you ghave 4*4 = 16 letters that may be the first letter
for each of those you can then make 'all possible 4-step paths from there'. there is a limited number of those (permute multiple nsew), though some need to be pruned depending of which of the 16 starting location you begin at (and wheater you permit the path to double back ('ewew').

regards JakobA
0
 

Author Comment

by:omega-t-k
Comment Utility
i know that in teory its quite simple... im not that dum :P the problem is the implementation of the teory... i need an algorithm that does the permutations and belive me it isnt that obvious.. :) imagine trail starting at one of those letters, and each of the letters next to it are possible paths. and for each steap you give you have another number of possible paths... now what i need is an algorithm that wil give me all the 4 letter words that you ca make starting at one letter. i give a starting letter to the imput and the algorithm gives me all the possibilities! in the form of four letter strings... get it? ;)
0
 
LVL 15

Expert Comment

by:JakobA
Comment Utility
I think we can agree that the basis is a recursive function going 4 steps (levels)

a useful support-method would be a  canIGoInThatDirection metod to be called before taking each step. in that method you would collect all the rules (not outside board, not same letter revisited, and maybe more). Dont find same path twice are implicit in the recursion:

take step;
for i = north, south, east, west
     if ( iCanGoInThatDirection ) {
         recurseInThatDirection;
    }
0
 
LVL 15

Expert Comment

by:JakobA
Comment Utility
PS:  the reason I am not more specific is that this is a typical homework problem, intended to teach you logical thinking.
0
Enabling OSINT in Activity Based Intelligence

Activity based intelligence (ABI) requires access to all available sources of data. Recorded Future allows analysts to observe structured data on the open, deep, and dark web.

 

Author Comment

by:omega-t-k
Comment Utility
lol you´re quite right... but belive me... i´ve studied! and the reason i´ve asked for help is because i cant do the complete work because im missing that part,that algorithm... the rest of problem is done... well thnks anyway :) ill leave this open for now and if im not given a better answer, i will accept that one :) it as been some help, althought the coding is strange... im using low-level java and i dont understand the
"for" implementation :/ we use java as if using C "for(bla;bla;bla)"
if you could explain that, i would be gratfull. thanks for the help!
0
 
LVL 15

Expert Comment

by:JakobA
Comment Utility
It is called 'pseudo code', meaning that it is not really code, just thinking that look a bit like code.
an alternative for
  for i = north, south, east, west
would be
  for ( each possible direction )

later it can then be turned into a syntactically correct for statement
0
 
LVL 15

Accepted Solution

by:
JakobA earned 250 total points
Comment Utility
If you make a start and show the code (even if it di not work) we can point out errors and maybe even suggest improvements as long as it is not "handing you the algorithm on a silver platter".

regards JakobA
0
 

Author Comment

by:omega-t-k
Comment Utility
im already on the tracks! and first in the class to do it ;) ive already made the algorithm the rest is simple tnks for the help
0
 
LVL 15

Expert Comment

by:JakobA
Comment Utility
sounds good :)
thanks
0

Featured Post

What Security Threats Are You Missing?

Enhance your security with threat intelligence from the web. Get trending threat insights on hackers, exploits, and suspicious IP addresses delivered to your inbox with our free Cyber Daily.

Join & Write a Comment

INTRODUCTION Working with files is a moderately common task in Java.  For most projects hard coding the file names, using parameters in configuration files, or using command-line arguments is sufficient.   However, when your application has vi…
Introduction This article is the last of three articles that explain why and how the Experts Exchange QA Team does test automation for our web site. This article covers our test design approach and then goes through a simple test case example, how …
Viewers will learn about if statements in Java and their use The if statement: The condition required to create an if statement: Variations of if statements: An example using if statements:
This tutorial covers a practical example of lazy loading technique and early loading technique in a Singleton Design Pattern.

728 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

9 Experts available now in Live!

Get 1:1 Help Now