All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Tile flipping (Posted on 2015-04-08)
A puzzle consists of a number of tiles, T, colored red on one side and blue on the other.

Start with all red side up. The goal is to get them all blue side up in the fewest number of rounds.
A round consists of flipping exactly N of them.

Find a rule for when the puzzle is impossible for given values of (T,N) with N≤T.

Find a rule for the number of rounds it will take when the puzzle is possible.

 No Solution Yet Submitted by Jer Rating: 4.0000 (2 votes)

Comments: ( You must be logged in to post comments.)
 Subject Author Date No Subject Brian Smith 2016-11-15 10:49:44 re(2): N = 5; Hypothesis when N is odd Steve Herman 2015-04-14 09:34:42 re: N = 5; Hypothesis when N is odd Jer 2015-04-13 06:51:55 N = 5; Hypothesis when N is odd Steve Herman 2015-04-12 08:34:51 re: N = 3 Dej Mar 2015-04-11 05:24:04 N = 3 Steve Herman 2015-04-10 10:18:33 re(2): thoughts Steve Herman 2015-04-09 17:15:44 re: thoughts Ady TZIDON 2015-04-09 14:43:10 thoughts Dej Mar 2015-04-09 11:14:32 re(2): Thoughts - a counterexample for you broll 2015-04-09 09:59:00 re: Thoughts - a counterexample for you Jer 2015-04-09 08:51:08 Thoughts broll 2015-04-09 00:55:35
Please log in:
 Login: Password: Remember me: Sign up! | Forgot password

 Search: Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information