• Share
  • Email
  • Embed
  • Like
  • Save
  • Private Content
Arthur merlin games
 

Arthur merlin games

on

  • 496 views

Enumerations Algorithms with Python Generators. Lightning Talk at PythonBrasil[8]

Enumerations Algorithms with Python Generators. Lightning Talk at PythonBrasil[8]

Statistics

Views

Total Views
496
Views on SlideShare
494
Embed Views
2

Actions

Likes
0
Downloads
6
Comments
0

1 Embed 2

https://twitter.com 2

Accessibility

Categories

Upload Details

Uploaded via as Adobe PDF

Usage Rights

CC Attribution License

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

    Arthur merlin games Arthur merlin games Presentation Transcript

    • Arthur Merlin GamesPythonBrasil[8] Lightning Talk @fmasanori
    • Arthur Merlin Games• Computational Complexity classic intro• Casar 150 donzelas com 150 cavaleiros• Colocar os 150 cavaleiros em torno da Tavola Redonda• Dois problemas passados para Merlin
    • Casar 150 donzelas• Lista de parceiros “queridos”• 150! possibilidades == 10 ^ 262• Verificando uma possibilidade por segundo temos 10 ^ 255 anos• Idade do universo == 10 ^ 22 anos• 10 ^ 79 protons no mundo• Merlin vai resolver este problema?
    • Small sample Jessica Fernanda Pâmela RenataAdriano Bruno Diogo Eclis Gabriel Leandro Walber No obstruction to the goal in this sample
    • Merlin win!
    • Proof?
    • König theorem jessica Fernanda Pâmela RenataAdriano Bruno Diogo Eclis Gabriel Leandro Walber Subconjunto de donzelas com “queridos” menor Obstruction to the goal == simple certificate
    • Round Table• 150 cavaleiros• Somente vizinhos amigos• Novamente 150! possibilidades• Merlin vai resolver este problema?
    • Round Table with no fight Adriano Leandro Bruno Walber Eclis Gabriel Diogo
    • Problematic Round Table Adriano Walber Bruno Leandro Diogo Gabriel Eclis
    • Proof?
    • Simple obstruction is hard
    • Hamiltonian CircuitProbably no good caracterization
    • Enumeration Algorithms• Enumerar == fazer uma lista de objetos de um determinado tipo• Algoritmos “ruins”• Mas melhor que nada• No generators in C enumeration algorithms• But Python have generators 
    • Demo
    • fmasanori@gmail.comfacebook.com/fmasanori twitter.com/fmasanori