Any tips on how to solve this tentaizu problem in C?

Question

1.00/5 (1 vote)

See more:

i need to input a sample tentaizu problem(like "enter tentaizu table: 1 - - - 2 - - (etc.)") and then check if it is a valid tentaizu problem
solve the problem(like "enter location: ") and then check if the desired location is possible for an *

What I have tried:

I just dont know how to check if the table is a valid tentaizu problem

Posted 13-Apr-16 14:42pm

Member 12457875

Updated 13-Apr-16 15:18pm

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Garth J Lancaster · Answer 1 · 2016-04-13T15:18:00

Well, there's a lot you dont tell us - do you have any code at all for example ? how do you store the table ??

My guess is, you would have

- a routine to input table elements
- the ability to store table elements in array 'x by y' elements
- routines to get data from row x column y from the table
- routines to (possibly) look at adjacent cells/examine a row/examine a column
- a routine to validate the puzzle (what you are asking for) built on the above ?
- a routine to solve the puzzle - possibly using backtracking or such

I'm pretty sure that the routine to validate the puzzle would be pretty close to the routine to solve the puzzle and/or you need to inspect 'cells' and adjacent cells to see if they match 'rules' (the rules of tentaizu ie)

tentaizu seems a lot like minesweeper - you may find algorithms if you google for (eg) 'solving minesweeper' that you can apply - ie, is a backtracking or brute-force approach best ?