Stack Overflow
Stack Overflow

Questions tagged [boggle]

Boggle is a word game that is played using a plastic grid of lettered dice, in which players attempt to find words in sequences of adjacent letters. Do not use this tag if you are boggled trying to find a solution, use this only for questions related to the game Boggle or something similar to finding words from letters on connected vertices on a graph.

Boggle™ is a word game designed by Allan Turoff and originally distributed by Parker Brothers. The game is played using a plastic grid of lettered dice, in which players attempt to find words in sequences of adjacent letters.

For example the word super:

enter image description here

Instructions

Because of the simplicity of the game and reasoning needed to model solutions to the game in software, it is popular as a learning exercise or homework. There are thousands of repositories on GitHub for Boggle™

References

89 questions
2
votes
1 answer

Making my dictionary search more efficient

I created a boggle solver in Java and it takes around a minute and 30 seconds to solve a board and I'm convinced its because of the way I traverse through my dictionary. The idea is it checks to see if its a word and also to see if it is a valid…
Louis B
  • 342
  • 1
  • 5
  • 21
2
votes
1 answer

C++: Recursive backtracking boggle grid

I realize this code might be a bit dense to read, what I´ve tried to do is to adapt a standard recursive maze-solving algorithm - where all directions are tried until a solution is found, to an algorithm for the game 'boggle' that checks if the…
Tom Lilletveit
  • 1,872
  • 3
  • 31
  • 57
2
votes
3 answers

Optimize this recursive function [Boggle resolver]

I realized a recursive function to solve this problem: With a 4x4 Matrix composed of letters (A...Z), for every letter get all the n-lenght words by following only adiacent and diagonal cells. My function's idea is to do a recursive call for every…
Francesco Bonizzi
  • 5,142
  • 6
  • 49
  • 88
2
votes
3 answers

Python boggle game

I'm trying to finish this boggle game Python challenge for school, and I've created a draw board function that creates a board with 16 random letters. How do I use a def function to ask the user to input a word and then score it, depending on how…
user1655562
  • 81
  • 2
  • 8
1
vote
1 answer

get all words combinations and path from letters arry

I create a boogle game, and I need to build a function that receives in input: the letter board (list of lists), the list of legal words and an integer n. The function must return all n-length tracks of valid words. For example n = 3 then the…
user19095412
1
vote
1 answer

Check if a word already guessed or inputted

I am trying to make a word search game in C, of which a user will guess/input a word and the program will check if the word is existing and valid. How can I check if the word inputted by a user is already printed/inputted? I'm really confused if…
Paul Romeo Despuig
  • 25
  • 3
1
vote
4 answers

Picking random chars from char array?

I'm very new to C++ and have a pretty daunting assignment due this week. I won't get into too much detail about it as I don't want work done for me, but can anyone point me in the right direction as to how I would go about picking random characters…
John B
  • 109
  • 8
1
vote
1 answer

How to recursively check an answer in a boggle type game

As an exercise, I have been trying to build a non-GUI boggle type game in python. So far, the user is able to enter a board size (4x4,5x5,etc). The 'array' of letters appears and then the user may type in a word that they think is a valid option. …
Gitarooman
  • 97
  • 1
  • 2
  • 9
1
vote
1 answer

Creating Boggle game - linking coordinates to letters

There is a 4x4 board with a total of 16 letters. In this array [2,1] represents the letter in the third row, second column. const coordPairs = [ [ [2, 1], [4, 1] ] [ [4, 0], [4, 1], [4, 2], [4, 3] ] [ [0, 0], [0, 1], [0, 2] ], [ [1, 0], [3,…
kalecrush
  • 71
  • 3
  • 8
1
vote
1 answer

In ANSI C, how can I make a timer?

I'm making the game Boggle in C for a project. If you're not familiar with Boggle, that's okay. Long story short, there's a time limit on each round. I'm making the time limit 1 minute. I have a loop that displays the game board and asks the user to…
brann22
  • 13
  • 3
1
vote
1 answer

Deploying a Heuristic to Prune search space in a Boggle.java Game

So, I am trying to write a java program that emulates the game Boggle. It inputs two text files, the first being a text file representing the nxn board where the first line contains the dimensions of the board, i.e. a 4x4.txt file's first line will…
DylanG1991
  • 101
  • 1
  • 3
  • 11
1
vote
0 answers

How to generate an "adjacency matrix" dynamically depending on grid size?

I am doing a BoggleBoard game for a coding bootcamp that includes a function to take words and check if they exist on the board. My method in checking to see if the word existed was to create what I called an "adjacency matrix" (I understand that…
michjo
  • 407
  • 2
  • 17
1
vote
0 answers

Programming for a Boggle Search

A question came up where I had to make a recursive boggle search. I've done similar programs (like wordsearches, mazes, connect4, etc.) but can't get this one to work. I can't tell you exactly what errors pop up (as most of the time the word is…
Marz
  • 11
  • 2
1
vote
0 answers

Algorithm - Fill matrix with list of words with gravity

I'm trying to make an algorithm to fill a list of given words in a square matrix where letters amount is equal to matrix size. The trick here is that you should be able to connect each word (each letter with the letter after him in the same word)…
AbdulHadi Yasin
  • 73
  • 11
1
vote
1 answer

Boggle - count all possible paths on a N*N grid. Performance

While reading up this question, I wondered why no one would "simply" iterate all the possible paths on the boggle grid and have the word-tries follow and then cancel the path if there is no match in the word-trie. Cannot be that many paths on a tiny…
BitTickler
  • 10,905
  • 5
  • 32
  • 53
1
2
3 4 5 6