scholarly journals Connect 4: A Novel Paradigm to Elicit Positive and Negative Insight and Search Problem Solving

2018 ◽  
Vol 9 ◽  
Author(s):  
Gillian Hill ◽  
Shelly M. Kemp
Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-11 ◽  
Author(s):  
Oana Vuculescu ◽  
Mads Kock Pedersen ◽  
Jacob F. Sherson ◽  
Carsten Bergenholtz

Computational modeling is widely used to study how humans and organizations search and solve problems in fields such as economics, management, cultural evolution, and computer science. We argue that current computational modeling research on human problem-solving needs to address several fundamental issues in order to generate more meaningful and falsifiable contributions. Based on comparative simulations and a new type of visualization of how to assess the nature of the fitness landscape, we address two key assumptions that approaches such as the NK framework rely on: that the NK captures the continuum of the complexity of empirical fitness landscapes and that search behavior is a distinct component, independent from the topology of the fitness landscape. We show the limitations of the most common approach to conceptualize how complex, or rugged, a landscape is, as well as how the nature of the fitness landscape is fundamentally intertwined with search behavior. Finally, we outline broader implications for how to simulate problem-solving.


2020 ◽  
Vol 34 (02) ◽  
pp. 1536-1543
Author(s):  
Avraham Itzhakov ◽  
Michael Codish

This paper introduces incremental symmetry breaking constraints for graph search problems which are complete and compact. We show that these constraints can be computed incrementally: A symmetry breaking constraint for order n graphs can be extended to one for order n + 1 graphs. Moreover, these constraints induce a special property on their canonical solutions: An order n canonical graph contains a canonical subgraph on the first k vertices for every 1 ≤ k ≤ n. This facilitates a “generate and extend” paradigm for parallel graph search problem solving: To solve a graph search problem φ on order n graphs, first generate the canonical graphs of some order k < n. Then, compute canonical solutions for φ by extending, in parallel, each canonical order k graph together with suitable symmetry breaking constraints. The contribution is that the proposed symmetry breaking constraints enable us to extend the order k canonical graphs to order n canonical solutions. We demonstrate our approach through its application on two hard graph search problems.


2014 ◽  
Vol 9 (1) ◽  
pp. 88-108 ◽  
Author(s):  
Isabelle S. Robert

This article reports on an exploratory follow-up study on the use of problem-solving strategies of professional revisers, and in particular the use of ‘rereading,’ ‘reflection-reformulation,’ and ‘search’ problem-solving strategies. The study focuses on the frequency of these strategies, on the effect of the revision procedure on the use of these strategies, and on the relationship between the use of these strategies and revision quality and duration. Results based on Think Aloud Protocols (TAPs) and keystroke logging data show that the reflection-reformulation and the search strategies are the most frequent. It seems that the more revisers use the reflection-reformulation strategy, whether alone or in combination with another strategy, the better they revise, but the longer they work. Results also show that the type of revision procedure employed does not seem to have any effect on the use of problem-solving strategies.


1991 ◽  
Vol 55 (5) ◽  
pp. 327-331 ◽  
Author(s):  
GT Chiodo ◽  
WW Bullock ◽  
HR Creamer ◽  
DI Rosenstein
Keyword(s):  

1982 ◽  
Vol 13 (2) ◽  
pp. 129-133
Author(s):  
A. D. Pellegrini

The paper explores the processes by which children use private speech to regulate their behaviors. The first part of the paper explores the ontological development of self-regulating private speech. The theories of Vygotsky and Luria are used to explain this development. The second part of the paper applies these theories to pedagogical settings. The process by which children are exposed to dialogue strategies that help them solve problems is outlined. The strategy has children posing and answering four questions: What is the problem? How will I solve it? Am I using the plan? How did it work? It is argued that this model helps children systematically mediate their problem solving processes.


1989 ◽  
Vol 20 (3) ◽  
pp. 320-332 ◽  
Author(s):  
David A. Shapiro ◽  
Nelson Moses

This article presents a practical and collegial model of problem solving that is based upon the literature in supervision and cognitive learning theory. The model and the procedures it generates are applied directly to supervisory interactions in the public school environment. Specific principles of supervision and related recommendations for collaborative problem solving are discussed. Implications for public school supervision are addressed in terms of continued professional growth of both supervisees and supervisors, interdisciplinary team functioning, and renewal and retention of public school personnel.


1987 ◽  
Vol 18 (3) ◽  
pp. 194-205 ◽  
Author(s):  
Phil J. Connell

The teaching procedures that are commonly used with language-disordered children do not entirely match the goals that they are intended to achieve. By using a problem-solving approach to teaching language rules, the procedures and goals of language teaching become more harmonious. Such procedures allow a child to create a rule to solve a simple language problem created for the child by a clinician who understands the conditions that control the operation of a rule.


Sign in / Sign up

Export Citation Format

Share Document