Device update

TripScript update

The idea is to choose big, dynamic cities in Poland and search there for interesting, accurate memorials and edge conditions.

# Selection of transport

Transport = [train, car, bus]

For each element in Transport:

_____check_cost.

Function check_cost:

If element=car:

_____start check_cost.car.

If element=train:

_____start check_cost.train.

If element=plane:

_____start check_cost.plane.

Function check_cost.car

cost = (((combustion x distance) x price_of_gas) + price_of_renting???)/number_of_participants

# driver needed

Put cost.car into Costs = []

Function check_cost.train

number_of_passangers = (5, 9)

cost = ticket_1_to_2 + ticket_2_to_3 + ...

ticket_Dessau_Berlin

If number_of_passengers <= 5:

_____buy 1 Brandenburger ticket

_____then cost = cost_of_ticket/number_of_passengers

Else:

_____buy 2 Brandenburger tickets

_____then cost = 2 x cost_of_ticket/number_of_passengers

ticket_Berlin_Frankfurt

cost = const. = xx euro

ticket_Frankfurt_CityInPoland

cost = const. = xx euro

ticket_CityInPoland_Berlin

cost = const. = about 30 euro

Put cost.train into Costs = []

Function check_cost.bus

number_of_passangers = (5, 9)

cost = ticket_1_to_2 + ticket_2_to_3 + ... # (to be adjusted)

Put cost.car into Costs = []

Costs = [cost.car, cost.train, cost.bus]

From Costs choose the cheapest element.

### Process of city selection

Take a map of Poland.

If city.population >= 500 000 or city is in Unesco list

_____add city to List1

Else: ignore

city += 1

# now I have a list of cities selected by population

List1 = [city1, city2, city3, city4, ...]

# Hostels

date_of arrival = date1

date_of_departure = date2

For each city in List2, check city.hostePrice and city.hostel.availability

If city.hostelPrice <= 20euro and hostel.availability is from date_of_arrival to date_of_departure,

book a room

Else: ignore

### process

Routes = [Route1, Route2, Route3]

From Routes choose random element and run it.

Route_general: Dessau --> City1 --> City 2 --> ... --> City n --> return.

Route 1: Dessau --> Berlin --> visit 5 sites --> cities in Poland --> visit Berlin --> return

Route 2: Dessau --> visit Berlin --> visit 5 sites --> cities in Poland --> return

Route 3: Dessau --> Berlin --> cities in Poland --> visit 5 sites --> visit Berlin --> return.

# Start

From Dessau go to City1

List_of_activities = [..., ..., ..., ...]

Loop:

_____From List_of_activities: choose place within shortest distance

_____run.

_____Delete from List_of_activities.

_____Activity += 1

_____After each acitivity:

__________If time <= 10PM: #(or any hour)

_______________continue,

__________Else:

_______________if tired:

____________________go back to hostel and sleep.

_______________Else:

____________________go on a party and then to hostel ;-)

__________If feeling hungry:

_______________eat

__________Else:

_______________continue.

If List_of_activities = empty,

_____go to next city from List_of_cities.

_____If List_of cities = empty:

__________go back to Dessau,

_____Else:

__________continue.

End of loop.

Experiments with idea 1

Photos of a mock-up model of the first idea.

Info

Train connection from Warsaw to Kiev by a direct fast train takes 15 hours. From Berlin to Kiev it takes 24 hours.
Hostel prices in Warsaw are about 10 euro.

Script

Memorial Script

# defining variables

T – transport (t1 = train, t2 = car, t3 = plane, t4 = boat?)

M – money

D – duration

warsaw = Warsaw ((x, y, z), hostel 12E, population 1 700 000, memorials=n)

krakow = Krakow ((x, y, z), hostel , population 750 000, memorials=n)

wroclaw = Wroclaw ((x, y, z), hostel, population, memorials=n )

Constants:

Kiev 1^st Mai

Schengen border

Be back on 5^th

Data about hostels and train timetables are given as external content.

### Scheme 1

# From Berlin go to a border.

# Visit 5 sites.

# Cross the boarder.

# Get to a city in Poland.

# Cross Schengen border.

# Go to Kiev (1^st Mai)

# Return to Berlin before 5^th Mai.

### Scheme 2 – now more realistic

# From Berlin get to Kiev, crossing Schengen border. (1^st Mai) (if by train or car)

# Go to a city in Poland, crossing Schengen boarder. (if previous by airplane)

# Cross de-pl border

# Visit 5 sites.

# Go to Berlin/Dessau.

Check train connection from Berlin to Kiev.

If journey.time >= 12hours,

break and search for a plane

Else:

buy a ticket/reserve seats.

### Process of city selection

# First step

Take a map of Europe.

Draw line connecting Berlin and Kiev.

line: y = ax + b

If city.population >= 500 000 and city.location <= 50km from line

add city to List1

Else:

ignore

city += 1

# now I have a list of cities selected by location and population

List1 = [city1, city2, city3, city4, ...]

# Second step

For each city in List1, check city.numberofmemorials.

If city.numberofmemorials >= 10

add to List2

Else:

ignore

# Now I have a list of cities with a sufficient number of memorials.

#Third step

For each city in List2, check city.hosteprice and availability

If city.hostelprice <= 20E and hostel is available from a to b,

add city to SelectedCities

Else:

ignore

#To finally select a city, I can choose it by the largest number of memorials

from SelectedCities choose city with city.numberofmemorials --> maximum.

### Train connections

Check train connection from city.actual to city.next

If train leaves in 1h:

if it is 13-15h:

go for lunch,

else:

go for coffee.

Else:

go home and return at appopriate time.

### Loop for a city

(necessary morning activity omitted)

List of acivities = [...., ...., ...., ....]

Make activity 1.

Check time after each activity.

If time=enough for next activity,

continue

Else:

break and go back to hostel.

Model and photos

Idea 2 - photos of bubbles

Idea 2 - photos of flooding

Idea 2 - diagram

This device is dealing with a characteristics of water: displacement/floatation and its contact with air. It shows a fight between "air in water" and "water in air", which are meeting at the edge, the surface. Construction on land assures stability and provides water falling, which is flooding the foil. Air from below makes the opposite - they animate the edge, make it move and change form or pattern. If we put small glasses or boxes on top, the movement will push them and free objects hidden inside. A variety of patterns can be observed.

First idea.
Exchange between water and land: water gives something to the land and land gives something back. It includes fun and childlike atmosphere.