Back to Results
First PageMeta Content
Games / Nikoli / Constraint satisfaction / Puzzle / Slitherlink / Sudoku / Local consistency / Backtracking / Hashiwokakero / Logic puzzles / Mathematics / Theoretical computer science


Deductive Search for Logic Puzzles Cameron Browne Imperial College London South Kensington, UK [removed] Abstract—Deductive search (DS) is a breadth-first, depthlimited propagation scheme for the constraint-bas
Add to Reading List

Document Date: 2014-04-28 03:05:59

Open Document

File Size: 362,21 KB

Share Result on Facebook

City

Tokyo / Fribourg / Berlin / Kent / London / New York / Fort Lauderdale / Oxford / /

Company

Challenge OY / George Allen & Unwin Ltd / Nikoli / Xi / McGraw-Hill / the Times / /

Country

Germany / United States / United Kingdom / /

/

Event

Business Partnership / /

Facility

Logic Puzzles Cameron Browne Imperial College / /

IndustryTerm

i5 processor / deeper embedded search / search status / easier solution / possible solution / 1LoE solution / arbitrary search depths / valid solution / deductive search / near-complete solutions / natural language processing / web site5 / search recurses / broader search / search depth / /

Organization

Oxford Univ. / Stanford / /

Person

Angela Janko / Otto Janko / Daniel Mitchell / Stephen Tavener / /

Position

Scientist / vol / Single player / representative / player / /

Product

DS / /

PublishedMedium

The Games Journal / The Nikoli / the The Times / the Times / Nikoli / /

Technology

natural language processing / artificial intelligence / CSP algorithms / DPLL algorithm / DS algorithm / i5 processor / /

URL

http /

SocialTag