Answers.Body: <p>What you are trying to achieve sounds a lot like <a href="https://en.wikipedia.org/wiki/Inductive_logic_programming" rel="nofollow noreferrer">inductive logic programming</a>:</p>
  
  <blockquote>
    <p>Given an encoding of the known background knowledge and a set of examples represented as a logical database of facts, an ILP system will derive a hypothesised logic program which entails all the positive and none of the negative examples.</p>
  </blockquote>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-08-05T03:48:00.593Z
Answers.Text: nice reference! thank you, I'll wait some time before giving you a green tick to look for another answer
Answers.UserDisplayName: malioboro
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-08-05T22:20:31.770Z
Answers.Text: You're welcome. I guess statistical methods, deep learning and all that are more en vogue these days, but once in while it certainly can't hurt to take a look at what various people have done in other fields such as ILP. In particular the class of problems that you are interested in (deterministic, fully observable logic puzzles) should lend itself very well to it.
Answers.UserDisplayName: Jens Classen
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-08-03T17:49:37.877Z
Answers.LastActivityDate: 2019-08-03T17:49:37.877Z
Answers.UserDisplayName: Jens Classen
Body: <p>Some puzzle games have a unique solution that can be solved by deduction rather than guesswork (e.g. <a href="https://en.wikipedia.org/wiki/Slitherlink" rel="nofollow noreferrer">Slitherlink</a>, <a href="https://en.wikipedia.org/wiki/Masyu" rel="nofollow noreferrer">Masyu</a>). Using a computer to solve this puzzle it's pretty easy, we can use a backtracking method to find the best solution in second (in general, the puzzle size is not too big).</p>
  
  <blockquote>
    <p>Is it possible to train a bot to solve this kind of puzzle by deduction?</p>
  </blockquote>
  
  <p>I think by train it to watch a previous step-by-step solution several times the bot can find some <a href="https://en.wikipedia.org/wiki/Slitherlink#Rules_for_squares_with_1" rel="nofollow noreferrer">implicit rules/patterns</a> to solve a specific puzzle. Is this possible? are there any references for this method?</p>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2019-08-02T20:43:13.890Z
Comments.Text: Deductive solutions work by constraining the search space and then executing a suitable search algorithm. As such they are typically solved by describing the puzzle in a notation your solver can read.
Comments.UserDisplayName: Paul Brown
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2019-08-02T20:52:11.377Z
Comments.Text: The alternative is to still describe the problem and use reinforcement learning, which will find good search paths for similar domains.
Comments.UserDisplayName: Paul Brown
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2019-08-05T03:49:03.430Z
Comments.Text: Hi @PaulBrown could you give a more detailed explanation as an answer maybe?
Comments.UserDisplayName: malioboro
Tags: <ai-design><game-ai>
Title: Create an AI to solve a puzzle (by deduction)
UserDisplayName: malioboro
ThreadText: # Create an AI to solve a puzzle (by deduction)
  
  (Asked by: username_0 on 2019-08-02)
  
  Some puzzle games have a unique solution that can be solved by deduction rather than guesswork (e.g. [Slitherlink](https://en.wikipedia.org/wiki/Slitherlink), [Masyu](https://en.wikipedia.org/wiki/Masyu)). Using a computer to solve this puzzle it's pretty easy, we can use a backtracking method to find the best solution in second (in general, the puzzle size is not too big).
  
  > Is it possible to train a bot to solve this kind of puzzle by deduction?
  
  I think by train it to watch a previous step-by-step solution several times the bot can find some [implicit rules/patterns](https://en.wikipedia.org/wiki/Slitherlink#Rules_for_squares_with_1) to solve a specific puzzle. Is this possible? are there any references for this method?
  
  **Tags:** ai-design, game-ai
  
  > **Comments:**
  > **username_1**: Deductive solutions work by constraining the search space and then executing a suitable search algorithm. As such they are typically solved by describing the puzzle in a notation your solver can read.  
  > **username_1**: The alternative is to still describe the problem and use reinforcement learning, which will find good search paths for similar domains.  
  > **username_0**: Hi @username_1 could you give a more detailed explanation as an answer maybe?  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_2 on 2019-08-03. Score: 2 | Accepted answer
  
  What you are trying to achieve sounds a lot like [inductive logic programming](https://en.wikipedia.org/wiki/Inductive_logic_programming):
  
  > Given an encoding of the known background knowledge and a set of examples represented as a logical database of facts, an ILP system will derive a hypothesised logic program which entails all the positive and none of the negative examples.
  
  > **Comments:**
  > **username_0**: nice reference! thank you, I'll wait some time before giving you a green tick to look for another answer  
  > **username_2**: You're welcome. I guess statistical methods, deep learning and all that are more en vogue these days, but once in while it certainly can't hurt to take a look at what various people have done in other fields such as ILP. In particular the class of problems that you are interested in (deterministic, fully observable logic puzzles) should lend itself very well to it.  
  
  ---
  
  