About: Induction puzzles

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Induction puzzles Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Subject106599788, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/c/7rwdfVzeq2

Induction puzzles are logic puzzles, which are examples of multi-agent reasoning, where the solution evolves along with the principle of induction. A puzzle's scenario always involves multiple players with the same reasoning capability, who go through the same reasoning steps. According to the principle of induction, a solution to the simplest case makes the solution of the next complicated case obvious. Once the simplest case of the induction puzzle is solved, the whole puzzle is solved subsequently.

Attributes	Values
rdf:type	yago:WikicatLogicPuzzles yago:Abstraction100002137 yago:Communication100033020 yago:Message106598915 yago:Problem106784003 yago:Puzzle106784639 yago:Question106783768 yago:Subject106599788
rdfs:label	Induction puzzles (en)
rdfs:comment	Induction puzzles are logic puzzles, which are examples of multi-agent reasoning, where the solution evolves along with the principle of induction. A puzzle's scenario always involves multiple players with the same reasoning capability, who go through the same reasoning steps. According to the principle of induction, a solution to the simplest case makes the solution of the next complicated case obvious. Once the simplest case of the induction puzzle is solved, the whole puzzle is solved subsequently. (en)
foaf:depiction
dcterms:subject	Formal epistemology Non-cooperative games Game theory game classes Logic puzzles Entertainment Games of mental skill Modal logic Theory of mind
Wikipage page ID	2062017 (xsd:integer)
Wikipage revision ID	1112889479 (xsd:integer)
Link from a Wikipage to another Wikipage	Formal epistemology Prison Nash equilibrium Almost everywhere Non-cooperative games University of California, Santa Barbara Don't ask, don't tell Dynamic epistemic logic Crime Mathematical induction Measurable Oracle machine Game theory Cooperative game theory State space Common knowledge Common knowledge (logic) Communication Computational complexity theory Game theory game classes Logic puzzles Doctor of Philosophy Countable Logic puzzle Non-measurable set Entertainment Data transmission Equivalence relation Folk theorem (game theory) Google scholar Hamming code Backward induction Games of mental skill Modal logic Theory of mind Coding theory Theory of mind Thesis Modus ponens Imperfect information Axiom of choice If and only if Brownian motion Nonverbal communication Extensive-form game Move by nature Non-cooperative game theory Sequential game Vitali set Uncountable set Epistemic logic Algebraic coding theory Extensive form
Link from a Wikipage to an external page	http://brainden.com/logic-puzzles.htm https://web.njit.edu/~wguo/Hat%20Probelm.pdf
sameAs	Induction puzzles Induction puzzles Induction puzzles Induction puzzles Induction puzzles
dbp:wikiPageUsesTemplate	dbt:Puzzles dbt:Citation_needed dbt:EngvarB dbt:Image_frame dbt:Reflist dbt:Short_description
thumbnail	wiki-commons:Special:FilePath/Representation_of_Muddy_Children_Puzzle_in_extensive_form..svg?width=300
align	right (en)
caption	Representation of Muddy Children Puzzle for two players in extensive form. The preliminary move by nature is colored green. Alice is colored red and Bob is colored blue. This game has only one single Nash equilibrium. Actions predicted by this equilibrium are colored black. (en)
content	200 (xsd:integer)
width	200 (xsd:integer)
has abstract	Induction puzzles are logic puzzles, which are examples of multi-agent reasoning, where the solution evolves along with the principle of induction. A puzzle's scenario always involves multiple players with the same reasoning capability, who go through the same reasoning steps. According to the principle of induction, a solution to the simplest case makes the solution of the next complicated case obvious. Once the simplest case of the induction puzzle is solved, the whole puzzle is solved subsequently. Typical tell-tale features of these puzzles include any puzzle in which each participant has a given piece of information (usually as common knowledge) about all other participants but not themselves. Also, usually, some kind of hint is given to suggest that the participants can trust each other's intelligence — they are capable of theory of mind (that "every participant knows modus ponens" is common knowledge). Also, the inaction of a participant is a non-verbal communication of that participant's lack of knowledge, which then becomes common knowledge to all participants who observed the inaction. Muddy children puzzle is the most frequently appearing induction puzzle in scientific literature on epistemic logic. In February 2020, 437 hits on Google scholar mentioned the muddy children puzzle. Muddy children puzzle is a variant of the well known wise men or cheating wives/husbands puzzles. Hat puzzles are induction puzzle variations that date back to as early as 1961. In many variations, hat puzzles are described in the context of prisoners. In other cases, hat puzzles are described in the context of wise men. (en)
gold:hypernym	Puzzles
prov:wasDerivedFrom	wikipedia-en:Induction_puzzles?oldid=1112889479&ns=0
page length (characters) of wiki page	44705 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Induction_puzzles
is Link from a Wikipage to another Wikipage of	List of algebraic coding theory topics List of games in game theory

Faceted Search & Find service v1.17_git147 as of Sep 06 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Dec 5 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 76 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software