ilcc-solver/solve.lua at master · CoderPuppy/ilcc-solver · GitHub

Repository navigation

History

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

463

464

465

466

467

468

469

470

471

472

473

474

475

476

477

478

479

480

481

482

483

484

485

486

487

488

489

490

491

492

493

494

495

496

497

498

499

500

501

502

503

504

505

506

507

508

509

510

511

512

513

514

515

516

517

518

519

520

521

522

523

524

525

526

527

528

529

530

531

532

533

534

535

536

537

538

539

540

541

542

543

544

545

546

547

548

549

550

551

552

553

554

555

556

557

558

559

560

561

562

563

564

565

566

567

568

569

570

571

572

573

574

575

576

577

578

579

580

581

582

583

584

585

586

587

588

589

590

591

592

593

594

595

596

597

598

599

600

601

602

603

604

605

606

607

608

609

610

611

612

613

614

615

616

617

618

619

620

621

622

623

624

625

626

627

628

629

630

631

632

633

634

635

636

637

638

639

640

641

642

643

644

645

646

647

648

649

650

651

652

653

654

655

656

657

658

659

660

661

662

663

664

665

666

667

668

669

670

671

672

673

674

675

676

677

678

679

680

681

682

683

684

685

686

687

688

689

690

691

692

693

694

695

696

697

698

699

700

701

702

703

704

705

706

707

708

709

710

711

712

713

714

715

716

717

718

719

720

721

722

723

724

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

786

787

788

789

790

791

792

793

794

795

796

797

798

799

800

801

802

803

804

805

806

807

808

809

810

811

812

813

814

815

816

817

818

819

820

821

822

823

824

825

826

827

828

829

830

831

832

833

834

835

836

837

838

839

840

841

842

843

844

845

846

847

848

849

850

851

852

853

854

855

856

857

858

859

860

861

862

local do_ui = true

local do_single_step = false

local do_debug = false

local progression_mode = 'sleep'

local debug

if do_debug then

function debug(msg, ...)

print(msg:format(...))

end

else

function debug()

end

local types = {

{

variants = {

{

name = 'empty';

display = '\128\128\128|000|000\n\128\128\128|000|000';

connections = {};

};

{

variants = {

{

name = 'up';

display = "\151\143\148|0ff|f00\n\138\140\133|fff|000";

connections = {up = true};

};

{

name = 'right';

display = "\151\140\139|0f0|f0f\n\138\140\135|fff|000";

connections = {right = true};

};

{

name = 'down';

display = "\151\140\148|0ff|f00\n\138\131\133|f0f|0f0";

connections = {down = true};

};

{

name = 'left';

display = "\135\140\148|0ff|f00\n\139\140\133|fff|000";

connections = {left = true};

};

{

variants = {

{

name = 'ur';

display = "\151\143\139|0f0|f0f\n\138\140\135|fff|000";

connections = {up = true; right = true};

};

{

name = 'rd';

display = "\151\140\139|0f0|f0f\n\138\131\135|f0f|0f0";

connections = {right = true; down = true};

};

{

name = 'dl';

display = "\135\140\148|0ff|f00\n\139\131\133|f0f|0f0";

connections = {down = true; left = true};

};

{

name = 'lu';

display = "\135\143\148|0ff|f00\n\139\140\133|fff|000";

connections = {left = true; up = true};

};

{

variants = {

{

name = 'v';

display = "\128\128\128|f0f|0f0\n\128\128\128|f0f|0f0";

connections = {up = true; down = true};

};

{

name = 'h';

display = "\143\143\143|000|fff\n\131\131\131|fff|000";

connections = {left = true; right = true};

};

{

variants = {

{

name = 'tu';

display = "\135\143\139|0f0|f0f\n\139\140\135|fff|000";

connections = {left = true; up = true; right = true};

};

{

name = 'tr';

display = "\151\143\139|0f0|f0f\n\138\131\135|f0f|0f0";

connections = {up=true; right=true; down=true};

};

{

name = 'td';

display = "\135\140\139|0f0|f0f\n\139\131\135|f0f|0f0";

connections = {right=true; down=true; left=true};

};

{

name = 'tl';

display = "\135\143\148|0ff|f00\n\139\131\133|f0f|0f0";

connections = {down=true; left=true; up=true};

};

{

variants = {

{

name = 'q';

display = "\135\143\139|0f0|f0f\n\139\131\135|f0f|0f0";

connections = {up = true; right = true; down = true; left = true};

};

}

types.lookup = {}

local i = 0

for _, typ in ipairs(types) do

for _, var in ipairs(typ.variants) do

var.type = typ

local key =

(var.connections.up and 'T' or 'F') ..

(var.connections.right and 'T' or 'F') ..

(var.connections.down and 'T' or 'F') ..

(var.connections.left and 'T' or 'F')

types.lookup[key] = var

var.conn_key = key

var.char = ('%x'):format(i)

types.lookup[var.char] = var

types.lookup[var.name] = var

i = i + 1

end

local function P(x, y)

return ('%d-%d'):format(x, y)

end

local function offset(dir)

if dir == 'up' then

return 0, -1

elseif dir == 'right' then

return 1, 0

elseif dir == 'down' then

return 0, 1

elseif dir == 'left' then

return -1, 0

else

error('bad dir')

end

local function opposite(dir)

if dir == 'up' then

return 'down'

elseif dir == 'right' then

return 'left'

elseif dir == 'down' then

return 'up'

elseif dir == 'left' then

return 'right'

else

error('bad dir')

end

local function parse(data)

local grid = {}

local w = 0

local x, y = 1, 1

for line in data:gmatch '([^\r\n]+)' do

if line:match '^theme' then

else

x = 1

for char in line:gmatch '.' do

grid[x] = grid[x] or {}

grid[x][y] = types.lookup[char]

x = x + 1

end

w = math.max(w, x - 1)

y = y + 1

end

h = y - 1

grid.w = w

grid.h = h

return grid

end

local function serialize(grid)

local out = ''

for y = 1, grid.h do

for x = 1, grid.w do

out = out .. grid[x][y].char

end

out = out .. '\n'

end

out = out .. 'themef0'

return out

end

local function process_color(c, f, b)

return c:gsub('[f0]', function(s)

if s == '0' then

return b

else

return f

end

end)

end

local function render(disp, f, b)

local x, y = term.getCursorPos()

local upper, lower = disp:match '^([^\n]+)\n(.+)$'

local text, fg, bg = upper:match '^(.-)|(.-)|(.+)$'

term.blit(text, process_color(fg, f, b), process_color(bg, f, b))

term.setCursorPos(x, y + 1)

local text, fg, bg = lower:match '^(.-)|(.-)|(.+)$'

term.blit(text, process_color(fg, f, b), process_color(bg, f, b))

term.setCursorPos(x, y)

end

local function render_dirs(c)

local x, y = term.getCursorPos()

term.blit('\143\143\143', c.tl .. c.tm .. c.tr, c.ml .. c.mm .. c.mr)

term.setCursorPos(x, y + 1)

term.blit('\131\131\131', c.ml .. c.mm .. c.mr, c.bl .. c.bm .. c.br)

term.setCursorPos(x, y)

end

local cmd = ...

local grid

local data = {}

local to_check = {}

local really_done = {}

local selected = {1}

local dirty_render = {}

local dirty = {}

local full_dirty = {}

local function mark_dirty(x, y)

if x <= 0 or x > grid.w or y <= 0 or y > grid.h then

return

end

dirty[P(x, y)] = {x, y}

dirty_render[P(x, y)] = {x, y}

full_dirty[P(x, y)] = {x, y}

end

local function compatible(...)

local cur = nil

for i = 1, select('#', ...) do

local v = select(i, ...)

if cur ~= nil and v ~= nil and cur ~= v then

return false

end

cur = cur or v

end

return true

end

local mark_check

local apply

local function do_apply(x, y, dir, v)

local d = data[P(x, y)]

if not d then return end

if not compatible(d[dir], v) then

error(('mismatch between fixed links at (%d %d) %s have %s applying %s'):format(x, y, dir, d[dir], v))

end

local prev = d[dir]

d[dir] = v

if prev ~= v then

-- debug('dirt (%d %d): apply', x, y)

mark_dirty(x, y)

end

function apply(x, y, dir, v)

if v == nil then return end

do_apply(x, y, dir, v)

local ox, oy = offset(dir)

local odir = opposite(dir)

local od = data[P(x + ox, y + oy)]

do_apply(x + ox, y + oy, odir, v)

mark_check(x + ox, y + oy)

end

local function apply_var(x, y, var)

apply(x, y, 'up' , var.connections.up and 'T' or 'F')

apply(x, y, 'right', var.connections.right and 'T' or 'F')

apply(x, y, 'down' , var.connections.down and 'T' or 'F')

apply(x, y, 'left' , var.connections.left and 'T' or 'F')

end

if cmd:match '^g' then

local _, file, w, h = ...

w, h = tonumber(w), tonumber(h)

grid = {w = w; h = h;}

for x = 1, w do

local col = {}

grid[x] = col

for y = 1, h do

col[y] = types[1].variants[1]

data[P(x, y)] = {}

end

local render_data

local function render_con(v, d)

if d == 'T' then

return 'f' -- black

elseif d == 'F' then

return '0' -- white

else

return '8'

end

-- if v then

-- if d == 'T' then

-- return '5' -- lime

-- elseif d == 'F' then

-- return 'c' -- brown

-- else

-- return 'd' -- green

-- end

-- else

-- if d == 'T' then

-- return '1' -- orange

-- elseif d == 'F' then

-- return 'e' -- red

-- else

-- return 'a' -- purple

-- end

end

function render_data(x, y)

local var = grid[x][y]

local d = data[P(x, y)]

return {

tl = '0';

tr = '0';

bl = '0';

br = '0';

tm = render_con(var.connections.up, d.up);

mr = render_con(var.connections.right, d.right);

bm = render_con(var.connections.down, d.down);

ml = render_con(var.connections.left, d.left);

-- mm = '7'; -- gray

mm =

to_check[P(x, y)] and '2' or -- magenta

really_done[P(x, y)] and (

(d.up == 'T' or d.right == 'T' or d.down == 'T' or d.left == 'T')

and 'f'

or '0'

) or

'7'; -- gray

-- to_check[P(x, y)] and '2' or -- orange

-- really_done[P(x, y)] and 'd' or -- green

-- '7'; -- gray

}

end

function mark_check(x, y)

if x <= 0 or x > grid.w or y <= 0 or y > grid.h then

return

end

local k = P(x, y)

if not really_done[k] and not to_check[k] then

to_check[k] = {x, y}

-- debug('dirt (%d %d): mark check', x, y)

mark_dirty(x, y)

end

local function find_possible(x, y)

local d = data[P(x, y)]

local possible = {}

for _, typ in ipairs(types) do

for _, var in ipairs(typ.variants) do

compatible(d.up, var.connections.up and 'T' or 'F') and

compatible(d.right, var.connections.right and 'T' or 'F') and

compatible(d.down, var.connections.down and 'T' or 'F') and

compatible(d.left, var.connections.left and 'T' or 'F')

then

possible[#possible + 1] = var

end

return possible

end

local co = coroutine.create(function()

for x = 1, grid.w do

apply(x, 1, 'up', 'F')

apply(x, grid.h, 'down', 'F')

end

for y = 1, grid.h do

apply(1, y, 'left', 'F')

apply(grid.w, y, 'right', 'F')

end

mark_check(math.ceil(grid.w / 2), math.ceil(grid.h / 2))

-- mark_check(math.ceil(grid.w / 4), math.ceil(grid.h / 2))

-- mark_check(math.ceil(3 * grid.w / 4), math.ceil(grid.h / 2))

-- mark_check(math.ceil(grid.w / 2), math.ceil(grid.h / 4))

-- mark_check(math.ceil(grid.w / 2), math.ceil(3 * grid.h / 4))

while true do

dirty = {}

coroutine.yield()

local any = false

local check_t = to_check

to_check = {}

for pk, p in pairs(check_t) do

really_done[pk] = p

end

for pk, p in pairs(check_t) do

debug('(%d %d)', p[1], p[2])

any = true

local d = data[pk]

local possible = find_possible(p[1], p[2])

if #possible == 0 then

error('bad')

end

local var = possible[math.random(#possible)]

grid[p[1]][p[2]] = var

apply_var(p[1], p[2], var)

if do_single_step then

coroutine.yield()

end

if not any then

for x = 1, grid.w do

local col = grid[x]

for y = 1, grid.h do

local vars = col[y].type.variants

col[y] = vars[math.random(#vars)]

end

break

end

end)

if do_ui then

term.setCursorBlink(false)

term.clear()

-- this fixes Termu not rendering stuff properly

local w, h = term.getSize()

for y = 1, h do

term.setCursorPos(1, y)

term.blit(('y'):rep(w), ('a'):rep(w), ('7'):rep(w))

end

for x = 1, grid.w do

for y = 1, grid.h do

term.setCursorPos(x * 3 - 2, y * 2 - 1)

render_dirs(render_data(x, y))

end

while coroutine.status(co) ~= 'dead' do

if do_step then

os.pullEvent('mouse_click')

end

local ok, err = coroutine.resume(co)

if do_ui then

for pk, p in pairs(dirty_render) do

term.setCursorPos(p[1] * 3 - 2, p[2] * 2 - 1)

render_dirs(render_data(p[1], p[2]))

end

dirty_render = {}

if not ok then

error(err)

end

if do_ui then

term.clear()

term.setCursorPos(1, 1)

end

local h = fs.open(shell.resolve(file), 'w')

h.write(serialize(grid))

h.close()

elseif cmd:match '^s' then

local h = fs.open(select(2, ...), 'r')

grid = parse(h.readAll())

h.close()

end

for x = 1, grid.w do

for y = 1, grid.h do

data[P(x, y)] = {}

end

local new_check = {}

local path = {}

local render_data

local function render_con(v, d)

if d == 'T' then

return 'f' -- black

elseif d == 'F' then

return '0' -- white

else

return '8'

end

-- if v then

-- if d == 'T' then

-- return '5' -- lime

-- elseif d == 'F' then

-- return 'c' -- brown

-- else

-- return 'd' -- green

-- end

-- else

-- if d == 'T' then

-- return '1' -- orange

-- elseif d == 'F' then

-- return 'e' -- red

-- else

-- return 'a' -- purple

-- end

end

function render_data(x, y)

local var = grid[x][y]

local d = data[P(x, y)]

return {

tl = '0';

tr = '0';

bl = '0';

br = '0';

tm = render_con(var.connections.up, d.up);

mr = render_con(var.connections.right, d.right);

bm = render_con(var.connections.down, d.down);

ml = render_con(var.connections.left, d.left);

-- mm = '7'; -- gray

mm =

really_done[P(x, y)] and (

(d.up == 'T' or d.right == 'T' or d.down == 'T' or d.left == 'T')

and 'f'

or '0'

) or

to_check[P(x, y)] and '2' or -- magenta

new_check[P(x, y)] and 'a' or -- purple

'7'; -- gray

-- to_check[P(x, y)] and '2' or -- orange

-- really_done[P(x, y)] and 'd' or -- green

-- '7'; -- gray

}

end

local function clone(t, c)

c = c or {}

if c[t] then

return c[t]

elseif type(t) == 'table' then

local n = {}

c[t] = n

for k, v in pairs(t) do

n[clone(k, c)] = clone(v, c)

end

setmetatable(n, getmetatable(t))

return n

else

return t

end

local function find_possible(x, y)

local typ = grid[x][y].type

local d = data[P(x, y)]

local possible = {}

for _, var in ipairs(typ.variants) do

compatible(d.up, var.connections.up and 'T' or 'F') and

compatible(d.right, var.connections.right and 'T' or 'F') and

compatible(d.down, var.connections.down and 'T' or 'F') and

compatible(d.left, var.connections.left and 'T' or 'F')

then

possible[#possible + 1] = var

end

return possible

end

local function bad(msg)

if #path > 0 then

local rollback = path[#path]

path[#path] = nil

for k, v in pairs(full_dirty) do

dirty[k] = v

dirty_render[k] = v

end

data = rollback.state.data

to_check = rollback.state.to_check

really_done = rollback.state.really_done

full_dirty = rollback.state.full_dirty

selected[#selected] = nil

selected[#selected] = selected[#selected] + 1

else

error(msg)

end

function mark_check(x, y)

if x <= 0 or x > grid.w or y <= 0 or y > grid.h then

return

end

local k = P(x, y)

if not really_done[k] and not to_check[k] and not new_check[k] then

new_check[k] = {x, y}

-- debug('dirt (%d %d): mark check', x, y)

mark_dirty(x, y)

end

local co = coroutine.create(function()

for x = 1, grid.w do

mark_check(x, 1)

apply(x, 1, 'up', 'F')

mark_check(x, grid.h)

apply(x, grid.h, 'down', 'F')

end

for y = 1, grid.h do

mark_check(1, y)

apply(1, y, 'left', 'F')

mark_check(grid.w, y)

apply(grid.w, y, 'right', 'F')

end

while true do

if not next(dirty) then

-- nothing changed but it's not done

local all = {}

for pk in pairs(to_check) do

all[#all + 1] = pk

end

table.sort(all)

local x, y = all[1]:match '^(%d*)-(%d*)$'

x, y = tonumber(x), tonumber(y)

local possible = find_possible(x, y)

debug('(%d %d) has %d possiblities', x, y, #possible)

local copy = clone {

data = data;

to_check = to_check;

really_done = really_done;

full_dirty = full_dirty;

}

path[#path + 1] = {

state = copy;

x = x; y = y;

possible = possible;

}

local i = selected[#selected]

selected[#selected + 1] = 1

apply_var(x, y, possible[i])

end

dirty = {}

coroutine.yield()

local finished = {}

local any = false

for pk, p in pairs(to_check) do

any = true

local typ = grid[p[1]][p[2]].type

local d = data[pk]

local possible = find_possible(p[1], p[2])

if #possible == 1 then

apply_var(p[1], p[2], possible[1])

finished[pk] = p

elseif #possible > 1 then

local none = {

up = 'F';

right = 'F';

down = 'F';

left = 'F';

}

local all = {

up = true;

right = true;

down = true;

left = true;

}

for _, possible in ipairs(possible) do

for dir in pairs(possible.connections) do

none[dir] = nil

end

local rm_all = {}

for dir in pairs(all) do

if not possible.connections[dir] then

rm_all[dir] = true

end

for dir in pairs(rm_all) do

all[dir] = nil

end

for dir in pairs(none) do

apply(p[1], p[2], dir, 'F')

end

for dir in pairs(all) do

apply(p[1], p[2], dir, 'T')

end

else

bad(('no possible variants at (%d %d)'):format(p[1], p[2]))

end

if do_single_step and dirty[pk] then

coroutine.yield()

end

for pk, p in pairs(finished) do

to_check[pk] = nil

really_done[pk] = true

mark_dirty(p[1], p[2])

end

for pk, p in pairs(new_check) do

any = true

to_check[pk] = p

mark_dirty(p[1], p[2])

end

new_check = {}

if not any then

break

end

end)

if do_ui then

term.setCursorBlink(false)

term.clear()

-- this fixes Termu not rendering stuff properly

local w, h = term.getSize()

for y = 1, h do

term.setCursorPos(1, y)

term.blit(('y'):rep(w), ('a'):rep(w), ('7'):rep(w))

end

for x = 1, grid.w do

for y = 1, grid.h do

term.setCursorPos(x * 3 - 2, y * 2 - 1)

render_dirs(render_data(x, y))

end

while coroutine.status(co) ~= 'dead' do

if progression_mode == 'click' then

os.pullEvent('mouse_click')

elseif progression_mode == 'sleep' then

sleep(0.5)

end

local ok, err = coroutine.resume(co)

if do_ui then

for pk, p in pairs(dirty_render) do

term.setCursorPos(p[1] * 3 - 2, p[2] * 2 - 1)

render_dirs(render_data(p[1], p[2]))

end

dirty_render = {}

if not ok then

error(err)

end

if do_ui then

term.clear()

term.setCursorPos(1, 1)

end

else

error('Unknown command: ' .. cmd, 0)

end

ilcc-solver/solve.lua at master · CoderPuppy/ilcc-solver · GitHub

Repository navigation

Expand file tree

Breadcrumbs

solve.lua

Latest commit

History

Breadcrumbs

solve.lua

File metadata and controls