Refactor Sudoku solver architecture

sudoku/sudoku.go

@@ -4,21 +4,22 @@ import (
 	"errors"
 	"fmt"
 
-	"git.kleiax.de/homepage/board"
+	"git.kleiax.de/homepage/field"
 	"git.kleiax.de/homepage/logic"
+	"git.kleiax.de/homepage/parser"
 )
 
 type Game struct {
-	field  *board.Field
+	field  *field.Field
 	solver logic.Solver
 }
 
-func New(parser board.Parser, solver logic.Solver, data []byte) (*Game, error) {
+func New(parser parser.Parser, solver logic.Solver, data []byte) (*Game, error) {
 	err := parser.Parse(data)
 	if err != nil {
 		return &Game{}, fmt.Errorf("can not create game: %w", err)
 	}
-	return &Game{solver: solver, field: parser.GetField(0)}, nil
+	return &Game{solver: solver, field: parser.GetField(2)}, nil
 }
 
 func (g *Game) Solve() error {
@@ -43,6 +44,6 @@ func (g *Game) isFinished() bool {
 	return g.field.IsSolved()
 }
 
-func (g *Game) GetField() board.Field {
+func (g *Game) GetField() field.Field {
 	return *g.field
 }