5 vues

Transféré par radebp

Logic Puzzles

- CS HT2 L1 Algorithms
- Rad u Pythonu
- Student Booklet for Sep 2015 v6
- Basic HTML
- CSV files
- Intro to Databases for Managing Research Data Oct2013
- An_Introduction_to_Pseudocode_workbook.docx
- Tekst Na Stranicama
- Tkinter Examples
- Intro to Programming1
- Writing a Runestone Lab the Easy Way
- Introducing Databases
- Calling Functions
- 02Tipovi_podataka_varijable
- Sadržaj i Način Polaganja Maturskog Ispita u Gimnaziji
- nat2
- Switchedon Newsletter Spring 2016
- Flow Control Posters - JavaScript and Python
- A Strategic Approach to Teaching Programming at KS3
- CC CodeCards

Vous êtes sur la page 1sur 12

in the south pacific. The Islanders born on

one island always tell the truth, and the

Islanders from the other island always lie.

three Islanders. You ask the first which

island they are from in the most

appropriate Polynesian tongue, and he

indicates that the other two Islanders are

from the same Island.

question, and he also indicates that the

other two Islanders are from the same

island.

answer to the same question?

The Islanders Solution:

(Show your workings)

in the south pacific. The Islanders born on

one island always tell the truth, and the Answer:

Islanders from the other island always lie.

You are on one of the islands, and meet Yes, the third Islander will say the other

three Islanders. You ask the first which two Islanders are from the same island.

island they are from in the most

appropriate Polynesian tongue, and he

indicates that the other two Islanders are

from the same Island.

question, and he also indicates that the

other two Islanders are from the same

island.

answer to the same question?

The Camels Solution:

(Show your workings)

Four Tasmanian camels traveling on a

very narrow ledge encounter four

Tasmanian camels coming the other

way.

never go backwards, especially when on

a precarious ledge.

but only if there is a camel sized space

on the other side.

there was only exactly one camel's width

between the two groups.

groups to go on their way, without any

camel reversing?

The Camels Solution:

(Show your workings)

Four Tasmanian camels traveling on a

very narrow ledge encounter four

Tasmanian camels coming the other

way.

never go backwards, especially when on

a precarious ledge.

but only if there is a camel sized space

on the other side.

there was only exactly one camel's width

between the two groups.

groups to go on their way, without any

camel reversing?

The Cubes Solution:

(Show your workings)

on his office desk.

that the front faces show the current day

of the month.

cubes to allow this?

with a single cube with a side that says

7 on it. You have to use both cubes all

the time. So the 7th day would be "07".

The Cubes Solution:

(Show your workings)

on his office desk. Answer:

Cube One has the following numbers: 0, 1, 2, 3, 4, 5

Every day he arranges both cubes so Cube two has the following numbers: 0, 1, 2, 6, 7, 8

that the front faces show the current day

of the month. The 6 doubles as a 9 when turned the other way

around.

What numbers are on the faces of the

cubes to allow this? There is no day 00, but you still need the 0 on both

cubes in order to make all the numbers between 01

and 09.

Note: You can't represent the day "7"

with a single cube with a side that says Alternate solutions are also possible e.g.

7 on it. You have to use both cubes all

the time. So the 7th day would be "07". Cube One: 1, 2, 4, 0, 5, 6

Cube Two: 3, 1, 2, 7, 8, 0

100 Gold Coins Solution:

(Show your workings)

coins and have to divide up the loot.

treacherous and selfish (especially the

captain).

distribution of the loot. All pirates vote

on the proposal, and if half the crew or

more go "Aye", the loot is divided as

proposed, as no pirate would be willing

to take on the captain without superior

force on their side.

at least half his crew (which includes

himself), he faces a mutiny, and all

pirates will turn against him and make

him walk the plank. The pirates start

over again with the next senior pirate as

captain.

the captain can keep without risking his

life?

100 Gold Coins Solution:

(Show your workings)

coins and have to divide up the loot. The captain says he will take 98 coins, and will give

one coin to the third most senior pirate and another

The pirates are all extremely intelligent, coin to the most junior pirate. He then explains his

treacherous and selfish (especially the decision in a manner like this...

captain).

If there were 2 pirates, pirate 2 being the most

The captain always proposes a senior, he would just vote for himself and that would

distribution of the loot. All pirates vote be 50% of the vote, so he's obviously going to keep

on the proposal, and if half the crew or all the money for himself.

more go "Aye", the loot is divided as

proposed, as no pirate would be willing If there were 3 pirates, pirate 3 has to convince at

to take on the captain without superior least one other person to join in his plan. Pirate 3

force on their side. would take 99 gold coins and give 1 coin to pirate 1.

Pirate 1 knows if he does not vote for pirate 3, then

If the captain fails to obtain support of he gets nothing, so obviously is going to vote for this

at least half his crew (which includes plan.

himself), he faces a mutiny, and all

pirates will turn against him and make If there were 4 pirates, pirate 4 would give 1 coin to

him walk the plank. The pirates start pirate 2, and pirate 2 knows if he does not vote for

over again with the next senior pirate as pirate 4, then he gets nothing, so obviously is going

captain. to vote for this plan.

What is the maximum number of coins As there are 5 pirates, pirates 1 & 3 had obviously

the captain can keep without risking his better vote for the captain, or they face choosing

life? nothing or risking death.

Tower of Hanoi

Solution:

(Show your workings)

You have three wooden poles. On the

first there are 3 discs of different sizes Answer:

with the biggest on the bottom and

getting progressively smaller.

and you can never put a bigger disc on

top of a smaller one.

the right hand pole.

Tower of Hanoi

Solution:

(Show your workings)

You have three wooden poles. On the

first there are 3 discs of different sizes Answer: (with 4 rings, 1st move to the middle)

11

with the biggest on the bottom and 2222

getting progressively smaller. 333333

=================================

2222

You can only move one disc at a time 333333 11

and you can never put a bigger disc on =================================

333333 2222 11

top of a smaller one. =================================

11

333333 2222

Describe the steps to move all 3 rings to =================================

the right hand pole. 11

2222 333333

=================================

Now repeat with 4 discs. 11 2222 333333

=================================

2222

And again with 5. 11 333333

=================================

11

2222

333333

=================================

Foranevennumberofdisks:

make the legal move between pegs A and B

make the legal move between pegs A and C

make the legal move between pegs B and C

repeat until complete

Foranoddnumberofdisks:

make the legal move between pegs A and C

make the legal move between pegs A and B

make the legal move between pegs B and C

repeat until complete

Camels & Bananas

Solution:

(Show your workings)

A trader has 3 000 bananas that must

be transported 1 000km across a desert Answer:

to a market.

to 1,000 bananas, however it needs to

eat one banana for each km that it

walks.

the trader can get to market?

Camels & Bananas

Solution:

(Show your workings)

A trader has 3 000 bananas that must

be transported 1 000km across a desert Answer:533

to a market.

We always start with batches of 1000 bananas so

after each leg we want a multiple of 1000 bananas.

return trips, so there will be 5 trips. 1000 bananas / 5

trips = 200km.

He has a single camel that can carry up

to 1,000 bananas, however it needs to By the second leg there will be 2000 bananas, with

eat one banana for each km that it means 2 trips + 1 return trip. 1000 / 3 = 333km.

walks.

0km 200km 533km 1000km

2k (1k) 0 0 0 Eat 200

2k (200) 600 0 0 Eat 200

1k (1k ) 0 0 0 Eat 200

1k ( 200) 1200 0 0 Eat 200

0 (1k ) 2k 0 0 Eat 200

0 1k (1k ) 334 0 Eat 333

0 1k ( 333) 334 0 Eat 333

0 0 (1k ) 1001 0 Eat 333

What is the largest number of bananas 0 0 1 (1k ) 0 Eat 477

the trader can get to market? 0 0 1 533

- CS HT2 L1 AlgorithmsTransféré parradebp
- Rad u PythonuTransféré parradebp
- Student Booklet for Sep 2015 v6Transféré parradebp
- Basic HTMLTransféré parradebp
- CSV filesTransféré parradebp
- Intro to Databases for Managing Research Data Oct2013Transféré parradebp
- An_Introduction_to_Pseudocode_workbook.docxTransféré parradebp
- Tekst Na StranicamaTransféré parradebp
- Tkinter ExamplesTransféré parradebp
- Intro to Programming1Transféré parradebp
- Writing a Runestone Lab the Easy WayTransféré parradebp
- Introducing DatabasesTransféré parradebp
- Calling FunctionsTransféré parradebp
- 02Tipovi_podataka_varijableTransféré parradebp
- Sadržaj i Način Polaganja Maturskog Ispita u GimnazijiTransféré parradebp
- nat2Transféré parradebp
- Switchedon Newsletter Spring 2016Transféré parradebp
- Flow Control Posters - JavaScript and PythonTransféré parradebp
- A Strategic Approach to Teaching Programming at KS3Transféré parradebp
- CC CodeCardsTransféré parradebp
- 2015 Newsletter Autumn 2015Transféré parradebp
- nat1Transféré parradebp
- sigcse-slides.pdfTransféré parradebp
- 2015 Newsletter Summer 2015Transféré parradebp
- Vodič Za Učenje.1Transféré parradebp
- nat4Transféré parradebp
- Switchedon Newsletter Summer 2016Transféré parradebp
- VJEZBA4Transféré parradebp
- nat3Transféré parradebp

- 09Transféré parhhhrocker3093
- The impact of ERP on supply chain management- Exploratory findings from a European Delphi study.pdfTransféré parshipra177
- PHY5June2004Transféré parapi-3726022
- Webi Training ManualTransféré parvailiafernandes
- Uae Civil CodeTransféré parsureshravi6195
- CF_Week 6Transféré parmusab1993
- FDI and tradeTransféré parMikiKiki
- African Socialism and PostsocialismTransféré parMilutinRakovic
- DL980 G7Transféré parDong Duong Phuong
- 4d flowTransféré parEka Juliantara
- Tanjung Rhu NotesTransféré parEfa Natrah Nordin
- StructureTransféré parKaranDass
- Why Should I Be a TeacherTransféré parVerónica Ivone Ormeño
- Muller Heiner_ Hercules 5Transféré parHesoidos_Vasionov
- 17th Annual Stabilizing Indigenous Languages SymposiumTransféré parapi-25945993
- discipline planTransféré parapi-247029058
- ตู้เก็บทูล mt Toolboss Supplychain by PTSCTransféré parAnansitthichok Muang
- The Significance of Information Technology in Humanities FRANZ BIAG.docxTransféré parFranz Biag
- (Studies in Environmental Anthropology and Ethnobiology) Joshua Lockyer, James R. Veteto-Environmental Anthropology Engaging Ecotopia_ Bioregionalism, Permaculture, And Ecovillages-Berghahn BookTransféré parAnselmo Matusse
- Fourier solution of Mercury's perihelionTransféré parJoe Nahhas
- His Eye is on the Sparrow CompleteTransféré parJohn Russell Morales
- ArroganceTransféré parShahab Saqib Khan
- ProblemsTransféré parSiddhartha Morales
- Section 4Transféré parDonig Fermanian
- Petrobras Anual Report 2017Transféré paredgarmerchan
- Dyslexia in the Digital AgeTransféré parContinuum
- 2017 NCCS Executive Committee for Webpage_rv2Transféré parNCCS Admin
- Full NotesTransféré parKannan Naga
- HMSAMTransféré parlittlebud
- Capítulo 4 Carranza 11 Ed.Transféré parEstefanía Paz Torrejón Guzmán