Given an N by N Boggle Grid, what is the equation to find how many possible words or how many paths there are on the Grid to check to see if it's a word? Example: 2x2 grid = 64, 3x3 grid=10305, 4x4 grid = 12029640, NxN grid =?
-
I have created a Java program to find all possible words already so I put a counter inside the code to get the total number of possible paths to look at to see if it's a word. Rather than using a computer to do the counting for me, how can I find the equation out for a NxN size grid?
-
Answer:
As of 2014, this is an open problem in combinatorics that is unsolved for grids 5x5 or greater. UPDATE: As of February 12, 2014, Jelani Nelson, a professor at Harvard University, has computed the 5x5 grid to have 115066382913 paths.
Jaimal Ichharam at Quora Visit the source
Related Q & A:
- How many U.S. presidents have not had a college degree?
- How can I find out how many GBs I use a month on Internet?Best solution by Yahoo! Answers
- How many stamps does it currently take to send a letter from the U.S. to Canada?
- How can I see how many words I've typed?Best solution by libroediting.com
- Is there a way to find out how many people are on eBay?Best solution by hotukdeals.com
Just Added Q & A:
- How many active mobile subscribers are there in China?Best solution by Quora
- How to find the right vacation?Best solution by bookit.com
- How To Make Your Own Primer?Best solution by thekrazycouponlady.com
- How do you get the domain & range?Best solution by ChaCha
- How do you open pop up blockers?Best solution by Yahoo! Answers
For every problem there is a solution! Proved by Solucija.
-
Got an issue and looking for advice?
-
Ask Solucija to search every corner of the Web for help.
-
Get workable solutions and helpful tips in a moment.
Just ask Solucija about an issue you face and immediately get a list of ready solutions, answers and tips from other Internet users. We always provide the most suitable and complete answer to your question at the top, along with a few good alternatives below.