Patrick Welche <prlw1@cam.ac.uk>
[netbsd-mini2440.git] / games / dab / algor.h
blob95830dd977361ead56991031a0122e4465e40be6
1 /* $NetBSD: algor.h,v 1.3 2006/05/14 03:21:52 christos Exp $ */
3 /*-
4 * Copyright (c) 2003 The NetBSD Foundation, Inc.
5 * All rights reserved.
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Christos Zoulas.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
33 * algor.h: Computer's algorithm
36 #ifndef _H_ALGOR
37 #define _H_ALGOR
39 #include "player.h"
41 class BOARD;
42 class BOX;
44 class ALGOR : public PLAYER {
45 public:
46 ALGOR(const char c);
47 virtual ~ALGOR() {}
48 // Return a proposed move in (y, x, dir)
49 void play(const BOARD& b, size_t& y, size_t& x, int& dir);
51 private:
52 // Closure searches
53 int find_closure(size_t& y, size_t& x, int& dir, BOARD& b);
54 size_t find_max_closure(size_t& y, size_t& x, int& dir, const BOARD& b);
55 size_t find_min_closure1(size_t& y, size_t& x, int& dir, const BOARD& b,
56 int last);
57 size_t find_min_closure(size_t& y, size_t& x, int& dir, const BOARD& b);
59 // Move searches
60 int find_good_turn(size_t& y, size_t& x, int& dir, const BOARD& b);
61 int find_bad_turn(size_t& y, size_t& x, int& dir, BOARD& b, int last);
63 // Move Attempts
64 int try_bad_turn(BOX& box, size_t& y, size_t& x, int& dir, BOARD& b,
65 int last);
66 int try_good_turn(BOX& box, size_t y, size_t x, int& dir, BOARD& b);
68 // Utils
69 size_t count_closure(size_t& y, size_t& x, int& dir, BOARD& b);
71 #ifdef notyet
72 size_t find_single(void);
73 #endif
75 size_t _edge1;
76 size_t _edge2;
77 size_t _maxedge;
80 #endif