Hi, ca anyone suggest idea regarding graph coloring algorithm and how to use it to generate sudoku game
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
Hi, ca anyone suggest idea regarding graph coloring algorithm and how to use it to generate sudoku game
That's not really how this works. Do you have a specific idea in mind? What have you tried? Why are you doing this?
We can answer specific questions about specific code, but we can't really answer general questions like this one, other than to point you to google.
Useful links: How to Ask Questions the Smart Way | Use Code Tags | Java Tutorials
Static Void Games - Play indie games, learn from game tutorials and source code, upload your own games!
My idea -
To mark each number as different color that is there will be 9 colors which can be counted as vertex coloring and than use backtracking and recursive algorithm to generate sudoku.. is it feasible ?
Did you try google? As long as you wade through ALL your crossposts you might find something.
http://www.javaprogrammingforums.com...s-posting.html
And there is at least one easier way to create a Sudoku than a recursive backtracking algorithm