Dwarves, Elves, Wizards, and Kings

Dwarves, Elves, Wizards, and Kings

Evan Cofsky

in nEAl STEpHEnSon’S novEl CryptonomiCon (EoS), Randy Water- house explains his classification system for the different types of people he meets. Dwarves are hard workers, steadily producing beautiful artifacts in the dark loneliness of their caves. They exert tremendous forces moving moun- tains and shaping earth, and are renowned for their craftsmanship. Elves are elegant, cultured, and spend their days creating new and beautiful magical things. They are so gifted they don’t even realize that other races view these things as otherworldly almost. The wizards are immensely powerful beings almost completely unlike all others, but unlike the elves, they do know about magic and its power and nature, and they wield it with supreme effect. But there is a fourth type of character that Waterhouse alludes to but does not mention specifically. The kings are the visionaries who know what must be done with all of these different characters.

An architect is a king of sorts. The architect must be familiar with all of these characters, and ensure that the architecture has roles for all of them. An archi- tecture designed only for one will attract only that one character to the project, and even with the best dwarves, or elves, or wizards, the team will be severely limited in its reach if it can only approach problems in one way.

?

??A good king will lead all types through a quest, and help them work together to complete it. Without the quest, there is no vision for the team, and it ulti- mately becomes a partisan mess. Without all the characters, the team can only solve one class of problem, and is stopped at the first barrier impassable to that solution.

The architect creates the quest with all the characters in mind. The architec- ture then becomes a guide for finding tasks for the different characters to per- form while learning about one another. When a project encounters difficulty, the team will already know how to approach solving it because the architecture gave them the opportunities to grow into a team.

Evan Cofsky is a software engineer, an amateur musician, and an avid cyclist. He studied both music and computer science in college, and continues to study them. Currently he is a senior software engineer with Virgin Charter as its resident Python expert, and works with an eclectic team of exceptionally bright and diverse people.

时间: 2024-08-04 05:53:03

Dwarves, Elves, Wizards, and Kings的相关文章

POJ2699 The Maximum Number of Strong Kings

Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 2102   Accepted: 975 Description A tournament can be represented by a complete graph in which each vertex denotes a player and a directed edge is from vertex x to vertex y if player x beats

Codeforces Round #327 (Div. 2)-Wizards' Duel

题意: 在一条长度为l的走廊,两个人站在走廊的左右两端分别以p,q的速度走来,问他们相遇时离左端的距离是多少? 思路: 非常简单的暴力题,不解释. 代码如下: 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <fstream> 5 #include <ctime> 6 #include <cmath> 7 #include <cs

CodeForces 591A Wizards&#39; Duel

水题 #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; int main() { double l,a,b; while(~scanf("%lf%lf%lf",&l,&a,&b)) { printf("%.4lf\n",l/(a+b)*a); } return 0

codeforces 591A. Wizards&#39; Duel 解题报告

题目链接:http://codeforces.com/problemset/problem/591/A 题目意思:其实看下面这幅图就知道题意了,就是Harry 和 He-Who-Must-Not-Be-Named 分别在走廊末端,各发射自己的impulse,其中Harry 的 impulse 速度为 p 米/s,He-...-Named (这个名字太长,姑且写成这样)为 q米/s.然后相遇之后各自回到它们的主人身边,再发射,问第二次相遇的时候,Harry的impulse 离他的位置距离是多少.

运维自动化工具ELVES

GitHub:https://github.com/elves-project GitBooks:https://gy-games.gitbooks.io/elves/ 部署:  https://www.travis-ci.org/elves-project

【POJ2699】The Maximum Number of Strong Kings

Description A tournament can be represented by a complete graph in which each vertex denotes a player and a directed edge is from vertex x to vertex y if player x beats player y. For a player x in a tournament T, the score of x is the number of playe

POJ2699_The Maximum Number of Strong Kings

这题目,,,真是...诶.坑了好久. 给一个有向图.U->V表示U可以打败V并得一分. 如果一个人的得分最高,或者他打败所有比自己得分高的人,那么此人就是king. 现在给出每个人的得分,求最多可能有多少个king同时存在. 可以证明,如果有k个人是king,那么至少有一种分配方案使得这k个king都是分数最高的那k个人.(证明略,想想就知道了) 于是我们可以开始枚举从i个人开始,后面的都是king. 除了源点和汇点以外,还有两种点,一种表示人(n),一种表示比赛(n*(n/2)/2). 如果一

随笔—邀请赛前训—Wizards&#39; Duel

题意:给出一个距离,2端2个物体,给出速度v1,v2   相对前进,相遇后速度不变反弹,回端点都又速度不变反弹,求第二次相遇点位置. 思路:物理常识啊... #include<cstdio> #include<cstring> #include<iostream> using namespace std; #define MAX(x,y) (((x)>(y)) ? (x) : (y)) #define MIN(x,y) (((x) < (y)) ? (x)

SGU 223.Little Kings

时间限制:0.25s 空间限制:4M 题意: 在 n*n(n≤10)的棋盘上放 k (k<=n*n)个国王(可攻击相邻的 8 个格子),求使它们无法互相攻击的方案数. Solution: 采用状态压缩,用k位(k<=n)的二进制数1的位置代表棋盘放置的国王的位置. 先用预处理,求出statu[i]仅考虑一行时满足要求的方案,c[i]是statu[i]状态放置的棋子数. f[i][j][p] 代表第i行放置状态为 p时且已经放置了j个棋子的方案数 状态转移方程:f[i][j][p]=Σf[i-1