Hack a Day Menu
  • Projects
  • Lists
  • Contests
  • Stack
  • More
    • Blog
    • Events
    • Hackerspaces
    • Profiles
    • 2019 Prize Entries
    • Tindie Marketplace
    • Jobs Board
  • Sign up
  • Log In
Close
0%
0%

Constrained Sudokuo Algorthim

valid Sudoku grids and puzzles following a shift(L) language. ANY n2 by n2 can be generated. However, they are limited subsets!

Tea BTea B
Following Follow project
Liked Like project

Become a Hackaday.io member

Not a member? You should Sign Up.

Already have an account? Log In.

Sign up with Github
Sign up with Twitter OR
Forgot your password?

Just one more thing

To make the experience fit your profile, pick a username and tell us what interests you.

Pick an awesome username
hackaday.io/
Your profile's URL: hackaday.io/username. Max 25 alphanumeric characters.
Pick a few interests
Projects that share your interests
People that share your interests

We found and based on your interests.

Choose more interests.

OK, I'm done! Skip
Join this project
Similar projects worth following
95 views
0 comments
0 followers
0 likes
  • Description
  • Details
  • Files 5
    • View all
  • Components 0
  • Logs 0
  • Instructions 0
  • Discussion 0
View Gallery
95
0
0
0

Team (1)

  • Tea BTea B

Join this project's team
  • Reddit Post explaining Algorthim
ongoing project
python computers Circuits programming pvsnp ALGORITHMS GRIDS

This project was created on 04/29/2019 and last updated 4 months ago.

Description

I have created an algorithm that generates n2*n2 Sudoku Grids and Puzzles(by removing elements) and provides their solutions without backtracking. I have managed to use a sat-solver for Sudoku Puzzles and converted my complete grid and puzzles into CNF formulas.I've tried an attempt at reducing CNF (which is np-complete) to my algorthim for 9x9 grids. The verifier says the boolean formula is correct. Due to its length I will upload it. .Here's a link to the specifics of the
algorithm.https://www.reddit.com/r/computerscience/comments/bidatb/shiftl_language_is_in_np_or_p/

Details

Files

sudokusat.txt

plain - 3.49 kB - 05/27/2019 at 19:56

Download

dimacs.txt

3 x 3 unsat instance

plain - 695.00 bytes - 05/27/2019 at 19:37

Download

output.txt

>:) Generates in poly-time

plain - 5.03 kB - 05/24/2019 at 23:55

Download

co-np.txt

plain - 683.00 bytes - 05/04/2019 at 01:26

Download

Constrained.txt

CNF formula of one of my complete grids.

plain - 147.65 kB - 04/29/2019 at 18:31

Download

Enjoy this project?

Share

Discussions

Log In/Sign up to comment

Become a Hackaday.io Member

Create an account to leave a comment. Already have an account? Log In.

Sign up with Github
Sign up with Twitter OR

Similar Projects

108
1
2
I've been wanting to do an all nail project . Also, this is an all reuse recycle free pile project.
Project Owner Contributor

Bike Shed in reuse wood and nails

Jerome.MunroeJerome.Munroe

70
2
2
Make your own Electric Motorized Shoes / Skating at Home
Project Owner Contributor

DIY Motorized Shoes

Navin KhambhalaNavin Khambhala

1.2k
7
6
An effort to decipher MIDI disks from the 1990s
Project Owner Contributor

Hacking Yamaha Disklavier Floppies

Tom NardiTom Nardi

Does this project spark your interest?

Become a member to follow this project and never miss any updates

Going up?

About Us Contact Hackaday.io Give Feedback Terms of Use Privacy Policy Hackaday API

© 2019 Hackaday

Yes, delete it Cancel

Report project as inappropriate

You are about to report the project "Constrained Sudokuo Algorthim", please tell us the reason.

Send message

Your application has been submitted.

Remove Member

Are you sure you want to remove yourself as a member for this project?

Project owner will be notified upon removal.