On the Complexity of Slide-and-Merge Games Ahmed Abdelkader, Aditya - PowerPoint PPT Presentation

Sep 26, 2022 •210 likes •288 views

On the Complexity of Slide-and-Merge Games Ahmed Abdelkader, Aditya Acharya, Philip Dasler Slide and Merge Games Slide tiles in a NxN grid Equal valued tiles merge Objective: To produce a tile of a given target value Related Work

On the Complexity of Slide-and-Merge Games Ahmed Abdelkader, Aditya Acharya, Philip Dasler
Slide and Merge Games ● Slide tiles in a NxN grid ● Equal valued tiles merge ● Objective: To produce a tile of a given target value
Related Work ● Push-1: A block pushing puzzle ● Move to the target location by pushing blocks ● PushPush: Blocks slide all the way ● Shown to be NP-Hard [Demaine et al. 2000]
Related Work ● Bejeweled and Candy Crush: ● Match three similar three tiles to make them disappear ● Objective: to create as many matching as possible ● Shown to be NP-Hard [Guala et al. 2014]
2048 ● Like tiles merge ● All pieces slide as far as possible ● All single merges that can happen, will ● New tiles ∈ {2,4} are added randomly ● Objective: Obtaining a tile of value 2048
Reduction Approaches • Bejeweled, Candy Crush shown to be NP- Hard: reduction from 1-in-3 Positive SAT • Clauses encoded by a pattern of tiles, satisfied by clearing those tiles • Assignments of variables encoded by the choice of tiles to merge
Reduction Approaches • Push is NP-Hard in 3D [ Rourke 1999] by a reduction from SAT • Push in 2D: • Similar approach to reduction in 3D • Extra gadgets to take care of path intersection

Recommend

Merge Sort: Summary General algorithm: Basic analysis: Divide in half log(n) times,

Merge Sort: Summary General algorithm: Basic analysis: Divide in half log(n) times, merge log(n) times = 2log(n) Merging touches each value once, so it is linear At each level, there are n items to merge Complexity is

240 views • 11 slides

Complexity of backward induction games Jakub Szymanik October 17, 2012 Outline Introduction

Complexity of backward induction games Jakub Szymanik October 17, 2012 Outline Introduction Computational complexity Complexity of a single trial Outlook Only surprising thing about the WikiLeaks revelations is that they contain no

1.21k views • 82 slides

A note on the complexity of backward induction games Jakub Szymanik RAIN @ NASSLLI 2012 Outline

A note on the complexity of backward induction games Jakub Szymanik RAIN @ NASSLLI 2012 Outline Introduction Computational complexity Complexity of a single trial Outlook Outline Introduction Computational complexity Complexity of a

1.03k views • 65 slides

Mail Merge Internals Eilidh McAdam Mail Merge Mail merge fjlls a template from a

Mail Merge Internals Eilidh McAdam Mail Merge Mail merge fjlls a template from a datasource, producing a single or separate documents Datasource includes databases and spreadsheets Also used to generate labels and envelopes

345 views • 17 slides

1 The first problem we're going to tackle is quicksort. Just as all of the complexity of

1 The first problem we're going to tackle is quicksort. Just as all of the complexity of mergesort is in the merge step, not in the recursion, all of the complexity of quicksort is found in the partition step, so let's go over how to perform an

528 views • 31 slides

The Multiple Dimensions of Mean-Payoff Games Laurent Doyen CNRS & LSV, ENS Paris-Saclay RP

The Multiple Dimensions of Mean-Payoff Games Laurent Doyen CNRS & LSV, ENS Paris-Saclay RP 2017 About Basics about mean-payoff games Algorithms & Complexity Strategy complexity Memory Strategy complexity Memory

1.17k views • 95 slides

Complexity of solving games with combination of objectives using separating automata Highlights

Complexity of solving games with combination of objectives using separating automata Highlights 2020 Ashwani Anand, Chennai Mathematical Institute, India This is a joint work with Nathanal Fijalkow and Jrme Leroux LaBRI, France We will

925 views • 38 slides

quiz insertion sort: worst-case time complexity? best-case time complexity? in-place?

quiz insertion sort: worst-case time complexity? best-case time complexity? in-place? recursive version? data structures and algorithms merge sort: 2020 09 10 worst-case time complexity? lecture 4 best-case time complexity? in-place?

548 views • 7 slides

Merge Sort 7 2 9 4 2 4 7 9 7 2 2 7 9 4 4 9 7 7 2 2 9 9 4

Merge Sort 7 2 9 4 2 4 7 9 7 2 2 7 9 4 4 9 7 7 2 2 9 9 4 4 Sets 1 Outline and Reading Divide-and-conquer paradigm (10.1.1) Merge-sort (10.1) Algorithm Merging two sorted sequences

1.08k views • 64 slides

Accelerating the merge phase of sort-merge join FPL 2019 The 29th International Conference on

Accelerating the merge phase of sort-merge join Accelerating the merge phase of sort-merge join FPL 2019 The 29th International Conference on Field-Programmable Logic and Applications Philippos Papaphilippou, Holger Pirk, Wayne Luk Dept. of

118 views • 11 slides

Merge Strategies for Merge-and-Shrink Masters Thesis Daniel Federau 13th February 2017

Merge Strategies for Merge-and-Shrink Masters Thesis Daniel Federau 13th February 2017 Introduction Merge-and-Shrink Evaluation of Merge Strategies Implementation Conclusion Motivation An important factor for the performance of

489 views • 22 slides

On the complexity of approximating exact Fixed Points: Nash Equilibria, Stochastic Games, and

On the complexity of approximating exact Fixed Points: Nash Equilibria, Stochastic Games, and Recursive Markov Chains Kousha Etessami Mihalis Yannakakis U. of Edinburgh Columbia U. Algorithmic Game Theory Workshop, Warwick March 26, 2007 1

428 views • 21 slides

End - to-end simulation of Bunch merge Yu Bao UC

End - to-end simulation of Bunch merge Yu Bao UC Riverside MAP Collaboration meeting Dec. 4, 2014 1 overview October,2013: Longitudinal merge

190 views • 15 slides

Precise Complexity of the Core in Dichotomous and Additive Hedonic Games Dominik Peters

Precise Complexity of the Core in Dichotomous and Additive Hedonic Games Dominik Peters Department of Computer Science University of Oxford ADT Luxembourg 25 October 2017 1 / 14 Hedonic Game A model of Coalition Formation Input:

657 views • 23 slides

Merge sort M ERGE -S ORT A [1 . . n ] 1. If n = 1, done. 2. Recursively sort A [ 1 . . n /2

CS 3343 -- Spring 2009 Merge sort M ERGE -S ORT A [1 . . n ] 1. If n = 1, done. 2. Recursively sort A [ 1 . . n /2 ] and A [ n /2 +1 . . n ] . 3. Merge the 2 sorted lists. Merge Sort Key subroutine: M ERGE Carola Wenk

468 views • 8 slides

Algorithmic Complexity Between Structure and Knowledge How Pursuit-Evasion Games help Nicolas

Intro C & R Graph Searching Modeling Conclusion Algorithmic Complexity Between Structure and Knowledge How Pursuit-Evasion Games help Nicolas Nisse Inria, France Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, Sophia Antipolis, France

1.04k views • 86 slides

The Complexity of Admissibility in -Regular Games R. Brenguier J.-F. Raskin M. Sassolas

The Complexity of Admissibility in -Regular Games R. Brenguier J.-F. Raskin M. Sassolas Romain Brenguier (ULB) Admissibility Thursday, July 17, 2014 1 / 23 Multiplayer non-zero-sum games Romain Brenguier (ULB) Admissibility Thursday,

751 views • 52 slides

GTS AND S UBGAME SEMANTICS I If := x y z w ( x ) then Abelard chooses an

Generalized Quantifiers Branching quantifiers Complexity and difficulty O UTLINE OF THE PROJECT Q UANTIFIERS , GAMES , AND COMPLEXITY Jakub Szymanik Institute for Logic, Language and Computation Universiteit van Amsterdam 17th November 2006

469 views • 20 slides

Model Merge Tooling: Whats New in EMF Diff/Merge for Neon ECLIPSECON FRANCE, 08/06/2016

Model Merge Tooling: Whats New in EMF Diff/Merge for Neon ECLIPSECON FRANCE, 08/06/2016 Model merging? + Transfer data Align (totally/partially) model subsets Report changes 2 EMF Diff/Merge Vision Merging =

416 views • 20 slides

SORTING Chapter 8 Comparison of Quadratic Sorts 2 1 12/6/2017 Merge Sort Section 8.7 Merge

12/6/2017 SORTING Chapter 8 Comparison of Quadratic Sorts 2 1 12/6/2017 Merge Sort Section 8.7 Merge A merge is a common data processing operation performed on two ordered sequences of data. The result is a third ordered sequence

993 views • 29 slides

Where are we going? My Beginning Cancer is different! Fear System complexity Changing

Where are we going? My Beginning Cancer is different! Fear System complexity Changing science Changing demographics Costly Patient-Centered Care Slide With Title And Text Use this one for any slide in which you need to

1.05k views • 37 slides

News from Git in Eclipse Matthias Sohn (SAP) merge strategy extension point enables

News from Git in Eclipse Matthias Sohn (SAP) merge strategy extension point enables external merge strategy used by EMF Compare to provide model merge (Neon) JGit 4.0, EGit 4.1 EMF Compare provides model merge strategy Computes

660 views • 41 slides

ON TIMELINE-BASED GAMES AND THEIR COMPLEXITY Nicola Gigante ICAPS 2020 October 1930, 2020

ON TIMELINE-BASED GAMES AND THEIR COMPLEXITY Nicola Gigante ICAPS 2020 October 1930, 2020 Free University of Bozen-Bolzano, Italy Nancy,-(France) joint work with Angelo Montanari The Internet (World) University of Udine, Italy and Andrea

598 views • 30 slides

Strategy recovery for stochastic mean payoff games Marcello Mamino TU Dresden GRASTA 15,

Strategy recovery for stochastic mean payoff games Marcello Mamino TU Dresden GRASTA 15, October 1923, 2015, Montreal Outline Stochastic games What is the solution of a game? Complexity of stochastic games Strategy

680 views • 19 slides