dsasse07

class Sudoku
  attr_accessor :starting_board, :solution, :removed_values, :difficulty

  BLANK_BOARD = [
    [0, 0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0, 0],
    [0, 0, 0, 0, 0, 0, 0, 0, 0],

dsasse07

// puzzleArray is the game board being solved. A 9x9 matrix
// emptyCell = {rowIndex: INT , colIndex: INT } INT = coordinates of currently empty cell
// num = integer value 1-9 being tested

const colSafe = (puzzleArray, emptyCell, num) => {
  return !puzzleArray.some(row => row[ emptyCell.colIndex ] == num )
}

dsasse07

const nextEmptyCell = puzzleArray => {
  const emptyCell = {rowIndex: "", colIndex: ""}

  puzzleArray.forEach( (row, rowIndex) => {
    // If this key has already been assigned, skip iteration
    if (emptyCell.colIndex !== "" ) return 

    // find first zero-element
    let firstZero = row.find( col => col === 0) 
    

dsasse07

// startingBoard is a 9x9 matrix of zeros

const numArray = [1, 2, 3, 4, 5, 6, 7, 8, 9]

const shuffle = array => {
  let newArray = [...array]
  for ( let i = newArray.length - 1; i > 0; i-- ) {
      const j = Math.floor( Math.random() * ( i + 1 ) );
      [ newArray[ i ], newArray[ j ] ] = [ newArray[ j ], newArray[ i ] ];
  }

dsasse07

const safeToPlace = ( puzzleArray, emptyCell, num ) => {
  return rowSafe(puzzleArray, emptyCell, num) && 
  colSafe(puzzleArray, emptyCell, num) && 
  boxSafe(puzzleArray, emptyCell, num) 
}

dsasse07

// puzzleArray is the game board being solved. A 9x9 matrix
// emptyCell = {rowIndex: INT , colIndex: INT } INT = coordinates of currently empty cell
// num = integer value 1-9 being tested

const rowSafe = (puzzleArray, emptyCell, num) => {
  // -1 is return value of .find() if value not found
 return puzzleArray[ emptyCell.rowIndex ].indexOf(num) == -1
}

dsasse07

const newSolvedBoard = _ => {
  startTime = new Date
  
  // Create an unaffiliated clone of a fresh board
  const newBoard = BLANK_BOARD.map(row => row.slice() ) 
  
  // Populate the board using backtracking algorithm
  fillPuzzle(newBoard) 
  return newBoard
}

dsasse07

// puzzleArray is the game board being solved. A 9x9 matrix
// emptyCell = {rowIndex: INT , colIndex: INT } INT = coordinates of currently empty cell
// num = integer value 1-9 being tested

const boxSafe = (puzzleArray, emptyCell, num) => {
  // Define top left corner of box region for empty cell
  boxStartRow = emptyCell.rowIndex - (emptyCell.rowIndex % 3) 
  boxStartCol = emptyCell.colIndex - (emptyCell.colIndex % 3)
  let safe = true

dsasse07

require 'tty-screen'

class String
  def center_align
    screen_width = TTY::Screen.width
    screen_center = screen_width / 2
    string_length = self.length             
    string_center = string_length/2 
    offset = screen_center - string_center 
    "#{sprintf("%#{offset}s" % self)}"

dsasse07

require 'bundler'
Bundler.require

ActiveRecord::Base.establish_connection(adapter: 'sqlite3', database: 'db/development.db')
ActiveRecord::Base.logger = nil

require_relative '../app/tools/funstuff.rb'                 #=> Begin loading files from the bottom of the heirarchy

require_relative '../app/tools/cli_controls.rb'             #=> Step 2 on the heirarchy